/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:11:51,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:11:51,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:11:51,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:11:51,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:11:51,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:11:51,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:11:51,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:11:51,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:11:51,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:11:51,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:11:51,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:11:51,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:11:51,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:11:51,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:11:51,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:11:51,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:11:51,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:11:51,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:11:51,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:11:51,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:11:51,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:11:51,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:11:51,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:11:51,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:11:51,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:11:51,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:11:51,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:11:51,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:11:51,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:11:51,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:11:51,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:11:51,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:11:51,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:11:51,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:11:51,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:11:51,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:11:51,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:11:51,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:11:51,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:11:51,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:11:51,905 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 13:11:51,919 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:11:51,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:11:51,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:11:51,921 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:11:51,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:11:51,921 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:51,921 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:11:51,922 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:11:51,922 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:11:51,922 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:11:51,922 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:11:51,922 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:11:51,923 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:11:51,923 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:11:51,923 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:11:51,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:11:51,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:11:51,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:11:51,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:11:51,924 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:51,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:11:51,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:11:52,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:11:52,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:11:52,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:11:52,114 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:11:52,114 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:11:52,115 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:52,186 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_r5Nqq6/tmp/7941b443c50447759b1cbf7804887c68/FLAG0db6a7936 [2020-07-01 13:11:52,521 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:11:52,521 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 13:11:52,522 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:11:52,528 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_r5Nqq6/tmp/7941b443c50447759b1cbf7804887c68/FLAG0db6a7936 [2020-07-01 13:11:52,944 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_r5Nqq6/tmp/7941b443c50447759b1cbf7804887c68 [2020-07-01 13:11:52,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:11:52,957 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:11:52,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:52,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:11:52,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:11:52,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:52" (1/1) ... [2020-07-01 13:11:52,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b41a634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:52, skipping insertion in model container [2020-07-01 13:11:52,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:11:52" (1/1) ... [2020-07-01 13:11:52,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:11:52,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:11:53,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,238 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:11:53,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:11:53,272 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:11:53,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53 WrapperNode [2020-07-01 13:11:53,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:11:53,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:11:53,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:11:53,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:11:53,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:11:53,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:11:53,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:11:53,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:11:53,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:11:53,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:11:53,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:11:53,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:11:53,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:11:53,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:11:53,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:11:53,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:11:53,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:11:53,647 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:11:53,648 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:11:53,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53 BoogieIcfgContainer [2020-07-01 13:11:53,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:11:53,653 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:11:53,653 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:11:53,655 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:11:53,655 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (1/1) ... [2020-07-01 13:11:53,669 INFO L313 BlockEncoder]: Initial Icfg 22 locations, 26 edges [2020-07-01 13:11:53,670 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:11:53,671 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:11:53,671 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:11:53,672 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:11:53,674 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:11:53,675 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:11:53,675 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:11:53,694 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:11:53,718 INFO L200 BlockEncoder]: SBE split 8 edges [2020-07-01 13:11:53,723 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:11:53,725 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:53,751 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 13:11:53,754 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 13:11:53,755 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:11:53,756 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:11:53,756 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:11:53,757 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:11:53,757 INFO L313 BlockEncoder]: Encoded RCFG 15 locations, 27 edges [2020-07-01 13:11:53,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53 BasicIcfg [2020-07-01 13:11:53,758 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:11:53,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:11:53,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:11:53,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:11:53,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:11:52" (1/4) ... [2020-07-01 13:11:53,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f24e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/4) ... [2020-07-01 13:11:53,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f24e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/4) ... [2020-07-01 13:11:53,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f24e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:11:53, skipping insertion in model container [2020-07-01 13:11:53,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53" (4/4) ... [2020-07-01 13:11:53,766 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:11:53,776 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:11:53,783 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-01 13:11:53,796 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-01 13:11:53,820 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:11:53,820 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:11:53,820 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:11:53,820 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:11:53,820 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:11:53,821 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:11:53,821 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:11:53,821 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:11:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-01 13:11:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:53,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:53,842 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:53,843 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash 125972526, now seen corresponding path program 1 times [2020-07-01 13:11:53,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:53,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115328517] [2020-07-01 13:11:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115328517] [2020-07-01 13:11:54,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216034917] [2020-07-01 13:11:54,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,052 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 13:11:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,144 INFO L93 Difference]: Finished difference Result 15 states and 27 transitions. [2020-07-01 13:11:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,159 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:11:54,159 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:11:54,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:11:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:11:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:11:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-07-01 13:11:54,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 5 [2020-07-01 13:11:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,200 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-07-01 13:11:54,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-07-01 13:11:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:54,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:54,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:11:54,203 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 125972528, now seen corresponding path program 1 times [2020-07-01 13:11:54,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310498473] [2020-07-01 13:11:54,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310498473] [2020-07-01 13:11:54,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:11:54,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839001725] [2020-07-01 13:11:54,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:11:54,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:11:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:11:54,249 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2020-07-01 13:11:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,314 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2020-07-01 13:11:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:11:54,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:11:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,316 INFO L225 Difference]: With dead ends: 15 [2020-07-01 13:11:54,316 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:11:54,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:11:54,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:11:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:11:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:11:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2020-07-01 13:11:54,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 24 transitions. Word has length 5 [2020-07-01 13:11:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,321 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 24 transitions. [2020-07-01 13:11:54,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:11:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 24 transitions. [2020-07-01 13:11:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:11:54,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:11:54,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:11:54,322 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,323 INFO L82 PathProgramCache]: Analyzing trace with hash 125972529, now seen corresponding path program 1 times [2020-07-01 13:11:54,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047799416] [2020-07-01 13:11:54,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047799416] [2020-07-01 13:11:54,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669057367] [2020-07-01 13:11:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,363 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. Second operand 3 states. [2020-07-01 13:11:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,406 INFO L93 Difference]: Finished difference Result 14 states and 24 transitions. [2020-07-01 13:11:54,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:11:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,407 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:11:54,407 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:11:54,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:11:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:11:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:11:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-01 13:11:54,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 5 [2020-07-01 13:11:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,411 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2020-07-01 13:11:54,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2020-07-01 13:11:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:11:54,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:11:54,412 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,413 INFO L82 PathProgramCache]: Analyzing trace with hash -389818398, now seen corresponding path program 1 times [2020-07-01 13:11:54,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054198129] [2020-07-01 13:11:54,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054198129] [2020-07-01 13:11:54,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:11:54,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695668224] [2020-07-01 13:11:54,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:11:54,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:11:54,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:11:54,479 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 5 states. [2020-07-01 13:11:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,594 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-07-01 13:11:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:11:54,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-07-01 13:11:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,596 INFO L225 Difference]: With dead ends: 21 [2020-07-01 13:11:54,596 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:11:54,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:11:54,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:11:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2020-07-01 13:11:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:11:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2020-07-01 13:11:54,601 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 26 transitions. Word has length 6 [2020-07-01 13:11:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,601 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 26 transitions. [2020-07-01 13:11:54,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:11:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 26 transitions. [2020-07-01 13:11:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:11:54,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:11:54,603 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash -389818401, now seen corresponding path program 1 times [2020-07-01 13:11:54,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633333134] [2020-07-01 13:11:54,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633333134] [2020-07-01 13:11:54,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:11:54,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122367801] [2020-07-01 13:11:54,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:11:54,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:11:54,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,634 INFO L87 Difference]: Start difference. First operand 14 states and 26 transitions. Second operand 3 states. [2020-07-01 13:11:54,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,674 INFO L93 Difference]: Finished difference Result 14 states and 26 transitions. [2020-07-01 13:11:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:11:54,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:11:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,675 INFO L225 Difference]: With dead ends: 14 [2020-07-01 13:11:54,675 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:11:54,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:11:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:11:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:11:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:11:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-07-01 13:11:54,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 6 [2020-07-01 13:11:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,679 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-07-01 13:11:54,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:11:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-07-01 13:11:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:11:54,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:11:54,680 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 800530717, now seen corresponding path program 1 times [2020-07-01 13:11:54,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004053932] [2020-07-01 13:11:54,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004053932] [2020-07-01 13:11:54,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:11:54,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157419741] [2020-07-01 13:11:54,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:11:54,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:11:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:11:54,739 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 4 states. [2020-07-01 13:11:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,811 INFO L93 Difference]: Finished difference Result 13 states and 22 transitions. [2020-07-01 13:11:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:11:54,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:11:54,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,812 INFO L225 Difference]: With dead ends: 13 [2020-07-01 13:11:54,812 INFO L226 Difference]: Without dead ends: 12 [2020-07-01 13:11:54,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:11:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-01 13:11:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-01 13:11:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 13:11:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2020-07-01 13:11:54,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 [2020-07-01 13:11:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,816 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 20 transitions. [2020-07-01 13:11:54,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:11:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 20 transitions. [2020-07-01 13:11:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:11:54,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:11:54,817 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 800530719, now seen corresponding path program 1 times [2020-07-01 13:11:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353310969] [2020-07-01 13:11:54,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353310969] [2020-07-01 13:11:54,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:11:54,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874994559] [2020-07-01 13:11:54,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:11:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:11:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:11:54,858 INFO L87 Difference]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2020-07-01 13:11:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:54,906 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2020-07-01 13:11:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:11:54,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:11:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:54,907 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:11:54,907 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:11:54,907 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:11:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:11:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-07-01 13:11:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:11:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 22 transitions. [2020-07-01 13:11:54,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 22 transitions. Word has length 7 [2020-07-01 13:11:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:54,911 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 22 transitions. [2020-07-01 13:11:54,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:11:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 22 transitions. [2020-07-01 13:11:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:11:54,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:54,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:54,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:11:54,912 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 800530720, now seen corresponding path program 1 times [2020-07-01 13:11:54,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:54,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380389201] [2020-07-01 13:11:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:54,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380389201] [2020-07-01 13:11:54,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:54,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 13:11:54,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530942474] [2020-07-01 13:11:54,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:11:54,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:11:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:11:54,967 INFO L87 Difference]: Start difference. First operand 13 states and 22 transitions. Second operand 5 states. [2020-07-01 13:11:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,043 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-07-01 13:11:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:11:55,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-07-01 13:11:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,044 INFO L225 Difference]: With dead ends: 16 [2020-07-01 13:11:55,044 INFO L226 Difference]: Without dead ends: 15 [2020-07-01 13:11:55,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:11:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-01 13:11:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-01 13:11:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:11:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-07-01 13:11:55,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 21 transitions. Word has length 7 [2020-07-01 13:11:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,049 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-07-01 13:11:55,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:11:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 21 transitions. [2020-07-01 13:11:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:11:55,050 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:55,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:55,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:11:55,050 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1344015987, now seen corresponding path program 1 times [2020-07-01 13:11:55,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416669832] [2020-07-01 13:11:55,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416669832] [2020-07-01 13:11:55,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:11:55,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:11:55,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502158069] [2020-07-01 13:11:55,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 13:11:55,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 13:11:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:11:55,181 INFO L87 Difference]: Start difference. First operand 13 states and 21 transitions. Second operand 7 states. [2020-07-01 13:11:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:55,409 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2020-07-01 13:11:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:11:55,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 13:11:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:55,410 INFO L225 Difference]: With dead ends: 30 [2020-07-01 13:11:55,411 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 13:11:55,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:11:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 13:11:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 13:11:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 13:11:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-01 13:11:55,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 10 [2020-07-01 13:11:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:55,415 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-01 13:11:55,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 13:11:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-01 13:11:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:11:55,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:55,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:55,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:11:55,416 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555216, now seen corresponding path program 1 times [2020-07-01 13:11:55,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:55,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908446800] [2020-07-01 13:11:55,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908446800] [2020-07-01 13:11:55,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161058261] [2020-07-01 13:11:55,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:11:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:55,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-01 13:11:55,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:55,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:11:55,737 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:55,747 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:55,750 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:11:55,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 13:11:55,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:55,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 13:11:55,802 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:55,805 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:11:55,817 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:55,820 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:11:55,823 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:11:55,825 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 13:11:55,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 13:11:55,861 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:11:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:55,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:11:55,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-01 13:11:55,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352786172] [2020-07-01 13:11:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 13:11:55,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 13:11:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-01 13:11:55,900 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 12 states. [2020-07-01 13:11:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:56,309 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2020-07-01 13:11:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:11:56,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2020-07-01 13:11:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:56,310 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:11:56,310 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:11:56,311 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-01 13:11:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:11:56,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-07-01 13:11:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:11:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2020-07-01 13:11:56,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 10 [2020-07-01 13:11:56,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:56,315 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-07-01 13:11:56,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 13:11:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2020-07-01 13:11:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:11:56,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:56,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:56,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 13:11:56,517 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1823555215, now seen corresponding path program 1 times [2020-07-01 13:11:56,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:56,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755423226] [2020-07-01 13:11:56,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:56,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755423226] [2020-07-01 13:11:56,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212637892] [2020-07-01 13:11:56,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:11:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:56,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:11:56,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:11:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:11:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165871479] [2020-07-01 13:11:56,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:11:56,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:11:56,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:11:56,597 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand 4 states. [2020-07-01 13:11:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:56,632 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-01 13:11:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:11:56,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:11:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:56,633 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:11:56,633 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:11:56,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:11:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:11:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:11:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:11:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-01 13:11:56,637 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 10 [2020-07-01 13:11:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:56,638 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-01 13:11:56,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:11:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-01 13:11:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:11:56,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:56,639 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:56,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:11:56,840 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash 695636017, now seen corresponding path program 1 times [2020-07-01 13:11:56,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:56,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310092281] [2020-07-01 13:11:56,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:56,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310092281] [2020-07-01 13:11:56,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224757880] [2020-07-01 13:11:56,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:11:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:56,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:11:56,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:56,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:11:56,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:11:56,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633542246] [2020-07-01 13:11:56,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:11:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:11:56,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:11:56,924 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 4 states. [2020-07-01 13:11:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:11:56,958 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-01 13:11:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:11:56,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:11:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:11:56,959 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:11:56,959 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 13:11:56,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:11:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 13:11:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 13:11:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 13:11:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-01 13:11:56,963 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2020-07-01 13:11:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:11:56,963 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-01 13:11:56,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:11:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-01 13:11:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:11:56,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:11:56,964 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:11:57,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-01 13:11:57,165 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:11:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:11:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash 695636018, now seen corresponding path program 1 times [2020-07-01 13:11:57,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:11:57,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44678131] [2020-07-01 13:11:57,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:11:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:57,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44678131] [2020-07-01 13:11:57,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376854837] [2020-07-01 13:11:57,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:11:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:11:57,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 13:11:57,283 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:11:57,289 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_20|]} [2020-07-01 13:11:57,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:11:57,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:11:57,298 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:57,315 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:57,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:11:57,323 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:11:57,335 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:11:57,336 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:11:57,336 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:15 [2020-07-01 13:11:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:11:57,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:11:57,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-07-01 13:11:57,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907746278] [2020-07-01 13:11:57,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 13:11:57,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:11:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 13:11:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:11:57,448 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 11 states. [2020-07-01 13:12:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:07,821 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-01 13:12:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:12:07,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-07-01 13:12:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:07,823 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:12:07,823 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:12:07,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-01 13:12:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:12:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-07-01 13:12:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-01 13:12:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-01 13:12:07,827 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2020-07-01 13:12:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:07,827 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-01 13:12:07,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 13:12:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-01 13:12:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:12:07,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:07,828 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:08,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:08,029 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:12:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:08,029 INFO L82 PathProgramCache]: Analyzing trace with hash 474108219, now seen corresponding path program 2 times [2020-07-01 13:12:08,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:08,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932267830] [2020-07-01 13:12:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:08,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932267830] [2020-07-01 13:12:08,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703635900] [2020-07-01 13:12:08,270 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:08,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:12:08,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:12:08,319 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 13:12:08,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:12:08,326 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_21|]} [2020-07-01 13:12:08,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:12:08,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:12:08,333 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,342 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:12:08,348 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,358 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,359 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,359 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 13:12:08,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:12:08,390 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,398 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,399 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:12:08,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2020-07-01 13:12:08,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2020-07-01 13:12:08,441 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,450 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,452 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:12:08,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:19 [2020-07-01 13:12:08,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 13:12:08,495 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:08,496 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:12:08,508 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:08,509 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:12:08,510 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:08,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 13:12:08,546 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:08,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:12:08,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-07-01 13:12:08,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999063053] [2020-07-01 13:12:08,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 13:12:08,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 13:12:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-01 13:12:08,563 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 14 states. [2020-07-01 13:12:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:09,307 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-01 13:12:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 13:12:09,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2020-07-01 13:12:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:09,309 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:12:09,309 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 13:12:09,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2020-07-01 13:12:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 13:12:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-01 13:12:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:12:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-01 13:12:09,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2020-07-01 13:12:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:09,314 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-01 13:12:09,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 13:12:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-01 13:12:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 13:12:09,315 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:09,315 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:09,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-01 13:12:09,516 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:12:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1570498009, now seen corresponding path program 1 times [2020-07-01 13:12:09,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:09,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030613210] [2020-07-01 13:12:09,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:12:09,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030613210] [2020-07-01 13:12:09,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117081125] [2020-07-01 13:12:09,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:09,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-01 13:12:09,700 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:12:09,704 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_22|]} [2020-07-01 13:12:09,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:12:09,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:12:09,710 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,717 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:12:09,721 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,727 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,728 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,728 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-07-01 13:12:09,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:12:09,734 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,738 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,738 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-01 13:12:09,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 13:12:09,745 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,750 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,751 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,751 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2020-07-01 13:12:09,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-01 13:12:09,762 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,769 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,770 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-07-01 13:12:09,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:12:09,794 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:09,795 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:12:09,803 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:12:09,804 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:12:09,804 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:12:09,823 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:12:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:12:09,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:12:09,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-01 13:12:09,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769039216] [2020-07-01 13:12:09,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 13:12:09,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:09,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 13:12:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:12:09,836 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 10 states. [2020-07-01 13:12:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:09,983 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-01 13:12:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:12:09,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-01 13:12:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:09,984 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:12:09,984 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:12:09,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:12:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:12:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:12:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:12:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:12:09,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-01 13:12:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:09,986 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:12:09,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 13:12:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:12:09,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:12:10,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:12:10,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:12:10,665 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-07-01 13:12:10,669 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:12:10,669 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 13:12:10,669 INFO L268 CegarLoopResult]: For program point L17-1(lines 11 26) no Hoare annotation was computed. [2020-07-01 13:12:10,669 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-01 13:12:10,669 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 26) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point L7-2(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 13:12:10,670 INFO L268 CegarLoopResult]: For program point L7-4(line 7) no Hoare annotation was computed. [2020-07-01 13:12:10,671 INFO L264 CegarLoopResult]: At program point L7-5(line 7) the Hoare annotation is: (let ((.cse19 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (.cse18 (select |#memory_int| ULTIMATE.start_cstpcpy_~from.base)) (.cse11 (select |#length| ULTIMATE.start_cstpcpy_~from.base)) (.cse20 (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (let ((.cse0 (not (= ULTIMATE.start_cstpcpy_~to.base ULTIMATE.start_cstpcpy_~from.base))) (.cse1 (not .cse20)) (.cse2 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse4 (= 0 (select .cse18 (+ .cse11 (- 1))))) (.cse7 (<= (+ ULTIMATE.start_cstpcpy_~from.offset 1) .cse11)) (.cse13 (<= ULTIMATE.start_main_~length2~0 .cse19)) (.cse3 (= 0 ULTIMATE.start_cstpcpy_~to.offset)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~to.base))) (.cse12 (select |#length| ULTIMATE.start_cstpcpy_~to.base)) (.cse6 (= 1 (select |#valid| ULTIMATE.start_cstpcpy_~from.base))) (.cse8 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse10 (or .cse20 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1))) (.cse14 (= 0 ULTIMATE.start_main_~nondetArea~0.offset)) (.cse15 (= 0 ULTIMATE.start_main_~nondetString~0.offset)) (.cse16 (= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse17 (= 0 ULTIMATE.start_cstpcpy_~from.offset))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= 1 ULTIMATE.start_cstpcpy_~to.offset) .cse6 (<= (+ ULTIMATE.start_cstpcpy_~to.offset .cse11) (+ .cse12 ULTIMATE.start_cstpcpy_~from.offset)) .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_cstpcpy_~from.offset) .cse10 .cse13 .cse14 .cse15 .cse16) (and (<= 1 .cse11) (= 0 (select .cse18 ULTIMATE.start_cstpcpy_~from.offset)) .cse3 .cse5 (<= 1 .cse12) .cse6 .cse8 .cse9 .cse10 (<= 1 .cse19) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString~0.offset)) .cse14 .cse15 .cse16 .cse17)))) [2020-07-01 13:12:10,673 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:12:10,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,690 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,691 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:10 BasicIcfg [2020-07-01 13:12:10,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:12:10,710 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:12:10,710 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:12:10,714 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:12:10,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:10,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:11:52" (1/5) ... [2020-07-01 13:12:10,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fbffc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:12:10, skipping insertion in model container [2020-07-01 13:12:10,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:10,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:11:53" (2/5) ... [2020-07-01 13:12:10,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fbffc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:12:10, skipping insertion in model container [2020-07-01 13:12:10,716 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:10,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:11:53" (3/5) ... [2020-07-01 13:12:10,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fbffc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:12:10, skipping insertion in model container [2020-07-01 13:12:10,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:10,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:11:53" (4/5) ... [2020-07-01 13:12:10,717 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fbffc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:12:10, skipping insertion in model container [2020-07-01 13:12:10,717 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:10,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:10" (5/5) ... [2020-07-01 13:12:10,719 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:12:10,745 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:12:10,746 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:12:10,746 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:12:10,746 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:12:10,746 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:12:10,746 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:12:10,746 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:12:10,746 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:12:10,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 13:12:10,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:12:10,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:12:10,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:12:10,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:10,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 13:12:10,759 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:12:10,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-01 13:12:10,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 13:12:10,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:12:10,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:12:10,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:10,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 13:12:10,766 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [103] ULTIMATE.startENTRY-->L14: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_15| (store |v_#valid_16| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_9, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_15|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc5.offset] 17#L14true [75] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 13#L14-2true [61] L14-2-->L17-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 5#L17-1true [88] L17-1-->L23: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc5.base_2|)) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2| 1)) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_8) |v_ULTIMATE.start_main_#t~malloc6.base_2| v_ULTIMATE.start_main_~length2~0_8)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_2|)) (>= v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~length2~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, #valid, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_main_#t~malloc5.base, #length, ULTIMATE.start_main_#t~malloc5.offset] 14#L23true [105] L23-->L7-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12))) (and (= |v_ULTIMATE.start_cstpcpy_#in~from.base_2| v_ULTIMATE.start_cstpcpy_~from.base_8) (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_5 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (= v_ULTIMATE.start_cstpcpy_~from.offset_7 |v_ULTIMATE.start_cstpcpy_#in~from.offset_2|) (= v_ULTIMATE.start_cstpcpy_~to.offset_8 |v_ULTIMATE.start_cstpcpy_#in~to.offset_2|) (<= .cse0 (select |v_#length_10| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length2~0_12 (- 1)) 0)) |v_#memory_int_6|) (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstpcpy_#in~from.base_2|) (= |v_ULTIMATE.start_cstpcpy_#in~to.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (= v_ULTIMATE.start_cstpcpy_~to.base_9 |v_ULTIMATE.start_cstpcpy_#in~to.base_2|))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12} OutVars{ULTIMATE.start_cstpcpy_#in~from.offset=|v_ULTIMATE.start_cstpcpy_#in~from.offset_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstpcpy_#res.base=|v_ULTIMATE.start_cstpcpy_#res.base_4|, ULTIMATE.start_cstpcpy_#in~to.offset=|v_ULTIMATE.start_cstpcpy_#in~to.offset_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_4|, ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_8|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstpcpy_#res.offset=|v_ULTIMATE.start_cstpcpy_#res.offset_4|, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_7, ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, ULTIMATE.start_cstpcpy_#in~from.base=|v_ULTIMATE.start_cstpcpy_#in~from.base_2|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_4|, #length=|v_#length_10|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_8, ULTIMATE.start_cstpcpy_#in~to.base=|v_ULTIMATE.start_cstpcpy_#in~to.base_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_12, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_9, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#in~from.offset, ULTIMATE.start_cstpcpy_#res.base, ULTIMATE.start_cstpcpy_#in~to.offset, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~mem2, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#res.offset, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#in~from.base, #memory_int, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_#in~to.base, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 15#L7-5true [2020-07-01 13:12:10,767 INFO L796 eck$LassoCheckResult]: Loop: 15#L7-5true [66] L7-5-->L7-1: Formula: (and (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstpcpy_~from.base_3) v_ULTIMATE.start_cstpcpy_~from.offset_3) |v_ULTIMATE.start_cstpcpy_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstpcpy_~from.offset_3) (<= (+ v_ULTIMATE.start_cstpcpy_~from.offset_3 1) (select |v_#length_6| v_ULTIMATE.start_cstpcpy_~from.base_3)) (= 1 (select |v_#valid_8| v_ULTIMATE.start_cstpcpy_~from.base_3))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_2|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_3, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 7#L7-1true [53] L7-1-->L7-2: Formula: (and (= (store |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3 (store (select |v_#memory_int_5| v_ULTIMATE.start_cstpcpy_~to.base_3) v_ULTIMATE.start_cstpcpy_~to.offset_3 |v_ULTIMATE.start_cstpcpy_#t~mem2_3|)) |v_#memory_int_4|) (<= (+ v_ULTIMATE.start_cstpcpy_~to.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstpcpy_~to.base_3)) (= (select |v_#valid_10| v_ULTIMATE.start_cstpcpy_~to.base_3) 1) (<= 0 v_ULTIMATE.start_cstpcpy_~to.offset_3)) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_3, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_3} AuxVars[] AssignedVars[#memory_int] 4#L7-2true [101] L7-2-->L7-4: Formula: (> 0 |v_ULTIMATE.start_cstpcpy_#t~mem2_7|) InVars {ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_7|} OutVars{ULTIMATE.start_cstpcpy_#t~mem2=|v_ULTIMATE.start_cstpcpy_#t~mem2_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~mem2] 16#L7-4true [71] L7-4-->L7-5: Formula: (and (= v_ULTIMATE.start_cstpcpy_~from.base_6 v_ULTIMATE.start_cstpcpy_~from.base_7) (= v_ULTIMATE.start_cstpcpy_~to.base_6 v_ULTIMATE.start_cstpcpy_~to.base_7) (= v_ULTIMATE.start_cstpcpy_~to.offset_5 (+ v_ULTIMATE.start_cstpcpy_~to.offset_6 1)) (= v_ULTIMATE.start_cstpcpy_~from.offset_5 (+ v_ULTIMATE.start_cstpcpy_~from.offset_6 1))) InVars {ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_7, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_6, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_7} OutVars{ULTIMATE.start_cstpcpy_#t~pre0.base=|v_ULTIMATE.start_cstpcpy_#t~pre0.base_2|, ULTIMATE.start_cstpcpy_#t~pre0.offset=|v_ULTIMATE.start_cstpcpy_#t~pre0.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.offset=|v_ULTIMATE.start_cstpcpy_#t~pre1.offset_2|, ULTIMATE.start_cstpcpy_#t~pre1.base=|v_ULTIMATE.start_cstpcpy_#t~pre1.base_2|, ULTIMATE.start_cstpcpy_~from.base=v_ULTIMATE.start_cstpcpy_~from.base_6, ULTIMATE.start_cstpcpy_~from.offset=v_ULTIMATE.start_cstpcpy_~from.offset_5, ULTIMATE.start_cstpcpy_~to.base=v_ULTIMATE.start_cstpcpy_~to.base_6, ULTIMATE.start_cstpcpy_~to.offset=v_ULTIMATE.start_cstpcpy_~to.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstpcpy_#t~pre0.base, ULTIMATE.start_cstpcpy_#t~pre0.offset, ULTIMATE.start_cstpcpy_#t~pre1.offset, ULTIMATE.start_cstpcpy_#t~pre1.base, ULTIMATE.start_cstpcpy_~from.base, ULTIMATE.start_cstpcpy_~from.offset, ULTIMATE.start_cstpcpy_~to.base, ULTIMATE.start_cstpcpy_~to.offset] 15#L7-5true [2020-07-01 13:12:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 126047593, now seen corresponding path program 1 times [2020-07-01 13:12:10,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:10,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627750477] [2020-07-01 13:12:10,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:10,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627750477] [2020-07-01 13:12:10,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:10,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:10,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927251698] [2020-07-01 13:12:10,784 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:12:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2943862, now seen corresponding path program 1 times [2020-07-01 13:12:10,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:10,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52402912] [2020-07-01 13:12:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:12:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:12:10,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:12:10,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:10,875 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-07-01 13:12:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:10,916 INFO L93 Difference]: Finished difference Result 15 states and 24 transitions. [2020-07-01 13:12:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:10,919 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:12:10,922 INFO L168 Benchmark]: Toolchain (without parser) took 17966.13 ms. Allocated memory was 514.9 MB in the beginning and 657.5 MB in the end (delta: 142.6 MB). Free memory was 438.5 MB in the beginning and 571.8 MB in the end (delta: -133.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,923 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:12:10,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.67 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 437.8 MB in the beginning and 526.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 560.5 MB. Free memory was 526.5 MB in the beginning and 524.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,924 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 560.5 MB. Free memory was 524.5 MB in the beginning and 523.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,924 INFO L168 Benchmark]: RCFGBuilder took 309.57 ms. Allocated memory is still 560.5 MB. Free memory was 523.2 MB in the beginning and 504.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,924 INFO L168 Benchmark]: BlockEncodingV2 took 105.21 ms. Allocated memory is still 560.5 MB. Free memory was 504.2 MB in the beginning and 496.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,925 INFO L168 Benchmark]: TraceAbstraction took 16951.04 ms. Allocated memory was 560.5 MB in the beginning and 657.5 MB in the end (delta: 97.0 MB). Free memory was 496.1 MB in the beginning and 601.6 MB in the end (delta: -105.5 MB). Peak memory consumption was 168.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,925 INFO L168 Benchmark]: BuchiAutomizer took 210.59 ms. Allocated memory is still 657.5 MB. Free memory was 601.6 MB in the beginning and 571.8 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:10,928 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 22 locations, 26 edges - StatisticsResult: Encoded RCFG 15 locations, 27 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 315.67 ms. Allocated memory was 514.9 MB in the beginning and 560.5 MB in the end (delta: 45.6 MB). Free memory was 437.8 MB in the beginning and 526.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 27.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 560.5 MB. Free memory was 526.5 MB in the beginning and 524.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 560.5 MB. Free memory was 524.5 MB in the beginning and 523.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 309.57 ms. Allocated memory is still 560.5 MB. Free memory was 523.2 MB in the beginning and 504.2 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 105.21 ms. Allocated memory is still 560.5 MB. Free memory was 504.2 MB in the beginning and 496.7 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 16951.04 ms. Allocated memory was 560.5 MB in the beginning and 657.5 MB in the end (delta: 97.0 MB). Free memory was 496.1 MB in the beginning and 601.6 MB in the end (delta: -105.5 MB). Peak memory consumption was 168.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 210.59 ms. Allocated memory is still 657.5 MB. Free memory was 601.6 MB in the beginning and 571.8 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant [2020-07-01 13:12:10,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,938 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,939 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,940 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,941 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,942 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,945 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,947 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,948 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:12:10,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:10,949 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && 1 <= length2) && 0 == to) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && 1 == \valid[to]) && 1 == \valid[from]) && from + 1 <= unknown-#length-unknown[from]) && 1 <= length1) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == nondetArea) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) && 0 == from) || ((((((((((((((((!(to == from) && !(nondetString == nondetArea)) && 1 <= length2) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && 1 == \valid[to]) && 1 <= to) && 1 == \valid[from]) && to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from) && from + 1 <= unknown-#length-unknown[from]) && 1 <= length1) && 1 == \valid[nondetString]) && 1 <= from) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && length2 <= unknown-#length-unknown[nondetArea]) && 0 == nondetArea) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString])) || ((((((((((((((1 <= unknown-#length-unknown[from] && 0 == unknown-#memory_int-unknown[from][from]) && 0 == to) && 1 == \valid[to]) && 1 <= unknown-#length-unknown[to]) && 1 == \valid[from]) && 1 <= length1) && 1 == \valid[nondetString]) && (nondetString == nondetArea || \valid[nondetArea] == 1)) && 1 <= unknown-#length-unknown[nondetArea]) && 1 == length2 + nondetString) && 0 == nondetArea) && 0 == nondetString) && length2 == unknown-#length-unknown[nondetString]) && 0 == from) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 SDtfs, 392 SDslu, 229 SDs, 0 SdLazy, 718 SolverSat, 197 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 249 HoareAnnotationTreeSize, 1 FomulaSimplifications, 260 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 269 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 185 ConstructedInterpolants, 7 QuantifiedInterpolants, 17424 SizeOfPredicates, 50 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 10/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:11:49.691 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_r5Nqq6/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:12:11.175 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check