./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -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 aa63abe8d244d72d8b78f82e911235dbe511cfc8 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:04:52,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:04:52,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:04:52,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:04:52,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:04:52,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:04:52,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:04:52,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:04:52,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:04:52,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:04:52,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:04:52,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:04:52,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:04:52,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:04:52,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:04:52,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:04:52,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:04:52,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:04:53,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:04:53,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:04:53,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:04:53,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:04:53,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:04:53,009 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:04:53,009 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:04:53,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:04:53,011 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:04:53,012 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:04:53,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:04:53,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:04:53,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:04:53,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:04:53,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:04:53,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:04:53,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:04:53,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:04:53,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:04:53,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:04:53,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:04:53,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:04:53,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:04:53,041 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:04:53,041 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:04:53,041 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:04:53,041 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:04:53,043 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:04:53,043 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:04:53,044 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:04:53,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:04:53,044 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:04:53,044 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:04:53,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:04:53,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:04:53,046 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:04:53,047 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:04:53,047 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:04:53,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:04:53,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:04:53,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:04:53,047 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:04:53,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:04:53,051 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:04:53,051 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:04:53,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:04:53,054 INFO L133 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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-11-29 00:04:53,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:04:53,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:04:53,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:04:53,131 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:04:53,132 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:04:53,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:53,195 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8e8b3d/77ed7acd842445a6b62d60a51863a521/FLAG031e6391a [2018-11-29 00:04:53,659 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:04:53,659 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:53,673 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8e8b3d/77ed7acd842445a6b62d60a51863a521/FLAG031e6391a [2018-11-29 00:04:53,966 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6d8e8b3d/77ed7acd842445a6b62d60a51863a521 [2018-11-29 00:04:53,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:04:53,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:04:53,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:53,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:04:53,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:04:53,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:53" (1/1) ... [2018-11-29 00:04:53,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1465e9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:53, skipping insertion in model container [2018-11-29 00:04:53,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:53" (1/1) ... [2018-11-29 00:04:53,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:04:54,033 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:04:54,255 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:54,267 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:04:54,307 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:54,330 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:04:54,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54 WrapperNode [2018-11-29 00:04:54,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:54,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:54,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:04:54,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:04:54,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:54,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:04:54,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:04:54,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:04:54,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (1/1) ... [2018-11-29 00:04:54,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:04:54,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:04:54,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:04:54,413 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:04:54,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (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 [2018-11-29 00:04:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:04:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:04:55,268 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:04:55,269 INFO L280 CfgBuilder]: Removed 42 assue(true) statements. [2018-11-29 00:04:55,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55 BoogieIcfgContainer [2018-11-29 00:04:55,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:04:55,270 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:04:55,270 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:04:55,275 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:04:55,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:04:53" (1/3) ... [2018-11-29 00:04:55,277 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3740e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:55, skipping insertion in model container [2018-11-29 00:04:55,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:54" (2/3) ... [2018-11-29 00:04:55,278 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3740e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:55, skipping insertion in model container [2018-11-29 00:04:55,278 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:55,279 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55" (3/3) ... [2018-11-29 00:04:55,281 INFO L375 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-11-29 00:04:55,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:04:55,346 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:04:55,346 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:04:55,346 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:04:55,346 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:04:55,347 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:04:55,347 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:04:55,347 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:04:55,347 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:04:55,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-29 00:04:55,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-29 00:04:55,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,408 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:04:55,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2018-11-29 00:04:55,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-29 00:04:55,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,416 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,416 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,424 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 74#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 76#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 73#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 60#L313-1true [2018-11-29 00:04:55,424 INFO L796 eck$LassoCheckResult]: Loop: 60#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 63#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 68#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 65#L320true assume !(0 != start_simulation_~tmp~3); 60#L313-1true [2018-11-29 00:04:55,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2018-11-29 00:04:55,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:55,610 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:55,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2018-11-29 00:04:55,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:55,625 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:55,648 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2018-11-29 00:04:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:55,686 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-11-29 00:04:55,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:55,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2018-11-29 00:04:55,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2018-11-29 00:04:55,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:04:55,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:04:55,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2018-11-29 00:04:55,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:55,710 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2018-11-29 00:04:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2018-11-29 00:04:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-29 00:04:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:04:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2018-11-29 00:04:55,750 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2018-11-29 00:04:55,750 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2018-11-29 00:04:55,750 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:04:55,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2018-11-29 00:04:55,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:55,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:55,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:55,756 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:55,757 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:55,757 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 167#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 168#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 224#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 223#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 220#L313-1 [2018-11-29 00:04:55,757 INFO L796 eck$LassoCheckResult]: Loop: 220#L313-1 assume !false; 189#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 172#L262 assume !false; 211#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 212#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 197#L242 assume !(0 != eval_~tmp___1~0); 198#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 204#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 181#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 182#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 190#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 177#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 178#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 208#L320 assume !(0 != start_simulation_~tmp~3); 220#L313-1 [2018-11-29 00:04:55,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2018-11-29 00:04:55,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:55,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:55,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2018-11-29 00:04:55,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:55,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:55,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:55,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:55,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:55,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:55,986 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand 3 states. [2018-11-29 00:04:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,029 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2018-11-29 00:04:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2018-11-29 00:04:56,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:56,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2018-11-29 00:04:56,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-29 00:04:56,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-11-29 00:04:56,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2018-11-29 00:04:56,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,046 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2018-11-29 00:04:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-29 00:04:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-29 00:04:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2018-11-29 00:04:56,057 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:56,057 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2018-11-29 00:04:56,058 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:04:56,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2018-11-29 00:04:56,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-29 00:04:56,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:56,063 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,064 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 312#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 313#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 369#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 368#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 365#L313-1 [2018-11-29 00:04:56,064 INFO L796 eck$LassoCheckResult]: Loop: 365#L313-1 assume !false; 334#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 317#L262 assume !false; 356#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 357#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 342#L242 assume !(0 != eval_~tmp___1~0); 343#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 349#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 326#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 327#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 335#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 322#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 323#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 350#L320 assume !(0 != start_simulation_~tmp~3); 365#L313-1 [2018-11-29 00:04:56,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2018-11-29 00:04:56,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2018-11-29 00:04:56,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:56,187 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:56,188 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2018-11-29 00:04:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,458 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2018-11-29 00:04:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:04:56,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2018-11-29 00:04:56,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2018-11-29 00:04:56,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2018-11-29 00:04:56,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-11-29 00:04:56,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2018-11-29 00:04:56,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2018-11-29 00:04:56,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,471 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2018-11-29 00:04:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2018-11-29 00:04:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2018-11-29 00:04:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-29 00:04:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2018-11-29 00:04:56,483 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2018-11-29 00:04:56,483 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2018-11-29 00:04:56,483 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:04:56,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2018-11-29 00:04:56,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2018-11-29 00:04:56,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,485 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:04:56,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,486 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 530#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 531#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 589#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 588#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 585#L313-1 [2018-11-29 00:04:56,486 INFO L796 eck$LassoCheckResult]: Loop: 585#L313-1 assume !false; 552#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 533#L262 assume !false; 575#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 576#L214 assume !(0 == ~p_dw_st~0); 583#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 546#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 590#L242 assume !(0 != eval_~tmp___1~0); 566#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 567#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 544#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 545#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 553#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 540#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 541#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 570#L320 assume !(0 != start_simulation_~tmp~3); 585#L313-1 [2018-11-29 00:04:56,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2018-11-29 00:04:56,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2018-11-29 00:04:56,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:56,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:56,542 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:56,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:56,543 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-29 00:04:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,688 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2018-11-29 00:04:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2018-11-29 00:04:56,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2018-11-29 00:04:56,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2018-11-29 00:04:56,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-11-29 00:04:56,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-11-29 00:04:56,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2018-11-29 00:04:56,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,695 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2018-11-29 00:04:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2018-11-29 00:04:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2018-11-29 00:04:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-29 00:04:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2018-11-29 00:04:56,705 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2018-11-29 00:04:56,705 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2018-11-29 00:04:56,705 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:04:56,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2018-11-29 00:04:56,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2018-11-29 00:04:56,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:56,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:56,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:56,710 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 728#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 729#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 793#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 791#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 792#L313-1 assume !false; 805#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 802#L262 [2018-11-29 00:04:56,710 INFO L796 eck$LassoCheckResult]: Loop: 802#L262 assume !false; 801#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 799#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 798#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 797#L242 assume 0 != eval_~tmp___1~0; 796#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 786#L251 assume !(0 != eval_~tmp~1); 787#L247 assume !(0 == ~c_dr_st~0); 802#L262 [2018-11-29 00:04:56,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2018-11-29 00:04:56,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2018-11-29 00:04:56,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:56,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2018-11-29 00:04:56,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:56,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:56,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:56,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:56,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:56,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:56,888 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand 3 states. [2018-11-29 00:04:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:56,988 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2018-11-29 00:04:56,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:56,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2018-11-29 00:04:56,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2018-11-29 00:04:56,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2018-11-29 00:04:56,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-29 00:04:56,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-29 00:04:56,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2018-11-29 00:04:56,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:56,997 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2018-11-29 00:04:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2018-11-29 00:04:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2018-11-29 00:04:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-29 00:04:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2018-11-29 00:04:57,007 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2018-11-29 00:04:57,007 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2018-11-29 00:04:57,007 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:04:57,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2018-11-29 00:04:57,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2018-11-29 00:04:57,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:57,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:57,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:57,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:57,009 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1024#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1025#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1096#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1095#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1087#L313-1 assume !false; 1047#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1027#L262 [2018-11-29 00:04:57,010 INFO L796 eck$LassoCheckResult]: Loop: 1027#L262 assume !false; 1141#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1139#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1138#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1137#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1136#L242 assume 0 != eval_~tmp___1~0; 1135#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1088#L251 assume !(0 != eval_~tmp~1); 1089#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 1026#L266 assume !(0 != eval_~tmp___0~1); 1027#L262 [2018-11-29 00:04:57,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2018-11-29 00:04:57,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2018-11-29 00:04:57,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:57,067 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2018-11-29 00:04:57,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:57,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:57,288 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-29 00:04:57,549 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-29 00:04:57,983 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-29 00:04:58,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:04:58 BoogieIcfgContainer [2018-11-29 00:04:58,112 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:04:58,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:04:58,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:04:58,113 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:04:58,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:55" (3/4) ... [2018-11-29 00:04:58,117 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:04:58,188 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:04:58,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:04:58,190 INFO L168 Benchmark]: Toolchain (without parser) took 4219.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.3 MB in the beginning and 988.9 MB in the end (delta: -41.5 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,191 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:04:58,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.89 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,193 INFO L168 Benchmark]: Boogie Preprocessor took 31.35 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:04:58,193 INFO L168 Benchmark]: RCFGBuilder took 856.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,194 INFO L168 Benchmark]: BuchiAutomizer took 2842.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.6 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,195 INFO L168 Benchmark]: Witness Printer took 76.02 ms. Allocated memory is still 1.2 GB. Free memory was 995.6 MB in the beginning and 988.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:04:58,199 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.89 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.35 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 856.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2842.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.6 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * Witness Printer took 76.02 ms. Allocated memory is still 1.2 GB. Free memory was 995.6 MB in the beginning and 988.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 146 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 537 SDtfs, 571 SDslu, 420 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 237]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@355221bc=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, p_dw_pc=0, tmp=0, q_free=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d9cc32c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27616839=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ce83626=0, p_dw_st=0, c_last_read=0, p_num_write=0, q_buf_0=0, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; Loop: [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND FALSE !(\read(tmp)) [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...