./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer --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 532163d21d7e473fbfa4a073427e9fd2a45c7337 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-cad4683 [2019-11-16 00:23:20,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:23:20,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:23:20,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:23:20,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:23:20,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:23:20,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:23:20,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:23:20,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:23:20,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:23:20,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:23:20,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:23:20,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:23:20,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:23:20,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:23:20,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:23:20,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:23:20,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:23:20,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:23:20,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:23:20,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:23:20,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:23:20,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:23:20,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:23:20,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:23:20,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:23:20,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:23:20,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:23:20,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:23:20,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:23:20,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:23:20,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:23:20,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:23:20,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:23:20,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:23:20,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:23:20,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:23:20,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:23:20,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:23:20,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:23:20,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:23:20,886 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:23:20,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:23:20,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:23:20,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:23:20,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:23:20,908 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:23:20,909 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:23:20,909 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:23:20,909 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:23:20,909 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:23:20,909 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:23:20,910 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:23:20,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:23:20,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:23:20,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:23:20,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:23:20,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:23:20,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:23:20,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:23:20,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:23:20,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:23:20,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:23:20,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:23:20,913 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:23:20,913 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:23:20,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:23:20,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:23:20,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:23:20,914 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:23:20,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:23:20,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:23:20,915 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:23:20,917 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:23:20,918 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer 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 -> 532163d21d7e473fbfa4a073427e9fd2a45c7337 [2019-11-16 00:23:20,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:23:20,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:23:20,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:23:20,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:23:20,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:23:20,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/../../sv-benchmarks/c/systemc/kundu1.cil.c [2019-11-16 00:23:21,037 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/data/47e464cb4/dd95848efb0749e3938e1a498d905030/FLAGe9c41c27f [2019-11-16 00:23:21,432 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:23:21,433 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/sv-benchmarks/c/systemc/kundu1.cil.c [2019-11-16 00:23:21,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/data/47e464cb4/dd95848efb0749e3938e1a498d905030/FLAGe9c41c27f [2019-11-16 00:23:21,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/data/47e464cb4/dd95848efb0749e3938e1a498d905030 [2019-11-16 00:23:21,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:23:21,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:23:21,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:21,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:23:21,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:23:21,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:21" (1/1) ... [2019-11-16 00:23:21,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f59373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:21, skipping insertion in model container [2019-11-16 00:23:21,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:21" (1/1) ... [2019-11-16 00:23:21,850 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:23:21,881 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:23:22,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:22,111 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:23:22,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:22,181 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:23:22,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22 WrapperNode [2019-11-16 00:23:22,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:22,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:23:22,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:23:22,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:23:22,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:23:22,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:23:22,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:23:22,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:23:22,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... [2019-11-16 00:23:22,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:23:22,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:23:22,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:23:22,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:23:22,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/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 [2019-11-16 00:23:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:23:22,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:23:22,896 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:23:22,896 INFO L284 CfgBuilder]: Removed 72 assume(true) statements. [2019-11-16 00:23:22,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:22 BoogieIcfgContainer [2019-11-16 00:23:22,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:23:22,898 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:23:22,898 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:23:22,901 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:23:22,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:23:22,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:23:21" (1/3) ... [2019-11-16 00:23:22,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a306b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:23:22, skipping insertion in model container [2019-11-16 00:23:22,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:23:22,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:22" (2/3) ... [2019-11-16 00:23:22,904 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a306b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:23:22, skipping insertion in model container [2019-11-16 00:23:22,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:23:22,904 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:22" (3/3) ... [2019-11-16 00:23:22,906 INFO L371 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2019-11-16 00:23:22,952 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:23:22,952 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:23:22,953 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:23:22,953 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:23:22,953 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:23:22,953 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:23:22,953 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:23:22,953 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:23:22,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2019-11-16 00:23:23,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-16 00:23:23,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:23,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:23,033 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,033 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,033 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:23:23,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states. [2019-11-16 00:23:23,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-16 00:23:23,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:23,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:23,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,054 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,062 INFO L791 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 13#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 19#L486true havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5#L219true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 67#L226-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 75#L231-1true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 94#L107true assume 1 == ~P_1_pc~0; 57#L108true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 95#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 58#L119true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 27#L373true assume !(0 != activate_threads_~tmp~1); 15#L373-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 104#L189true assume 1 == ~C_1_pc~0; 62#L190true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 38#L210true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 107#L211true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 31#L381true assume !(0 != activate_threads_~tmp___1~1); 68#L435-1true [2019-11-16 00:23:23,072 INFO L793 eck$LassoCheckResult]: Loop: 68#L435-1true assume !false; 29#L436true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 89#L294true assume false; 11#L310true start_simulation_~kernel_st~0 := 2; 3#L219-1true start_simulation_~kernel_st~0 := 3; 9#L321true havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 77#L107-3true assume 1 == ~P_1_pc~0; 53#L108-1true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 93#L118-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 55#L119-1true activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 16#L373-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 20#L373-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 96#L189-3true assume 1 == ~C_1_pc~0; 60#L190-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 36#L210-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 102#L211-1true activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 32#L381-3true assume !(0 != activate_threads_~tmp___1~1); 23#L381-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 108#L244-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 42#L257-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 113#L258-1true start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 83#L454true assume !(0 == start_simulation_~tmp~3); 85#L454-1true 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; 103#L244-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 41#L257-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 111#L258-2true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 4#L409true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 61#L416true stop_simulation_#res := stop_simulation_~__retres2~0; 25#L417true start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 112#L467true assume !(0 != start_simulation_~tmp___0~2); 68#L435-1true [2019-11-16 00:23:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2019-11-16 00:23:23,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679463102] [2019-11-16 00:23:23,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679463102] [2019-11-16 00:23:23,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:23,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562478302] [2019-11-16 00:23:23,265 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash 101330720, now seen corresponding path program 1 times [2019-11-16 00:23:23,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898437001] [2019-11-16 00:23:23,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898437001] [2019-11-16 00:23:23,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:23:23,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069964839] [2019-11-16 00:23:23,306 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:23,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:23,325 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2019-11-16 00:23:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:23,354 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2019-11-16 00:23:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:23,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2019-11-16 00:23:23,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2019-11-16 00:23:23,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2019-11-16 00:23:23,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2019-11-16 00:23:23,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2019-11-16 00:23:23,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2019-11-16 00:23:23,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:23,374 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-11-16 00:23:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2019-11-16 00:23:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-16 00:23:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:23:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2019-11-16 00:23:23,408 INFO L711 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-11-16 00:23:23,408 INFO L591 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-11-16 00:23:23,408 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:23:23,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2019-11-16 00:23:23,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2019-11-16 00:23:23,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:23,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:23,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,412 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 254#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 255#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 240#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 241#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 328#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 333#L107 assume 1 == ~P_1_pc~0; 314#L108 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 317#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 277#L373 assume !(0 != activate_threads_~tmp~1); 257#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 258#L189 assume 1 == ~C_1_pc~0; 322#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 286#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 290#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 280#L381 assume !(0 != activate_threads_~tmp___1~1); 281#L435-1 [2019-11-16 00:23:23,412 INFO L793 eck$LassoCheckResult]: Loop: 281#L435-1 assume !false; 279#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 275#L294 assume !false; 331#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 332#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 295#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 296#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 249#L274 assume !(0 != eval_~tmp___2~0); 250#L310 start_simulation_~kernel_st~0 := 2; 236#L219-1 start_simulation_~kernel_st~0 := 3; 237#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 251#L107-3 assume 1 == ~P_1_pc~0; 309#L108-1 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 311#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 312#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 259#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 260#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 266#L189-3 assume 1 == ~C_1_pc~0; 320#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 288#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 289#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 282#L381-3 assume !(0 != activate_threads_~tmp___1~1); 268#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 269#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 293#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 294#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 336#L454 assume !(0 == start_simulation_~tmp~3); 313#L454-1 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; 337#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 291#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 292#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 238#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 239#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 272#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 273#L467 assume !(0 != start_simulation_~tmp___0~2); 281#L435-1 [2019-11-16 00:23:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2019-11-16 00:23:23,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086623886] [2019-11-16 00:23:23,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086623886] [2019-11-16 00:23:23,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:23,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953974397] [2019-11-16 00:23:23,453 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:23,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 513684202, now seen corresponding path program 1 times [2019-11-16 00:23:23,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660950408] [2019-11-16 00:23:23,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660950408] [2019-11-16 00:23:23,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:23:23,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714539041] [2019-11-16 00:23:23,564 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:23,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:23,565 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 Second operand 3 states. [2019-11-16 00:23:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:23,620 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2019-11-16 00:23:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:23,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 272 transitions. [2019-11-16 00:23:23,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 168 [2019-11-16 00:23:23,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 272 transitions. [2019-11-16 00:23:23,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2019-11-16 00:23:23,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2019-11-16 00:23:23,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 272 transitions. [2019-11-16 00:23:23,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:23,630 INFO L688 BuchiCegarLoop]: Abstraction has 188 states and 272 transitions. [2019-11-16 00:23:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 272 transitions. [2019-11-16 00:23:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2019-11-16 00:23:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:23:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2019-11-16 00:23:23,657 INFO L711 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2019-11-16 00:23:23,657 INFO L591 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2019-11-16 00:23:23,657 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:23:23,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 267 transitions. [2019-11-16 00:23:23,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 164 [2019-11-16 00:23:23,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:23,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:23,661 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,661 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,661 INFO L791 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 561#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 562#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 546#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 547#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 639#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 645#L107 assume !(1 == ~P_1_pc~0); 648#L107-2 is_P_1_triggered_~__retres1~0 := 0; 649#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 624#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 585#L373 assume !(0 != activate_threads_~tmp~1); 564#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 565#L189 assume 1 == ~C_1_pc~0; 629#L190 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 593#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 597#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 587#L381 assume !(0 != activate_threads_~tmp___1~1); 588#L435-1 [2019-11-16 00:23:23,661 INFO L793 eck$LassoCheckResult]: Loop: 588#L435-1 assume !false; 689#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 687#L294 assume !false; 642#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 643#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 602#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 603#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 555#L274 assume !(0 != eval_~tmp___2~0); 557#L310 start_simulation_~kernel_st~0 := 2; 544#L219-1 start_simulation_~kernel_st~0 := 3; 545#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 558#L107-3 assume !(1 == ~P_1_pc~0); 646#L107-5 is_P_1_triggered_~__retres1~0 := 0; 647#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 623#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 566#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 567#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 573#L189-3 assume 1 == ~C_1_pc~0; 627#L190-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 595#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 596#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 663#L381-3 assume !(0 != activate_threads_~tmp___1~1); 718#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 664#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 600#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 601#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 654#L454 assume !(0 == start_simulation_~tmp~3); 655#L454-1 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; 707#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 598#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 599#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 542#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 543#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 579#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 580#L467 assume !(0 != start_simulation_~tmp___0~2); 588#L435-1 [2019-11-16 00:23:23,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2019-11-16 00:23:23,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155933002] [2019-11-16 00:23:23,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155933002] [2019-11-16 00:23:23,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:23,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777200074] [2019-11-16 00:23:23,729 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2019-11-16 00:23:23,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080362666] [2019-11-16 00:23:23,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080362666] [2019-11-16 00:23:23,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:23:23,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406589598] [2019-11-16 00:23:23,817 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:23,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:23,817 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-11-16 00:23:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:23,898 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2019-11-16 00:23:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:23,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 473 transitions. [2019-11-16 00:23:23,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2019-11-16 00:23:23,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 473 transitions. [2019-11-16 00:23:23,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2019-11-16 00:23:23,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2019-11-16 00:23:23,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 473 transitions. [2019-11-16 00:23:23,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:23,913 INFO L688 BuchiCegarLoop]: Abstraction has 338 states and 473 transitions. [2019-11-16 00:23:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 473 transitions. [2019-11-16 00:23:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 322. [2019-11-16 00:23:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-16 00:23:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 453 transitions. [2019-11-16 00:23:23,931 INFO L711 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2019-11-16 00:23:23,931 INFO L591 BuchiCegarLoop]: Abstraction has 322 states and 453 transitions. [2019-11-16 00:23:23,931 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:23:23,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states and 453 transitions. [2019-11-16 00:23:23,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-11-16 00:23:23,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:23,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:23,935 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,935 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,936 INFO L791 eck$LassoCheckResult]: Stem: 1184#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1094#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1095#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1080#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1081#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1170#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1176#L107 assume !(1 == ~P_1_pc~0); 1179#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1180#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1158#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1120#L373 assume !(0 != activate_threads_~tmp~1); 1098#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1099#L189 assume !(1 == ~C_1_pc~0); 1192#L189-2 assume !(2 == ~C_1_pc~0); 1129#L199-1 is_C_1_triggered_~__retres1~1 := 0; 1130#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1134#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1124#L381 assume !(0 != activate_threads_~tmp___1~1); 1125#L435-1 [2019-11-16 00:23:23,936 INFO L793 eck$LassoCheckResult]: Loop: 1125#L435-1 assume !false; 1121#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1122#L294 assume !false; 1173#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1174#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1139#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1140#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1089#L274 assume !(0 != eval_~tmp___2~0); 1090#L310 start_simulation_~kernel_st~0 := 2; 1078#L219-1 start_simulation_~kernel_st~0 := 3; 1079#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1091#L107-3 assume !(1 == ~P_1_pc~0); 1177#L107-5 is_P_1_triggered_~__retres1~0 := 0; 1178#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1157#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1100#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1101#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1107#L189-3 assume !(1 == ~C_1_pc~0); 1191#L189-5 assume !(2 == ~C_1_pc~0); 1199#L199-3 is_C_1_triggered_~__retres1~1 := 0; 1373#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1372#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1371#L381-3 assume !(0 != activate_threads_~tmp___1~1); 1370#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1196#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1137#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1138#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1185#L454 assume !(0 == start_simulation_~tmp~3); 1156#L454-1 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; 1186#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1135#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1136#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1076#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1077#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 1114#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1115#L467 assume !(0 != start_simulation_~tmp___0~2); 1125#L435-1 [2019-11-16 00:23:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2019-11-16 00:23:23,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967368697] [2019-11-16 00:23:23,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:23,982 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1124188166, now seen corresponding path program 1 times [2019-11-16 00:23:23,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382564538] [2019-11-16 00:23:23,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382564538] [2019-11-16 00:23:24,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:24,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148155216] [2019-11-16 00:23:24,026 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:24,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:24,027 INFO L87 Difference]: Start difference. First operand 322 states and 453 transitions. cyclomatic complexity: 132 Second operand 5 states. [2019-11-16 00:23:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,146 INFO L93 Difference]: Finished difference Result 564 states and 783 transitions. [2019-11-16 00:23:24,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:24,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 564 states and 783 transitions. [2019-11-16 00:23:24,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 546 [2019-11-16 00:23:24,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 564 states to 564 states and 783 transitions. [2019-11-16 00:23:24,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2019-11-16 00:23:24,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2019-11-16 00:23:24,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 783 transitions. [2019-11-16 00:23:24,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:24,167 INFO L688 BuchiCegarLoop]: Abstraction has 564 states and 783 transitions. [2019-11-16 00:23:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 783 transitions. [2019-11-16 00:23:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 334. [2019-11-16 00:23:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-16 00:23:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2019-11-16 00:23:24,194 INFO L711 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2019-11-16 00:23:24,194 INFO L591 BuchiCegarLoop]: Abstraction has 334 states and 465 transitions. [2019-11-16 00:23:24,194 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:23:24,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 465 transitions. [2019-11-16 00:23:24,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 316 [2019-11-16 00:23:24,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:24,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:24,206 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,206 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,208 INFO L791 eck$LassoCheckResult]: Stem: 2091#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1997#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1998#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1982#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1983#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2076#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2083#L107 assume !(1 == ~P_1_pc~0); 2086#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2087#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2065#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2022#L373 assume !(0 != activate_threads_~tmp~1); 2001#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2002#L189 assume !(1 == ~C_1_pc~0); 2099#L189-2 assume !(2 == ~C_1_pc~0); 2033#L199-1 is_C_1_triggered_~__retres1~1 := 0; 2034#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2038#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2027#L381 assume !(0 != activate_threads_~tmp___1~1); 2028#L435-1 [2019-11-16 00:23:24,208 INFO L793 eck$LassoCheckResult]: Loop: 2028#L435-1 assume !false; 2025#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2026#L294 assume !false; 2162#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2159#L244 assume !(0 == ~P_1_st~0); 2146#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2148#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2138#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2139#L274 assume !(0 != eval_~tmp___2~0); 1994#L310 start_simulation_~kernel_st~0 := 2; 1978#L219-1 start_simulation_~kernel_st~0 := 3; 1979#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2084#L107-3 assume !(1 == ~P_1_pc~0); 2085#L107-5 is_P_1_triggered_~__retres1~0 := 0; 2136#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2137#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2124#L373-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2125#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2097#L189-3 assume !(1 == ~C_1_pc~0); 2098#L189-5 assume !(2 == ~C_1_pc~0); 2047#L199-3 is_C_1_triggered_~__retres1~1 := 0; 2036#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2037#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2276#L381-3 assume !(0 != activate_threads_~tmp___1~1); 2013#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2014#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2041#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2042#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2092#L454 assume !(0 == start_simulation_~tmp~3); 2064#L454-1 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; 2093#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2039#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2040#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 1980#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1981#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 2017#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2018#L467 assume !(0 != start_simulation_~tmp___0~2); 2028#L435-1 [2019-11-16 00:23:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2019-11-16 00:23:24,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884059398] [2019-11-16 00:23:24,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,244 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,251 INFO L82 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2019-11-16 00:23:24,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080040399] [2019-11-16 00:23:24,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080040399] [2019-11-16 00:23:24,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:24,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214403510] [2019-11-16 00:23:24,312 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:24,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:24,313 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. cyclomatic complexity: 132 Second operand 5 states. [2019-11-16 00:23:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,414 INFO L93 Difference]: Finished difference Result 746 states and 1040 transitions. [2019-11-16 00:23:24,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:24,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 746 states and 1040 transitions. [2019-11-16 00:23:24,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 728 [2019-11-16 00:23:24,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 746 states to 746 states and 1040 transitions. [2019-11-16 00:23:24,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 746 [2019-11-16 00:23:24,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 746 [2019-11-16 00:23:24,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 746 states and 1040 transitions. [2019-11-16 00:23:24,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:24,432 INFO L688 BuchiCegarLoop]: Abstraction has 746 states and 1040 transitions. [2019-11-16 00:23:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states and 1040 transitions. [2019-11-16 00:23:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 346. [2019-11-16 00:23:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-16 00:23:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 472 transitions. [2019-11-16 00:23:24,443 INFO L711 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2019-11-16 00:23:24,443 INFO L591 BuchiCegarLoop]: Abstraction has 346 states and 472 transitions. [2019-11-16 00:23:24,443 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:23:24,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 346 states and 472 transitions. [2019-11-16 00:23:24,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 328 [2019-11-16 00:23:24,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:24,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:24,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,450 INFO L791 eck$LassoCheckResult]: Stem: 3184#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3090#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3091#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3075#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3076#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3166#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3175#L107 assume !(1 == ~P_1_pc~0); 3179#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3180#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3154#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3114#L373 assume !(0 != activate_threads_~tmp~1); 3093#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3094#L189 assume !(1 == ~C_1_pc~0); 3192#L189-2 assume !(2 == ~C_1_pc~0); 3123#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3124#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3128#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3118#L381 assume !(0 != activate_threads_~tmp___1~1); 3119#L435-1 [2019-11-16 00:23:24,451 INFO L793 eck$LassoCheckResult]: Loop: 3119#L435-1 assume !false; 3280#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3276#L294 assume !false; 3274#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3272#L244 assume !(0 == ~P_1_st~0); 3268#L248 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3266#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3262#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3253#L274 assume !(0 != eval_~tmp___2~0); 3251#L310 start_simulation_~kernel_st~0 := 2; 3249#L219-1 start_simulation_~kernel_st~0 := 3; 3241#L321 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3177#L107-3 assume !(1 == ~P_1_pc~0); 3178#L107-5 is_P_1_triggered_~__retres1~0 := 0; 3248#L118-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3247#L119-1 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3246#L373-3 assume !(0 != activate_threads_~tmp~1); 3245#L373-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3244#L189-3 assume !(1 == ~C_1_pc~0); 3242#L189-5 assume !(2 == ~C_1_pc~0); 3243#L199-3 is_C_1_triggered_~__retres1~1 := 0; 3228#L210-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3229#L211-1 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3224#L381-3 assume !(0 != activate_threads_~tmp___1~1); 3225#L381-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3219#L244-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3220#L257-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3215#L258-1 start_simulation_#t~ret7 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 3216#L454 assume !(0 == start_simulation_~tmp~3); 3292#L454-1 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; 3290#L244-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3289#L257-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3288#L258-2 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 3287#L409 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3286#L416 stop_simulation_#res := stop_simulation_~__retres2~0; 3285#L417 start_simulation_#t~ret8 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 3284#L467 assume !(0 != start_simulation_~tmp___0~2); 3119#L435-1 [2019-11-16 00:23:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2019-11-16 00:23:24,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264681445] [2019-11-16 00:23:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,496 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 13170388, now seen corresponding path program 1 times [2019-11-16 00:23:24,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108625339] [2019-11-16 00:23:24,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108625339] [2019-11-16 00:23:24,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:24,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519651431] [2019-11-16 00:23:24,544 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:23:24,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:24,545 INFO L87 Difference]: Start difference. First operand 346 states and 472 transitions. cyclomatic complexity: 127 Second operand 3 states. [2019-11-16 00:23:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,582 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2019-11-16 00:23:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:24,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 506 states and 678 transitions. [2019-11-16 00:23:24,587 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2019-11-16 00:23:24,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 506 states to 506 states and 678 transitions. [2019-11-16 00:23:24,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 506 [2019-11-16 00:23:24,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2019-11-16 00:23:24,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 506 states and 678 transitions. [2019-11-16 00:23:24,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:24,594 INFO L688 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2019-11-16 00:23:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states and 678 transitions. [2019-11-16 00:23:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-11-16 00:23:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-16 00:23:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 678 transitions. [2019-11-16 00:23:24,607 INFO L711 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2019-11-16 00:23:24,607 INFO L591 BuchiCegarLoop]: Abstraction has 506 states and 678 transitions. [2019-11-16 00:23:24,607 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:23:24,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 678 transitions. [2019-11-16 00:23:24,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 480 [2019-11-16 00:23:24,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:24,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:24,612 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,612 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,613 INFO L791 eck$LassoCheckResult]: Stem: 4043#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3948#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3949#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3933#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3934#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4027#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4036#L107 assume !(1 == ~P_1_pc~0); 4039#L107-2 is_P_1_triggered_~__retres1~0 := 0; 4040#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4015#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 3974#L373 assume !(0 != activate_threads_~tmp~1); 3952#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3953#L189 assume !(1 == ~C_1_pc~0); 4053#L189-2 assume !(2 == ~C_1_pc~0); 3982#L199-1 is_C_1_triggered_~__retres1~1 := 0; 3983#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3987#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3977#L381 assume !(0 != activate_threads_~tmp___1~1); 3978#L435-1 assume !false; 4265#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4263#L294 [2019-11-16 00:23:24,613 INFO L793 eck$LassoCheckResult]: Loop: 4263#L294 assume !false; 4258#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4255#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4253#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4251#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4249#L274 assume 0 != eval_~tmp___2~0; 4246#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 4244#L283 assume !(0 != eval_~tmp~0); 4245#L279 assume !(0 == ~C_1_st~0); 4263#L294 [2019-11-16 00:23:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2019-11-16 00:23:24,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416309913] [2019-11-16 00:23:24,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,643 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2019-11-16 00:23:24,648 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702206518] [2019-11-16 00:23:24,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,662 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2019-11-16 00:23:24,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086727800] [2019-11-16 00:23:24,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086727800] [2019-11-16 00:23:24,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:23:24,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835219027] [2019-11-16 00:23:24,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:24,772 INFO L87 Difference]: Start difference. First operand 506 states and 678 transitions. cyclomatic complexity: 175 Second operand 3 states. [2019-11-16 00:23:24,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,817 INFO L93 Difference]: Finished difference Result 815 states and 1070 transitions. [2019-11-16 00:23:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:24,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 815 states and 1070 transitions. [2019-11-16 00:23:24,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2019-11-16 00:23:24,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 815 states to 815 states and 1070 transitions. [2019-11-16 00:23:24,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 815 [2019-11-16 00:23:24,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 815 [2019-11-16 00:23:24,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 815 states and 1070 transitions. [2019-11-16 00:23:24,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:24,835 INFO L688 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2019-11-16 00:23:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 1070 transitions. [2019-11-16 00:23:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2019-11-16 00:23:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-16 00:23:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1070 transitions. [2019-11-16 00:23:24,852 INFO L711 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2019-11-16 00:23:24,852 INFO L591 BuchiCegarLoop]: Abstraction has 815 states and 1070 transitions. [2019-11-16 00:23:24,852 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:23:24,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 815 states and 1070 transitions. [2019-11-16 00:23:24,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2019-11-16 00:23:24,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:24,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:24,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,860 INFO L791 eck$LassoCheckResult]: Stem: 5377#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5276#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5277#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5262#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5263#L226-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5361#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5927#L107 assume !(1 == ~P_1_pc~0); 5926#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5925#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5924#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5923#L373 assume !(0 != activate_threads_~tmp~1); 5922#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5921#L189 assume !(1 == ~C_1_pc~0); 5920#L189-2 assume !(2 == ~C_1_pc~0); 5314#L199-1 is_C_1_triggered_~__retres1~1 := 0; 5315#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5319#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5306#L381 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5307#L435-1 assume !false; 5887#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5807#L294 [2019-11-16 00:23:24,860 INFO L793 eck$LassoCheckResult]: Loop: 5807#L294 assume !false; 5885#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5917#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5873#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5872#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5871#L274 assume 0 != eval_~tmp___2~0; 5870#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 5869#L283 assume !(0 != eval_~tmp~0); 5809#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 5806#L298 assume !(0 != eval_~tmp___1~0); 5807#L294 [2019-11-16 00:23:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2019-11-16 00:23:24,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848163683] [2019-11-16 00:23:24,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848163683] [2019-11-16 00:23:24,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:24,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:24,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046516305] [2019-11-16 00:23:24,877 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:23:24,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2019-11-16 00:23:24,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510508267] [2019-11-16 00:23:24,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:24,891 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:24,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:23:24,962 INFO L87 Difference]: Start difference. First operand 815 states and 1070 transitions. cyclomatic complexity: 258 Second operand 3 states. [2019-11-16 00:23:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,971 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2019-11-16 00:23:24,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:24,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 800 states and 1053 transitions. [2019-11-16 00:23:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2019-11-16 00:23:24,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 800 states to 800 states and 1053 transitions. [2019-11-16 00:23:24,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800 [2019-11-16 00:23:24,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 800 [2019-11-16 00:23:24,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 800 states and 1053 transitions. [2019-11-16 00:23:24,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:23:24,990 INFO L688 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2019-11-16 00:23:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states and 1053 transitions. [2019-11-16 00:23:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-11-16 00:23:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-11-16 00:23:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1053 transitions. [2019-11-16 00:23:25,007 INFO L711 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2019-11-16 00:23:25,007 INFO L591 BuchiCegarLoop]: Abstraction has 800 states and 1053 transitions. [2019-11-16 00:23:25,007 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:23:25,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1053 transitions. [2019-11-16 00:23:25,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 768 [2019-11-16 00:23:25,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:23:25,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:23:25,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:25,013 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:25,014 INFO L791 eck$LassoCheckResult]: Stem: 6992#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6897#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 6898#L486 havoc start_simulation_#t~ret7, start_simulation_#t~ret8, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 6883#L219 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6884#L226-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6976#L231-1 havoc activate_threads_#t~ret4, activate_threads_#t~ret5, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6985#L107 assume !(1 == ~P_1_pc~0); 6987#L107-2 is_P_1_triggered_~__retres1~0 := 0; 6988#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6964#L119 activate_threads_#t~ret4 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6923#L373 assume !(0 != activate_threads_~tmp~1); 6901#L373-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6902#L189 assume !(1 == ~C_1_pc~0); 7001#L189-2 assume !(2 == ~C_1_pc~0); 6934#L199-1 is_C_1_triggered_~__retres1~1 := 0; 6935#L210 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6939#L211 activate_threads_#t~ret5 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6927#L381 assume !(0 != activate_threads_~tmp___1~1); 6928#L435-1 assume !false; 7213#L436 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 7145#L294 [2019-11-16 00:23:25,014 INFO L793 eck$LassoCheckResult]: Loop: 7145#L294 assume !false; 7210#L270 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7207#L244 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7205#L257 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7203#L258 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 7201#L274 assume 0 != eval_~tmp___2~0; 7198#L274-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 7195#L283 assume !(0 != eval_~tmp~0); 7124#L279 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 7114#L298 assume !(0 != eval_~tmp___1~0); 7145#L294 [2019-11-16 00:23:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2019-11-16 00:23:25,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241499886] [2019-11-16 00:23:25,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2019-11-16 00:23:25,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547993939] [2019-11-16 00:23:25,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2019-11-16 00:23:25,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276087239] [2019-11-16 00:23:25,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:23:25,072 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:23:25,395 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-11-16 00:23:25,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:23:25 BoogieIcfgContainer [2019-11-16 00:23:25,520 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:23:25,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:23:25,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:23:25,520 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:23:25,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:22" (3/4) ... [2019-11-16 00:23:25,523 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:23:25,573 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b84567c8-4e44-40b2-b1b2-115b7bb2337b/bin/uautomizer/witness.graphml [2019-11-16 00:23:25,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:23:25,574 INFO L168 Benchmark]: Toolchain (without parser) took 3738.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,574 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:25,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,575 INFO L168 Benchmark]: Boogie Preprocessor took 58.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:23:25,576 INFO L168 Benchmark]: RCFGBuilder took 600.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,576 INFO L168 Benchmark]: BuchiAutomizer took 2621.74 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: 25.0 MB). Peak memory consumption was 222.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,576 INFO L168 Benchmark]: Witness Printer took 52.93 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:23:25,578 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 600.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2621.74 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: 25.0 MB). Peak memory consumption was 222.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.93 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: 1.7 MB). Peak memory consumption was 1.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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 800 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 650 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 815 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1196 SDtfs, 1400 SDslu, 1460 SDs, 0 SdLazy, 146 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 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: 269]: 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 {count=0, \result=0, \result=0, P_1_pc=0, __retres1=0, C_1_i=1, tmp=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7959d21e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43487962=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19f24598=0, data_0=0, kernel_st=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___0=0, data_1=0, __retres1=1, max_loop=2, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@324644ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51981595=0, C_1_pr=0, \result=0, i=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@75d4cb6d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1114e2c4=0, P_1_i=1, e=0, C_1_ev=0, tmp___1=0, __retres1=0, tmp___0=0, num=0, timer=0, P_1_ev=0, tmp=0, C_1_pc=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 269]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int C_1_pc ; [L123] int C_1_st ; [L124] int C_1_i ; [L125] int C_1_ev ; [L126] int C_1_pr ; [L490] int count ; [L491] int __retres2 ; [L495] num = 0 [L496] i = 0 [L497] max_loop = 2 [L499] timer = 0 [L500] P_1_pc = 0 [L501] C_1_pc = 0 [L503] count = 0 [L483] P_1_i = 1 [L484] C_1_i = 1 [L421] int kernel_st ; [L422] int tmp ; [L423] int tmp___0 ; [L427] kernel_st = 0 [L226] COND TRUE (int )P_1_i == 1 [L227] P_1_st = 0 [L231] COND TRUE (int )C_1_i == 1 [L232] C_1_st = 0 [L365] int tmp ; [L366] int tmp___0 ; [L367] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L371] tmp = is_P_1_triggered() [L373] COND FALSE !(\read(tmp)) [L186] int __retres1 ; [L189] COND FALSE !((int )C_1_pc == 1) [L199] COND FALSE !((int )C_1_pc == 2) [L209] __retres1 = 0 [L211] return (__retres1); [L379] tmp___1 = is_C_1_triggered() [L381] COND FALSE !(\read(tmp___1)) [L435] COND TRUE 1 [L438] kernel_st = 1 [L262] int tmp ; [L263] int tmp___0 ; [L264] int tmp___1 ; [L265] int tmp___2 ; Loop: [L269] COND TRUE 1 [L241] int __retres1 ; [L244] COND TRUE (int )P_1_st == 0 [L245] __retres1 = 1 [L258] return (__retres1); [L272] tmp___2 = exists_runnable_thread() [L274] COND TRUE \read(tmp___2) [L279] COND TRUE (int )P_1_st == 0 [L281] tmp = __VERIFIER_nondet_int() [L283] COND FALSE !(\read(tmp)) [L294] COND TRUE (int )C_1_st == 0 [L296] tmp___1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...