./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f5ca85c7b25a1170338078284726dfa78f10c43 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:24:27,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:24:27,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:24:27,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:24:27,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:24:27,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:24:27,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:24:27,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:24:27,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:24:27,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:24:27,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:24:27,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:24:27,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:24:27,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:24:27,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:24:27,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:24:27,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:24:27,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:24:27,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:24:27,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:24:27,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:24:27,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:24:27,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:24:27,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:24:27,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:24:27,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:24:27,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:24:27,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:24:27,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:24:27,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:24:27,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:24:27,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:24:27,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:24:27,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:24:27,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:24:27,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:24:27,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:24:27,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:24:27,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:24:27,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:24:27,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:24:27,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:24:27,741 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:24:27,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:24:27,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:24:27,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:24:27,743 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:24:27,744 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:24:27,744 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:24:27,744 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:24:27,745 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:24:27,745 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:24:27,745 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:24:27,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:24:27,746 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:24:27,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:24:27,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:24:27,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:24:27,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:24:27,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:24:27,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:24:27,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:24:27,748 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:24:27,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:24:27,749 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:24:27,749 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:24:27,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:24:27,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:24:27,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:24:27,750 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:24:27,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:24:27,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:24:27,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:24:27,751 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:24:27,753 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:24:27,753 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f5ca85c7b25a1170338078284726dfa78f10c43 [2020-07-29 03:24:28,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:24:28,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:24:28,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:24:28,085 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:24:28,086 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:24:28,086 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2020-07-29 03:24:28,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756d7c32/9723e43a2f0d462f92f76366235bddff/FLAG9fb771573 [2020-07-29 03:24:28,804 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:24:28,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-1.i [2020-07-29 03:24:28,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756d7c32/9723e43a2f0d462f92f76366235bddff/FLAG9fb771573 [2020-07-29 03:24:29,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e756d7c32/9723e43a2f0d462f92f76366235bddff [2020-07-29 03:24:29,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:24:29,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:24:29,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:29,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:24:29,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:24:29,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:29" (1/1) ... [2020-07-29 03:24:29,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5f70b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:29, skipping insertion in model container [2020-07-29 03:24:29,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:29" (1/1) ... [2020-07-29 03:24:29,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:24:29,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:24:29,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:29,863 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:24:29,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:30,076 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:24:30,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30 WrapperNode [2020-07-29 03:24:30,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:30,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:30,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:24:30,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:24:30,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:30,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:24:30,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:24:30,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:24:30,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... [2020-07-29 03:24:30,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:24:30,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:24:30,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:24:30,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:24:30,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:24:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:24:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 03:24:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:24:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 03:24:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:24:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 03:24:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-29 03:24:30,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:24:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:24:30,811 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:30,816 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:30,886 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:30,887 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:30,912 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:30,913 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 03:24:46,587 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##706: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,587 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##707: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,588 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##713: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,588 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##714: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,588 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-10: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,588 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-10: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,589 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-11: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,589 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-11: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet2, __CS_cs_#t~nondet3, __CS_cs_#t~ite4, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet2;havoc __CS_cs_#t~nondet2; [2020-07-29 03:24:46,589 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-12: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,589 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-12: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,589 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-38: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-38: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-39: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-39: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet2, __CS_cs_#t~nondet3, __CS_cs_#t~ite4, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet2;havoc __CS_cs_#t~nondet2; [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-40: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-40: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,590 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-66: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-66: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-67: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-67: assume !(0 != ~__CS_ret~0 % 256);havoc __CS_cs_#t~nondet2, __CS_cs_#t~nondet3, __CS_cs_#t~ite4, __CS_cs_~k~0;__CS_cs_~k~0 := __CS_cs_#t~nondet2;havoc __CS_cs_#t~nondet2; [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-68: assume 0 != ~__CS_ret~0 % 256;main_thread_#res.base, main_thread_#res.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0.base, main_thread_~#t1~0.offset);havoc main_thread_~#t1~0.base, main_thread_~#t1~0.offset;call ULTIMATE.dealloc(main_thread_~#t2~0.base, main_thread_~#t2~0.offset);havoc main_thread_~#t2~0.base, main_thread_~#t2~0.offset; [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L547-68: assume !(0 != ~__CS_ret~0 % 256); [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-30: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,591 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-30: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-32: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-30: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-30: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-32: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-33: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,592 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-33: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-35: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-36: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-36: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-38: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-108: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,593 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-108: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2020-07-29 03:24:46,594 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-110: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,594 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-114: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,594 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-114: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,594 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-116: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,594 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-117: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-117: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-119: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-120: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-120: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-122: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,595 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-186: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-186: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2); [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-188: ~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-198: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-198: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-200: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,596 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-201: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-201: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-203: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-204: assume 0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256;__CS_cs_#t~ite4 := ~__CS_ret_PREEMPTED~0 % 256; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-204: assume !(0 != __CS_cs_#t~nondet3 && 1 == ~__CS_round~0 % 256);__CS_cs_#t~ite4 := ~__CS_ret~0 % 256; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint L552-206: ~__CS_ret~0 := __CS_cs_#t~ite4;havoc __CS_cs_#t~ite4;havoc __CS_cs_#t~nondet3; [2020-07-29 03:24:46,597 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##419: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,598 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##418: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,598 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,598 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,598 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,598 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,599 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);assume false; [2020-07-29 03:24:46,599 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !!(~__CS_round~0 % 256 + __CS_cs_~k~0 % 256 < 2);~__CS_round~0 := ~__CS_round~0 % 256 + __CS_cs_~k~0 % 256; [2020-07-29 03:24:46,614 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:24:46,614 INFO L295 CfgBuilder]: Removed 288 assume(true) statements. [2020-07-29 03:24:46,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:46 BoogieIcfgContainer [2020-07-29 03:24:46,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:24:46,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:24:46,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:24:46,627 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:24:46,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:46,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:24:29" (1/3) ... [2020-07-29 03:24:46,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6053ba92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:46, skipping insertion in model container [2020-07-29 03:24:46,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:46,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:30" (2/3) ... [2020-07-29 03:24:46,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6053ba92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:46, skipping insertion in model container [2020-07-29 03:24:46,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:46,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:46" (3/3) ... [2020-07-29 03:24:46,633 INFO L371 chiAutomizerObserver]: Analyzing ICFG cs_stateful-1.i [2020-07-29 03:24:46,683 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:24:46,684 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:24:46,684 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:24:46,684 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:24:46,684 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:24:46,684 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:24:46,684 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:24:46,684 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:24:46,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states. [2020-07-29 03:24:46,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:24:46,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:46,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:46,880 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:46,881 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:46,881 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:24:46,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states. [2020-07-29 03:24:46,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 03:24:46,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:46,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:46,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:46,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:46,927 INFO L794 eck$LassoCheckResult]: Stem: 353#ULTIMATE.startENTRYtrue havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97, ULTIMATE.init_#t~nondet98, ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101];havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet97;havoc ULTIMATE.init_#t~nondet98;havoc ULTIMATE.init_#t~nondet96; 269#L-1true havoc main_#res;havoc main_#t~nondet48, main_#t~nondet49, main_#t~pre47, main_~j~2, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~pre46, main_~i~0, main_#t~mem54, main_#t~mem55, main_#t~mem56, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58.base, main_#t~mem58.offset, main_#t~mem59.base, main_#t~mem59.offset, main_#t~mem60, main_#t~mem61, main_#t~mem62, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82.base, main_#t~mem82.offset, main_#t~mem83.base, main_#t~mem83.offset, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88, main_#t~mem89, main_#t~mem90, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 292#L747-3true [2020-07-29 03:24:46,928 INFO L796 eck$LassoCheckResult]: Loop: 292#L747-3true assume !!(main_~i~0 < 2);main_~j~2 := 0; 365#L748-3true assume !(main_~j~2 < 3); 366#L748-4true call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; 289#L747-2true main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; 292#L747-3true [2020-07-29 03:24:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 03:24:46,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:46,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244940579] [2020-07-29 03:24:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,284 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1237577, now seen corresponding path program 1 times [2020-07-29 03:24:47,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:47,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688777872] [2020-07-29 03:24:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:47,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {577#true} assume !!(main_~i~0 < 2);main_~j~2 := 0; {579#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:47,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {579#(<= ULTIMATE.start_main_~j~2 0)} assume !(main_~j~2 < 3); {578#false} is VALID [2020-07-29 03:24:47,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {578#false} call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; {578#false} is VALID [2020-07-29 03:24:47,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {578#false} main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; {578#false} is VALID [2020-07-29 03:24:47,358 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-29 03:24:47,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688777872] [2020-07-29 03:24:47,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:24:47,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:24:47,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646442392] [2020-07-29 03:24:47,366 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:24:47,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:24:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:24:47,389 INFO L87 Difference]: Start difference. First operand 571 states. Second operand 3 states. [2020-07-29 03:24:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,141 INFO L93 Difference]: Finished difference Result 573 states and 796 transitions. [2020-07-29 03:24:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:24:58,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:24:58,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:58,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 796 transitions. [2020-07-29 03:24:58,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:24:58,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 9 states and 10 transitions. [2020-07-29 03:24:58,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:24:58,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:24:58,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-07-29 03:24:58,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:58,194 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 03:24:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-07-29 03:24:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-07-29 03:24:58,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:58,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand 8 states. [2020-07-29 03:24:58,222 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand 8 states. [2020-07-29 03:24:58,224 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 8 states. [2020-07-29 03:24:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,225 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 03:24:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 03:24:58,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:58,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:58,227 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states and 10 transitions. [2020-07-29 03:24:58,227 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states and 10 transitions. [2020-07-29 03:24:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,228 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 03:24:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 03:24:58,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:58,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:58,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:58,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:24:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 03:24:58,231 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 03:24:58,231 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 03:24:58,231 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:24:58,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 03:24:58,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:24:58,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:58,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:58,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:58,233 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:24:58,233 INFO L794 eck$LassoCheckResult]: Stem: 1158#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97, ULTIMATE.init_#t~nondet98, ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101];havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet97;havoc ULTIMATE.init_#t~nondet98;havoc ULTIMATE.init_#t~nondet96; 1153#L-1 havoc main_#res;havoc main_#t~nondet48, main_#t~nondet49, main_#t~pre47, main_~j~2, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~pre46, main_~i~0, main_#t~mem54, main_#t~mem55, main_#t~mem56, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58.base, main_#t~mem58.offset, main_#t~mem59.base, main_#t~mem59.offset, main_#t~mem60, main_#t~mem61, main_#t~mem62, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82.base, main_#t~mem82.offset, main_#t~mem83.base, main_#t~mem83.offset, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88, main_#t~mem89, main_#t~mem90, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1154#L747-3 [2020-07-29 03:24:58,242 INFO L796 eck$LassoCheckResult]: Loop: 1154#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1155#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1156#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1160#L748-3 assume !(main_~j~2 < 3); 1159#L748-4 call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; 1157#L747-2 main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; 1154#L747-3 [2020-07-29 03:24:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 03:24:58,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:58,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333280884] [2020-07-29 03:24:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:58,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:58,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:58,344 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1191030535, now seen corresponding path program 1 times [2020-07-29 03:24:58,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:58,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549886259] [2020-07-29 03:24:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:58,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {1184#true} assume !!(main_~i~0 < 2);main_~j~2 := 0; {1186#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:58,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {1186#(<= ULTIMATE.start_main_~j~2 0)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1186#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:58,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {1186#(<= ULTIMATE.start_main_~j~2 0)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1187#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:58,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {1187#(<= ULTIMATE.start_main_~j~2 1)} assume !(main_~j~2 < 3); {1185#false} is VALID [2020-07-29 03:24:58,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {1185#false} call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; {1185#false} is VALID [2020-07-29 03:24:58,444 INFO L280 TraceCheckUtils]: 5: Hoare triple {1185#false} main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; {1185#false} is VALID [2020-07-29 03:24:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:58,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549886259] [2020-07-29 03:24:58,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398180507] [2020-07-29 03:24:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:24:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:58,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:24:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:58,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:58,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {1184#true} assume !!(main_~i~0 < 2);main_~j~2 := 0; {1186#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:58,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {1186#(<= ULTIMATE.start_main_~j~2 0)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1186#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:58,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {1186#(<= ULTIMATE.start_main_~j~2 0)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1187#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:58,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {1187#(<= ULTIMATE.start_main_~j~2 1)} assume !(main_~j~2 < 3); {1185#false} is VALID [2020-07-29 03:24:58,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {1185#false} call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; {1185#false} is VALID [2020-07-29 03:24:58,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {1185#false} main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; {1185#false} is VALID [2020-07-29 03:24:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:58,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:58,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 03:24:58,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509424752] [2020-07-29 03:24:58,661 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:24:58,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:24:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:24:58,662 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 03:24:58,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,824 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 03:24:58,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:24:58,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:24:58,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:58,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 03:24:58,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 03:24:58,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 03:24:58,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:24:58,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:24:58,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-07-29 03:24:58,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:58,841 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 03:24:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-07-29 03:24:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 03:24:58,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:58,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand 10 states. [2020-07-29 03:24:58,843 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand 10 states. [2020-07-29 03:24:58,843 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2020-07-29 03:24:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,844 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 03:24:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 03:24:58,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:58,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:58,845 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 12 transitions. [2020-07-29 03:24:58,846 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 12 transitions. [2020-07-29 03:24:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:58,846 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 03:24:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 03:24:58,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:58,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:58,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:58,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 03:24:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 03:24:58,849 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 03:24:58,849 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 03:24:58,849 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:24:58,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-07-29 03:24:58,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:24:58,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:58,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:58,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:58,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-07-29 03:24:58,851 INFO L794 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97, ULTIMATE.init_#t~nondet98, ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101];havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet97;havoc ULTIMATE.init_#t~nondet98;havoc ULTIMATE.init_#t~nondet96; 1214#L-1 havoc main_#res;havoc main_#t~nondet48, main_#t~nondet49, main_#t~pre47, main_~j~2, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~pre46, main_~i~0, main_#t~mem54, main_#t~mem55, main_#t~mem56, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58.base, main_#t~mem58.offset, main_#t~mem59.base, main_#t~mem59.offset, main_#t~mem60, main_#t~mem61, main_#t~mem62, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82.base, main_#t~mem82.offset, main_#t~mem83.base, main_#t~mem83.offset, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88, main_#t~mem89, main_#t~mem90, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1215#L747-3 [2020-07-29 03:24:58,851 INFO L796 eck$LassoCheckResult]: Loop: 1215#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1220#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1222#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1216#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1217#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1223#L748-3 assume !(main_~j~2 < 3); 1221#L748-4 call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; 1218#L747-2 main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; 1215#L747-3 [2020-07-29 03:24:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 03:24:58,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:58,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953661847] [2020-07-29 03:24:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:58,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:58,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:58,933 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2120762437, now seen corresponding path program 2 times [2020-07-29 03:24:58,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:58,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346219246] [2020-07-29 03:24:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:59,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {1251#true} assume !!(main_~i~0 < 2);main_~j~2 := 0; {1253#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:59,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#(<= ULTIMATE.start_main_~j~2 0)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1253#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:59,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {1253#(<= ULTIMATE.start_main_~j~2 0)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1254#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:59,046 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#(<= ULTIMATE.start_main_~j~2 1)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1254#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:59,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#(<= ULTIMATE.start_main_~j~2 1)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1255#(<= ULTIMATE.start_main_~j~2 2)} is VALID [2020-07-29 03:24:59,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {1255#(<= ULTIMATE.start_main_~j~2 2)} assume !(main_~j~2 < 3); {1252#false} is VALID [2020-07-29 03:24:59,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {1252#false} call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; {1252#false} is VALID [2020-07-29 03:24:59,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#false} main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; {1252#false} is VALID [2020-07-29 03:24:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:59,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346219246] [2020-07-29 03:24:59,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182637175] [2020-07-29 03:24:59,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:24:59,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:24:59,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:59,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:24:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:59,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:59,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {1251#true} assume !!(main_~i~0 < 2);main_~j~2 := 0; {1253#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:59,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {1253#(<= ULTIMATE.start_main_~j~2 0)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1253#(<= ULTIMATE.start_main_~j~2 0)} is VALID [2020-07-29 03:24:59,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {1253#(<= ULTIMATE.start_main_~j~2 0)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1254#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:59,241 INFO L280 TraceCheckUtils]: 3: Hoare triple {1254#(<= ULTIMATE.start_main_~j~2 1)} assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; {1254#(<= ULTIMATE.start_main_~j~2 1)} is VALID [2020-07-29 03:24:59,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {1254#(<= ULTIMATE.start_main_~j~2 1)} main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; {1255#(<= ULTIMATE.start_main_~j~2 2)} is VALID [2020-07-29 03:24:59,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {1255#(<= ULTIMATE.start_main_~j~2 2)} assume !(main_~j~2 < 3); {1252#false} is VALID [2020-07-29 03:24:59,243 INFO L280 TraceCheckUtils]: 6: Hoare triple {1252#false} call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; {1252#false} is VALID [2020-07-29 03:24:59,244 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#false} main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; {1252#false} is VALID [2020-07-29 03:24:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:59,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:59,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-29 03:24:59,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318813530] [2020-07-29 03:24:59,245 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:24:59,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:59,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:24:59,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:24:59,246 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-07-29 03:24:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:59,416 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 03:24:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:24:59,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:24:59,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:59,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:24:59,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 03:24:59,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:24:59,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:24:59,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:59,442 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 03:24:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 03:24:59,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:59,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 03:24:59,443 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 03:24:59,444 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 03:24:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:59,444 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 03:24:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:59,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:59,445 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 03:24:59,445 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 03:24:59,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:59,445 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 03:24:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:59,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:59,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:59,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:24:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 03:24:59,447 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 03:24:59,447 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 03:24:59,447 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:24:59,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-07-29 03:24:59,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 03:24:59,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:59,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:59,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:59,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 1, 1, 1, 1] [2020-07-29 03:24:59,448 INFO L794 eck$LassoCheckResult]: Stem: 1294#ULTIMATE.startENTRY havoc ULTIMATE.init_#t~nondet96, ULTIMATE.init_#t~nondet97, ULTIMATE.init_#t~nondet98, ULTIMATE.init_#t~nondet99, ULTIMATE.init_#t~nondet100, ULTIMATE.init_#t~nondet101;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;call ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);call ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := #Ultimate.allocOnStack(3);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];call ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;call ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call ~#ma~0.base, ~#ma~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#ma~0.base, ~#ma~0.offset, 1);call write~init~int(0, ~#ma~0.base, 1 + ~#ma~0.offset, 1);call ~#mb~0.base, ~#mb~0.offset := #Ultimate.allocOnStack(2);call write~init~int(0, ~#mb~0.base, ~#mb~0.offset, 1);call write~init~int(0, ~#mb~0.base, 1 + ~#mb~0.offset, 1);call ~#data1~0.base, ~#data1~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data1~0.base, ~#data1~0.offset, 4);call write~init~int(0, ~#data1~0.base, 4 + ~#data1~0.offset, 4);call ~#data2~0.base, ~#data2~0.offset := #Ultimate.allocOnStack(8);call write~init~int(0, ~#data2~0.base, ~#data2~0.offset, 4);call write~init~int(0, ~#data2~0.base, 4 + ~#data2~0.offset, 4);~__CS_u~0.ma := ~__CS_u~0.ma[0 := 0];~__CS_u~0.ma := ~__CS_u~0.ma[1 := 0];~__CS_u~0.mb := ~__CS_u~0.mb[0 := ULTIMATE.init_#t~nondet96];~__CS_u~0.mb := ~__CS_u~0.mb[1 := ULTIMATE.init_#t~nondet97];~__CS_u~0.data1 := ~__CS_u~0.data1[0 := ULTIMATE.init_#t~nondet98];~__CS_u~0.data1 := ~__CS_u~0.data1[1 := ULTIMATE.init_#t~nondet99];~__CS_u~0.data2 := ~__CS_u~0.data2[0 := ULTIMATE.init_#t~nondet100];~__CS_u~0.data2 := ~__CS_u~0.data2[1 := ULTIMATE.init_#t~nondet101];havoc ULTIMATE.init_#t~nondet100;havoc ULTIMATE.init_#t~nondet99;havoc ULTIMATE.init_#t~nondet101;havoc ULTIMATE.init_#t~nondet97;havoc ULTIMATE.init_#t~nondet98;havoc ULTIMATE.init_#t~nondet96; 1289#L-1 havoc main_#res;havoc main_#t~nondet48, main_#t~nondet49, main_#t~pre47, main_~j~2, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~pre46, main_~i~0, main_#t~mem54, main_#t~mem55, main_#t~mem56, main_#t~mem57.base, main_#t~mem57.offset, main_#t~mem58.base, main_#t~mem58.offset, main_#t~mem59.base, main_#t~mem59.offset, main_#t~mem60, main_#t~mem61, main_#t~mem62, main_#t~mem63, main_#t~mem64, main_#t~mem65, main_#t~ret67.base, main_#t~ret67.offset, main_#t~mem68, main_#t~mem69, main_#t~ret71.base, main_#t~ret71.offset, main_#t~mem72, main_#t~mem73, main_#t~ret75.base, main_#t~ret75.offset, main_#t~mem76, main_#t~mem77, main_#t~mem78, main_#t~mem79, main_#t~mem80, main_#t~mem81, main_#t~mem82.base, main_#t~mem82.offset, main_#t~mem83.base, main_#t~mem83.offset, main_#t~mem84.base, main_#t~mem84.offset, main_#t~mem85.base, main_#t~mem85.offset, main_#t~mem86.base, main_#t~mem86.offset, main_#t~mem87.base, main_#t~mem87.offset, main_#t~mem88, main_#t~mem89, main_#t~mem90, main_#t~mem91, main_#t~mem92, main_#t~mem93, main_#t~mem94, main_#t~mem95, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset, main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset;call main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset := #Ultimate.allocOnStack(6);call main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset := #Ultimate.allocOnStack(24);call main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset := #Ultimate.allocOnStack(2);call main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset := #Ultimate.allocOnStack(8);call main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset := #Ultimate.allocOnStack(8);main_~i~0 := 0; 1290#L747-3 [2020-07-29 03:24:59,448 INFO L796 eck$LassoCheckResult]: Loop: 1290#L747-3 assume !!(main_~i~0 < 2);main_~j~2 := 0; 1296#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1297#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1291#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1292#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1300#L748-3 assume !!(main_~j~2 < 3);call write~int(main_#t~nondet48, main_~#__CS_cp___CS_thread_status~0.base, main_~#__CS_cp___CS_thread_status~0.offset + 3 * main_~i~0 + main_~j~2, 1);havoc main_#t~nondet48;call write~$Pointer$(0, (if main_#t~nondet49 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet49 % 4294967296 % 4294967296 else main_#t~nondet49 % 4294967296 % 4294967296 - 4294967296), main_~#__CS_cp___CS_thread_lockedon~0.base, main_~#__CS_cp___CS_thread_lockedon~0.offset + 12 * main_~i~0 + 4 * main_~j~2, 4);havoc main_#t~nondet49; 1299#L748-2 main_#t~pre47 := 1 + main_~j~2;main_~j~2 := 1 + main_~j~2;havoc main_#t~pre47; 1298#L748-3 assume !(main_~j~2 < 3); 1295#L748-4 call write~int(main_#t~nondet50, main_~#__CS_cp_ma~0.base, main_~#__CS_cp_ma~0.offset + main_~i~0, 1);havoc main_#t~nondet50;call write~int(main_#t~nondet51, main_~#__CS_cp_mb~0.base, main_~#__CS_cp_mb~0.offset + main_~i~0, 1);havoc main_#t~nondet51;call write~int(main_#t~nondet52, main_~#__CS_cp_data1~0.base, main_~#__CS_cp_data1~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet52;call write~int(main_#t~nondet53, main_~#__CS_cp_data2~0.base, main_~#__CS_cp_data2~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet53; 1293#L747-2 main_#t~pre46 := 1 + main_~i~0;main_~i~0 := 1 + main_~i~0;havoc main_#t~pre46; 1290#L747-3 [2020-07-29 03:24:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2020-07-29 03:24:59,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:59,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119952363] [2020-07-29 03:24:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:59,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:59,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2055044605, now seen corresponding path program 3 times [2020-07-29 03:24:59,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:59,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351720124] [2020-07-29 03:24:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:59,565 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopFeasibility(LassoCheck.java:890) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:809) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) 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-29 03:24:59,571 INFO L168 Benchmark]: Toolchain (without parser) took 30504.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 953.5 MB in the beginning and 1.0 GB in the end (delta: -87.2 MB). Peak memory consumption was 222.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:59,572 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:24:59,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1011.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:59,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:59,574 INFO L168 Benchmark]: Boogie Preprocessor took 175.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:59,575 INFO L168 Benchmark]: RCFGBuilder took 16136.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.0 GB in the beginning and 905.8 MB in the end (delta: 141.8 MB). Peak memory consumption was 274.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:59,576 INFO L168 Benchmark]: BuchiAutomizer took 12944.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 905.8 MB in the beginning and 1.0 GB in the end (delta: -135.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:24:59,580 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1011.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 229.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 175.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16136.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.0 GB in the beginning and 905.8 MB in the end (delta: 141.8 MB). Peak memory consumption was 274.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12944.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 905.8 MB in the beginning and 1.0 GB in the end (delta: -135.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...