/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:43:07,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:43:07,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:43:07,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:43:07,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:43:07,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:43:07,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:43:07,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:43:07,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:43:07,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:43:07,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:43:07,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:43:07,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:43:07,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:43:07,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:43:07,661 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:43:07,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:43:07,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:43:07,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:43:07,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:43:07,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:43:07,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:43:07,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:43:07,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:43:07,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:43:07,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:43:07,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:43:07,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:43:07,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:43:07,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:43:07,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:43:07,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:43:07,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:43:07,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:43:07,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:43:07,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:43:07,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:43:07,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:43:07,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:43:07,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:43:07,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:43:07,681 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:43:07,696 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:43:07,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:43:07,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:43:07,697 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:43:07,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:43:07,698 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:43:07,698 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:43:07,698 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:43:07,698 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:43:07,698 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:43:07,698 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:43:07,699 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:43:07,699 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:43:07,699 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:43:07,699 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:43:07,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:43:07,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:43:07,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:43:07,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:43:07,700 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:43:07,700 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:43:07,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:43:07,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:43:07,701 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:43:07,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:43:07,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:43:07,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:43:07,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:43:07,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:43:07,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:43:07,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:43:07,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:43:07,892 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:43:07,892 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:43:07,893 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:43:07,982 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_DvZ2NV/tmp/1219f8de0cd5485d8535ddad409e991d/FLAG846fa962b [2020-07-01 12:43:08,397 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:43:08,398 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:43:08,398 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:43:08,405 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_DvZ2NV/tmp/1219f8de0cd5485d8535ddad409e991d/FLAG846fa962b [2020-07-01 12:43:08,803 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_DvZ2NV/tmp/1219f8de0cd5485d8535ddad409e991d [2020-07-01 12:43:08,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:43:08,816 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:43:08,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:43:08,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:43:08,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:43:08,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7606ac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:08, skipping insertion in model container [2020-07-01 12:43:08,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:43:08" (1/1) ... [2020-07-01 12:43:08,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:43:08,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:43:09,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:43:09,096 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:43:09,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:43:09,130 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:43:09,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09 WrapperNode [2020-07-01 12:43:09,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:43:09,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:43:09,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:43:09,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:43:09,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:43:09,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:43:09,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:43:09,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:43:09,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:43:09,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:43:09,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:43:09,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:43:09,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 12:43:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:43:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:43:09,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:43:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:43:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:43:09,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:43:09,668 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:43:09,669 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:43:09,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:09 BoogieIcfgContainer [2020-07-01 12:43:09,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:43:09,674 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:43:09,674 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:43:09,676 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:43:09,677 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:09" (1/1) ... [2020-07-01 12:43:09,694 INFO L313 BlockEncoder]: Initial Icfg 80 locations, 85 edges [2020-07-01 12:43:09,696 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:43:09,697 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:43:09,697 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:43:09,698 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:43:09,699 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:43:09,700 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:43:09,701 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:43:09,733 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:43:09,776 INFO L200 BlockEncoder]: SBE split 43 edges [2020-07-01 12:43:09,782 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:43:09,784 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:43:09,832 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-07-01 12:43:09,834 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:43:09,836 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:43:09,836 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:43:09,837 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:43:09,838 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:43:09,838 INFO L313 BlockEncoder]: Encoded RCFG 69 locations, 121 edges [2020-07-01 12:43:09,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:09 BasicIcfg [2020-07-01 12:43:09,839 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:43:09,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:43:09,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:43:09,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:43:09,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:43:08" (1/4) ... [2020-07-01 12:43:09,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716bbe2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (2/4) ... [2020-07-01 12:43:09,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716bbe2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:09" (3/4) ... [2020-07-01 12:43:09,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716bbe2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:09, skipping insertion in model container [2020-07-01 12:43:09,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:09" (4/4) ... [2020-07-01 12:43:09,848 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:43:09,859 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:43:09,867 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 42 error locations. [2020-07-01 12:43:09,881 INFO L251 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2020-07-01 12:43:09,904 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:43:09,904 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:43:09,904 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:43:09,905 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:43:09,905 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:43:09,905 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:43:09,905 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:43:09,905 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:43:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2020-07-01 12:43:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:09,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:09,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:09,928 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:09,935 INFO L82 PathProgramCache]: Analyzing trace with hash 170260, now seen corresponding path program 1 times [2020-07-01 12:43:09,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:09,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550943134] [2020-07-01 12:43:09,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,100 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 12:43:10,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550943134] [2020-07-01 12:43:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100949800] [2020-07-01 12:43:10,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,126 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2020-07-01 12:43:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,315 INFO L93 Difference]: Finished difference Result 136 states and 233 transitions. [2020-07-01 12:43:10,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,330 INFO L225 Difference]: With dead ends: 136 [2020-07-01 12:43:10,330 INFO L226 Difference]: Without dead ends: 69 [2020-07-01 12:43:10,333 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 12:43:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-01 12:43:10,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-07-01 12:43:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-01 12:43:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 114 transitions. [2020-07-01 12:43:10,374 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 114 transitions. Word has length 3 [2020-07-01 12:43:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,375 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 114 transitions. [2020-07-01 12:43:10,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 114 transitions. [2020-07-01 12:43:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:10,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:10,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:43:10,378 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 170446, now seen corresponding path program 1 times [2020-07-01 12:43:10,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120135803] [2020-07-01 12:43:10,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,441 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 12:43:10,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120135803] [2020-07-01 12:43:10,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748186112] [2020-07-01 12:43:10,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,445 INFO L87 Difference]: Start difference. First operand 69 states and 114 transitions. Second operand 3 states. [2020-07-01 12:43:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,619 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2020-07-01 12:43:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,622 INFO L225 Difference]: With dead ends: 69 [2020-07-01 12:43:10,622 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 12:43:10,623 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 12:43:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 12:43:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-01 12:43:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 12:43:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 100 transitions. [2020-07-01 12:43:10,630 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 100 transitions. Word has length 3 [2020-07-01 12:43:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,631 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 100 transitions. [2020-07-01 12:43:10,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 100 transitions. [2020-07-01 12:43:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:43:10,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:43:10,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:43:10,632 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 170443, now seen corresponding path program 1 times [2020-07-01 12:43:10,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717229757] [2020-07-01 12:43:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,669 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 12:43:10,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717229757] [2020-07-01 12:43:10,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089401769] [2020-07-01 12:43:10,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,672 INFO L87 Difference]: Start difference. First operand 62 states and 100 transitions. Second operand 3 states. [2020-07-01 12:43:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:10,827 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2020-07-01 12:43:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:10,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:43:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:10,828 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:43:10,828 INFO L226 Difference]: Without dead ends: 54 [2020-07-01 12:43:10,829 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 12:43:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-01 12:43:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-07-01 12:43:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-01 12:43:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 85 transitions. [2020-07-01 12:43:10,835 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 85 transitions. Word has length 3 [2020-07-01 12:43:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:10,835 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 85 transitions. [2020-07-01 12:43:10,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 85 transitions. [2020-07-01 12:43:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:10,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:10,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:10,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:43:10,836 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 5280983, now seen corresponding path program 1 times [2020-07-01 12:43:10,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:10,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860261844] [2020-07-01 12:43:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:10,876 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 12:43:10,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860261844] [2020-07-01 12:43:10,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:10,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:10,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852210302] [2020-07-01 12:43:10,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:10,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:10,879 INFO L87 Difference]: Start difference. First operand 54 states and 85 transitions. Second operand 3 states. [2020-07-01 12:43:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,001 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2020-07-01 12:43:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,002 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:43:11,003 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:43:11,003 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 12:43:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:43:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 12:43:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:43:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2020-07-01 12:43:11,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 4 [2020-07-01 12:43:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,008 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2020-07-01 12:43:11,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2020-07-01 12:43:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:11,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:11,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:11,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:43:11,009 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 5280985, now seen corresponding path program 1 times [2020-07-01 12:43:11,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587220008] [2020-07-01 12:43:11,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,035 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 12:43:11,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587220008] [2020-07-01 12:43:11,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066666794] [2020-07-01 12:43:11,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:11,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,038 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand 3 states. [2020-07-01 12:43:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,111 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-01 12:43:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,112 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:43:11,112 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:43:11,113 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 12:43:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:43:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 12:43:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:43:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2020-07-01 12:43:11,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 4 [2020-07-01 12:43:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,117 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2020-07-01 12:43:11,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2020-07-01 12:43:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:43:11,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:11,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:43:11,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:43:11,118 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 5280986, now seen corresponding path program 1 times [2020-07-01 12:43:11,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030085313] [2020-07-01 12:43:11,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,152 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 12:43:11,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030085313] [2020-07-01 12:43:11,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343022720] [2020-07-01 12:43:11,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:11,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,155 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand 3 states. [2020-07-01 12:43:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,234 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2020-07-01 12:43:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:43:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,236 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:43:11,236 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:43:11,236 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 12:43:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:43:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 12:43:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 12:43:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2020-07-01 12:43:11,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 4 [2020-07-01 12:43:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,240 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2020-07-01 12:43:11,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2020-07-01 12:43:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:43:11,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:11,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:43:11,242 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash 268459346, now seen corresponding path program 1 times [2020-07-01 12:43:11,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448167284] [2020-07-01 12:43:11,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,288 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 12:43:11,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448167284] [2020-07-01 12:43:11,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291489115] [2020-07-01 12:43:11,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:11,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,290 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand 3 states. [2020-07-01 12:43:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,350 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2020-07-01 12:43:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:43:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,351 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:43:11,351 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:43:11,351 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 12:43:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:43:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:43:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:43:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-01 12:43:11,355 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2020-07-01 12:43:11,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,355 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-01 12:43:11,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-07-01 12:43:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:43:11,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:11,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:43:11,357 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash 268459348, now seen corresponding path program 1 times [2020-07-01 12:43:11,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866060567] [2020-07-01 12:43:11,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,392 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 12:43:11,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866060567] [2020-07-01 12:43:11,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252559302] [2020-07-01 12:43:11,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:11,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,394 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2020-07-01 12:43:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,420 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-01 12:43:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:43:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,422 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:43:11,422 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:43:11,422 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 12:43:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:43:11,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:43:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:43:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-01 12:43:11,426 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2020-07-01 12:43:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,426 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-01 12:43:11,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-01 12:43:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:43:11,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:43:11,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:43:11,427 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2020-07-01 12:43:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 268459349, now seen corresponding path program 1 times [2020-07-01 12:43:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150630439] [2020-07-01 12:43:11,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,475 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 12:43:11,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150630439] [2020-07-01 12:43:11,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964561598] [2020-07-01 12:43:11,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:43:11,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,478 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2020-07-01 12:43:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:11,532 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-01 12:43:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:11,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-01 12:43:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:43:11,533 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:43:11,533 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:43:11,534 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 12:43:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:43:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:43:11,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:43:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:43:11,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-01 12:43:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:43:11,535 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:43:11,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:43:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:43:11,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:43:11,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:43:11,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:43:11,573 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:43:11,573 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:43:11,573 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point L11-5(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,574 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:11,575 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,576 INFO L268 CegarLoopResult]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-07-01 12:43:11,577 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,577 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,577 INFO L264 CegarLoopResult]: At program point L16-4(lines 16 17) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_gcd_~x_ref~0.base)) (= 0 ULTIMATE.start_gcd_~y_ref~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_gcd_~r~0.base)) (= 4 (select |#length| ULTIMATE.start_gcd_~r~0.base)) (= 0 ULTIMATE.start_gcd_~x_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_gcd_~x_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_gcd_~r~0.offset) (= 1 (select |#valid| ULTIMATE.start_gcd_~y_ref~0.base))) [2020-07-01 12:43:11,577 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,577 INFO L268 CegarLoopResult]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point L13(lines 13 21) no Hoare annotation was computed. [2020-07-01 12:43:11,578 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point L13-2(lines 5 23) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point L13-3(lines 13 21) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,579 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:43:11,580 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:43:11,581 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 12:43:11,584 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:43:11,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:43:11,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:11,601 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:43:11,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:11 BasicIcfg [2020-07-01 12:43:11,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:43:11,604 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:43:11,604 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:43:11,608 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:43:11,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:11,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:43:08" (1/5) ... [2020-07-01 12:43:11,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16ffe665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:43:11, skipping insertion in model container [2020-07-01 12:43:11,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:11,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:43:09" (2/5) ... [2020-07-01 12:43:11,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16ffe665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:43:11, skipping insertion in model container [2020-07-01 12:43:11,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:11,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:43:09" (3/5) ... [2020-07-01 12:43:11,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16ffe665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:43:11, skipping insertion in model container [2020-07-01 12:43:11,610 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:11,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:43:09" (4/5) ... [2020-07-01 12:43:11,611 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16ffe665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:43:11, skipping insertion in model container [2020-07-01 12:43:11,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:43:11,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:43:11" (5/5) ... [2020-07-01 12:43:11,612 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:43:11,634 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:43:11,634 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:43:11,634 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:43:11,634 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:43:11,634 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:43:11,634 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:43:11,634 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:43:11,634 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:43:11,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. [2020-07-01 12:43:11,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:43:11,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:43:11,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:43:11,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,652 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:43:11,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states. [2020-07-01 12:43:11,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:43:11,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:43:11,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:43:11,656 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,656 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:43:11,661 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [138] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [252] L-1-->L9: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_gcd_~x_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) 0) (= |v_ULTIMATE.start_gcd_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= v_ULTIMATE.start_gcd_~r~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|)) (= v_ULTIMATE.start_gcd_~x_1 |v_ULTIMATE.start_gcd_#in~x_1|) (< 0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_gcd_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (= |v_ULTIMATE.start_gcd_#t~malloc2.offset_1| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (= v_ULTIMATE.start_gcd_~y_1 |v_ULTIMATE.start_gcd_#in~y_1|) (= v_ULTIMATE.start_gcd_~r~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc2.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|)) (= v_ULTIMATE.start_gcd_~x_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc0.offset_1|) (< 0 |v_ULTIMATE.start_gcd_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet16_14|) (= v_ULTIMATE.start_gcd_~y_ref~0.base_1 |v_ULTIMATE.start_gcd_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_gcd_#t~malloc0.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc1.base_1| 4) |v_ULTIMATE.start_gcd_#t~malloc2.base_1| 4)) (= |v_ULTIMATE.start_gcd_#t~malloc1.offset_1| 0) (= v_ULTIMATE.start_gcd_~y_ref~0.offset_1 |v_ULTIMATE.start_gcd_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet17_14|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_1, ULTIMATE.start_gcd_#t~malloc2.offset=|v_ULTIMATE.start_gcd_#t~malloc2.offset_1|, ULTIMATE.start_gcd_#t~malloc2.base=|v_ULTIMATE.start_gcd_#t~malloc2.base_1|, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_gcd_#t~malloc0.base=|v_ULTIMATE.start_gcd_#t~malloc0.base_1|, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~malloc1.base=|v_ULTIMATE.start_gcd_#t~malloc1.base_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~malloc0.offset=|v_ULTIMATE.start_gcd_#t~malloc0.offset_1|, ULTIMATE.start_gcd_#in~y=|v_ULTIMATE.start_gcd_#in~y_1|, ULTIMATE.start_gcd_#in~x=|v_ULTIMATE.start_gcd_#in~x_1|, #length=|v_#length_1|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_1, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_1, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_1|, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_gcd_#t~mem11=|v_ULTIMATE.start_gcd_#t~mem11_1|, ULTIMATE.start_gcd_#t~malloc1.offset=|v_ULTIMATE.start_gcd_#t~malloc1.offset_1|, ULTIMATE.start_gcd_#t~mem12=|v_ULTIMATE.start_gcd_#t~mem12_1|, ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_1|, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_gcd_#t~mem15=|v_ULTIMATE.start_gcd_#t~mem15_1|, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_1, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_1, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_1, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet16_14|, |v_ULTIMATE.start_main_#t~nondet17_14|] AssignedVars[ULTIMATE.start_gcd_~y_ref~0.offset, ULTIMATE.start_gcd_#t~malloc2.offset, ULTIMATE.start_gcd_#t~malloc2.base, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~malloc0.base, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~malloc1.base, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~malloc0.offset, ULTIMATE.start_gcd_#in~y, ULTIMATE.start_gcd_#in~x, #length, ULTIMATE.start_gcd_~x_ref~0.base, ULTIMATE.start_gcd_~y_ref~0.base, ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_gcd_~r~0.base, ULTIMATE.start_main_~x~0, ULTIMATE.start_gcd_#t~mem10, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_gcd_#t~mem11, ULTIMATE.start_gcd_#t~malloc1.offset, ULTIMATE.start_gcd_#t~mem12, ULTIMATE.start_gcd_#t~mem13, ULTIMATE.start_gcd_#t~mem14, ULTIMATE.start_gcd_#t~mem15, ULTIMATE.start_gcd_#res, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_gcd_~x, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_gcd_~y, ULTIMATE.start_gcd_~x_ref~0.offset, ULTIMATE.start_gcd_~r~0.offset] 41#L9true [156] L9-->L9-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_gcd_~x_ref~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_gcd_~x_ref~0.base_3) v_ULTIMATE.start_gcd_~x_ref~0.offset_3 v_ULTIMATE.start_gcd_~x_3))) (= 1 (select |v_#valid_7| v_ULTIMATE.start_gcd_~x_ref~0.base_3))) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_gcd_~x=v_ULTIMATE.start_gcd_~x_3, #length=|v_#length_5|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_3, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 39#L9-1true [150] L9-1-->L10: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_gcd_~y_ref~0.base_3)) (= (store |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_gcd_~y_ref~0.base_3) v_ULTIMATE.start_gcd_~y_ref~0.offset_3 v_ULTIMATE.start_gcd_~y_3)) |v_#memory_int_3|)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_gcd_~y=v_ULTIMATE.start_gcd_~y_3, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 11#L10true [121] L10-->L11: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_5 4) (select |v_#length_9| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_5) (= 1 (select |v_#valid_11| v_ULTIMATE.start_gcd_~x_ref~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_gcd_~x_ref~0.base_6) v_ULTIMATE.start_gcd_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, #valid=|v_#valid_11|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_6, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 26#L11true [205] L11-->L11-5: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| 0) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 6#L11-5true [113] L11-5-->L12: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_gcd_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_5) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y_ref~0.base_6) v_ULTIMATE.start_gcd_~y_ref~0.offset_5))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_5, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 50#L12true [212] L12-->L13-2: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem5_6| 0) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 68#L13-2true [2020-07-01 12:43:11,663 INFO L796 eck$LassoCheckResult]: Loop: 68#L13-2true [192] L13-2-->L13: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_gcd_~y_ref~0.base_15) v_ULTIMATE.start_gcd_~y_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_11 4) (select |v_#length_21| v_ULTIMATE.start_gcd_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_11) (= 1 (select |v_#valid_23| v_ULTIMATE.start_gcd_~y_ref~0.base_15))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_11, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 69#L13true [196] L13-->L15: Formula: (< 0 |v_ULTIMATE.start_gcd_#t~mem7_6|) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 17#L15true [126] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_11) (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_11 4) (select |v_#length_23| v_ULTIMATE.start_gcd_~x_ref~0.base_15)) (= (select (select |v_#memory_int_14| v_ULTIMATE.start_gcd_~x_ref~0.base_15) v_ULTIMATE.start_gcd_~x_ref~0.offset_11) |v_ULTIMATE.start_gcd_#t~mem8_2|) (= (select |v_#valid_25| v_ULTIMATE.start_gcd_~x_ref~0.base_15) 1)) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, #valid=|v_#valid_25|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_15, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_2|, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem8] 31#L15-1true [340] L15-1-->L16-4: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_13 4) (select |v_#length_50| v_ULTIMATE.start_gcd_~r~0.base_18)) (= (store |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18 (store (select |v_#memory_int_36| v_ULTIMATE.start_gcd_~r~0.base_18) v_ULTIMATE.start_gcd_~r~0.offset_13 |v_ULTIMATE.start_gcd_#t~mem8_6|)) |v_#memory_int_35|) (= 1 (select |v_#valid_57| v_ULTIMATE.start_gcd_~r~0.base_18)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_13)) InVars {ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_36|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_6|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_18, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_35|, #length=|v_#length_50|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_5|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_gcd_#t~mem8] 51#L16-4true [174] L16-4-->L16-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_gcd_~r~0.base_6)) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_gcd_~r~0.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_gcd_~r~0.base_6) v_ULTIMATE.start_gcd_~r~0.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} OutVars{ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_6, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_2|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9] 34#L16-1true [146] L16-1-->L16-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem10_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_gcd_~y_ref~0.base_18) v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (= 1 (select |v_#valid_31| v_ULTIMATE.start_gcd_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_13)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_13, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_18|, #length=|v_#length_29|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_18, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_2|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem10] 55#L16-2true [234] L16-2-->L16-5: Formula: (> |v_ULTIMATE.start_gcd_#t~mem10_4| |v_ULTIMATE.start_gcd_#t~mem9_4|) InVars {ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_4|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_4|} OutVars{ULTIMATE.start_gcd_#t~mem9=|v_ULTIMATE.start_gcd_#t~mem9_3|, ULTIMATE.start_gcd_#t~mem10=|v_ULTIMATE.start_gcd_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem9, ULTIMATE.start_gcd_#t~mem10] 49#L16-5true [168] L16-5-->L19: Formula: (and (= 1 (select |v_#valid_39| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_17) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_17 4) (select |v_#length_37| v_ULTIMATE.start_gcd_~y_ref~0.base_24)) (= |v_ULTIMATE.start_gcd_#t~mem13_2| (select (select |v_#memory_int_23| v_ULTIMATE.start_gcd_~y_ref~0.base_24) v_ULTIMATE.start_gcd_~y_ref~0.offset_17))) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_2|, ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_17, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_23|, #length=|v_#length_37|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_24} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13] 22#L19true [344] L19-->L20: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~x_ref~0.offset_22 4) (select |v_#length_54| v_ULTIMATE.start_gcd_~x_ref~0.base_29)) (<= 0 v_ULTIMATE.start_gcd_~x_ref~0.offset_22) (= (store |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29 (store (select |v_#memory_int_41| v_ULTIMATE.start_gcd_~x_ref~0.base_29) v_ULTIMATE.start_gcd_~x_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem13_6|)) |v_#memory_int_40|) (= (select |v_#valid_64| v_ULTIMATE.start_gcd_~x_ref~0.base_29) 1)) InVars {ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_6|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_41|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} OutVars{ULTIMATE.start_gcd_#t~mem13=|v_ULTIMATE.start_gcd_#t~mem13_5|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_40|, #length=|v_#length_54|, ULTIMATE.start_gcd_~x_ref~0.base=v_ULTIMATE.start_gcd_~x_ref~0.base_29, ULTIMATE.start_gcd_~x_ref~0.offset=v_ULTIMATE.start_gcd_~x_ref~0.offset_22} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem13, #memory_int] 44#L20true [159] L20-->L20-1: Formula: (and (= 1 (select |v_#valid_43| v_ULTIMATE.start_gcd_~r~0.base_15)) (= |v_ULTIMATE.start_gcd_#t~mem14_2| (select (select |v_#memory_int_26| v_ULTIMATE.start_gcd_~r~0.base_15) v_ULTIMATE.start_gcd_~r~0.offset_11)) (<= 0 v_ULTIMATE.start_gcd_~r~0.offset_11) (<= (+ v_ULTIMATE.start_gcd_~r~0.offset_11 4) (select |v_#length_41| v_ULTIMATE.start_gcd_~r~0.base_15))) InVars {#memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} OutVars{ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_2|, ULTIMATE.start_gcd_~r~0.base=v_ULTIMATE.start_gcd_~r~0.base_15, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_gcd_~r~0.offset=v_ULTIMATE.start_gcd_~r~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14] 40#L20-1true [346] L20-1-->L13-2: Formula: (and (= 1 (select |v_#valid_66| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (= (store |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31 (store (select |v_#memory_int_45| v_ULTIMATE.start_gcd_~y_ref~0.base_31) v_ULTIMATE.start_gcd_~y_ref~0.offset_22 |v_ULTIMATE.start_gcd_#t~mem14_6|)) |v_#memory_int_44|) (<= (+ v_ULTIMATE.start_gcd_~y_ref~0.offset_22 4) (select |v_#length_56| v_ULTIMATE.start_gcd_~y_ref~0.base_31)) (<= 0 v_ULTIMATE.start_gcd_~y_ref~0.offset_22)) InVars {ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_6|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_45|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} OutVars{ULTIMATE.start_gcd_~y_ref~0.offset=v_ULTIMATE.start_gcd_~y_ref~0.offset_22, ULTIMATE.start_gcd_#t~mem14=|v_ULTIMATE.start_gcd_#t~mem14_5|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_44|, #length=|v_#length_56|, ULTIMATE.start_gcd_~y_ref~0.base=v_ULTIMATE.start_gcd_~y_ref~0.base_31} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem14, #memory_int] 68#L13-2true [2020-07-01 12:43:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1191654748, now seen corresponding path program 1 times [2020-07-01 12:43:11,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638606962] [2020-07-01 12:43:11,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:43:11,685 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 12:43:11,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638606962] [2020-07-01 12:43:11,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:43:11,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:43:11,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612287461] [2020-07-01 12:43:11,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:43:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:43:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1492953194, now seen corresponding path program 1 times [2020-07-01 12:43:11,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:43:11,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355752606] [2020-07-01 12:43:11,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:43:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:43:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:43:11,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:43:11,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:43:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:43:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:43:11,881 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2020-07-01 12:43:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:43:12,015 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2020-07-01 12:43:12,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:43:12,018 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 12:43:12,023 INFO L168 Benchmark]: Toolchain (without parser) took 3205.82 ms. Allocated memory was 649.6 MB in the beginning and 748.7 MB in the end (delta: 99.1 MB). Free memory was 562.6 MB in the beginning and 637.0 MB in the end (delta: -74.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,023 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:43:12,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 562.6 MB in the beginning and 641.4 MB in the end (delta: -78.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.23 ms. Allocated memory is still 678.4 MB. Free memory was 641.4 MB in the beginning and 639.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,025 INFO L168 Benchmark]: Boogie Preprocessor took 26.00 ms. Allocated memory is still 678.4 MB. Free memory was 639.2 MB in the beginning and 638.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,025 INFO L168 Benchmark]: RCFGBuilder took 473.38 ms. Allocated memory is still 678.4 MB. Free memory was 638.2 MB in the beginning and 603.6 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,026 INFO L168 Benchmark]: BlockEncodingV2 took 164.78 ms. Allocated memory is still 678.4 MB. Free memory was 603.6 MB in the beginning and 588.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,026 INFO L168 Benchmark]: TraceAbstraction took 1763.77 ms. Allocated memory was 678.4 MB in the beginning and 748.7 MB in the end (delta: 70.3 MB). Free memory was 587.4 MB in the beginning and 692.7 MB in the end (delta: -105.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:43:12,027 INFO L168 Benchmark]: BuchiAutomizer took 415.92 ms. Allocated memory is still 748.7 MB. Free memory was 692.7 MB in the beginning and 637.0 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:43:12,030 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 80 locations, 85 edges - StatisticsResult: Encoded RCFG 69 locations, 121 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 313.94 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 562.6 MB in the beginning and 641.4 MB in the end (delta: -78.8 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.23 ms. Allocated memory is still 678.4 MB. Free memory was 641.4 MB in the beginning and 639.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.00 ms. Allocated memory is still 678.4 MB. Free memory was 639.2 MB in the beginning and 638.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 473.38 ms. Allocated memory is still 678.4 MB. Free memory was 638.2 MB in the beginning and 603.6 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 164.78 ms. Allocated memory is still 678.4 MB. Free memory was 603.6 MB in the beginning and 588.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1763.77 ms. Allocated memory was 678.4 MB in the beginning and 748.7 MB in the end (delta: 70.3 MB). Free memory was 587.4 MB in the beginning and 692.7 MB in the end (delta: -105.2 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 415.92 ms. Allocated memory is still 748.7 MB. Free memory was 692.7 MB in the beginning and 637.0 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #StackHeapBarrier - 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 #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 12:43:12,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:43:12,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,043 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,043 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:43:12,043 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((4 == unknown-#length-unknown[x_ref] && 0 == y_ref) && 4 == unknown-#length-unknown[y_ref]) && 1 == \valid[r]) && 4 == unknown-#length-unknown[r]) && 0 == x_ref) && 1 == \valid[x_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == r) && 1 == \valid[y_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 42 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 91 SDtfs, 529 SDslu, 5 SDs, 0 SdLazy, 488 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 2054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 12:43:05.463 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp/BenchExec_run_DvZ2NV/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:43:12.267 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check