./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu2.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/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 bcaab56def91d08648015d5637379998052b8de3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-28 03:16:07,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:16:07,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:16:07,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:16:07,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:16:07,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:16:07,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:16:07,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:16:07,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:16:07,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:16:07,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:16:07,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:16:07,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:16:07,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:16:07,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:16:07,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:16:07,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:16:07,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:16:07,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:16:07,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:16:07,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:16:07,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:16:07,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:16:07,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:16:07,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:16:07,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:16:07,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:16:07,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:16:07,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:16:07,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:16:07,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:16:07,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:16:07,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:16:07,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:16:07,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:16:07,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:16:07,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:16:07,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:16:07,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:16:07,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:16:07,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:16:07,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-11-28 03:16:07,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:16:07,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:16:07,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:16:07,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:16:07,970 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:16:07,970 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-11-28 03:16:07,970 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-11-28 03:16:07,971 INFO L138 SettingsManager]: * Use old map elimination=false [2020-11-28 03:16:07,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-11-28 03:16:07,971 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-11-28 03:16:07,971 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-11-28 03:16:07,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:16:07,972 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:16:07,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-28 03:16:07,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:16:07,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:16:07,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:16:07,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-11-28 03:16:07,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-11-28 03:16:07,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-11-28 03:16:07,974 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:16:07,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:16:07,974 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-11-28 03:16:07,975 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:16:07,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-11-28 03:16:07,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:16:07,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:16:07,976 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-11-28 03:16:07,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:16:07,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:16:07,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:16:07,978 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-11-28 03:16:07,979 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-11-28 03:16:07,982 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/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 -> bcaab56def91d08648015d5637379998052b8de3 [2020-11-28 03:16:08,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:16:08,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:16:08,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:16:08,270 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:16:08,271 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:16:08,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/../../sv-benchmarks/c/systemc/kundu2.cil.c [2020-11-28 03:16:08,368 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/data/9e05642fc/fe887a9b49f14a0fa769b342c4677e43/FLAG75916671b [2020-11-28 03:16:08,945 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:16:08,945 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/sv-benchmarks/c/systemc/kundu2.cil.c [2020-11-28 03:16:08,955 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/data/9e05642fc/fe887a9b49f14a0fa769b342c4677e43/FLAG75916671b [2020-11-28 03:16:09,365 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/data/9e05642fc/fe887a9b49f14a0fa769b342c4677e43 [2020-11-28 03:16:09,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:16:09,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:16:09,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:09,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:16:09,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:16:09,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2dc143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09, skipping insertion in model container [2020-11-28 03:16:09,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:16:09,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:16:09,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:09,691 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:16:09,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:16:09,754 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:16:09,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09 WrapperNode [2020-11-28 03:16:09,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:16:09,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:09,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:16:09,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:16:09,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:16:09,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:16:09,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:16:09,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:16:09,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... [2020-11-28 03:16:09,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:16:09,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:16:09,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:16:09,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:16:09,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/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 [2020-11-28 03:16:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:16:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:16:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:16:09,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:16:10,863 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:16:10,864 INFO L298 CfgBuilder]: Removed 103 assume(true) statements. [2020-11-28 03:16:10,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:10 BoogieIcfgContainer [2020-11-28 03:16:10,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:16:10,867 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-11-28 03:16:10,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-11-28 03:16:10,871 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-11-28 03:16:10,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:10,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:16:09" (1/3) ... [2020-11-28 03:16:10,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@307e2f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:10, skipping insertion in model container [2020-11-28 03:16:10,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:10,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:16:09" (2/3) ... [2020-11-28 03:16:10,873 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@307e2f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:16:10, skipping insertion in model container [2020-11-28 03:16:10,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-11-28 03:16:10,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:10" (3/3) ... [2020-11-28 03:16:10,875 INFO L373 chiAutomizerObserver]: Analyzing ICFG kundu2.cil.c [2020-11-28 03:16:10,934 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-11-28 03:16:10,934 INFO L360 BuchiCegarLoop]: Hoare is false [2020-11-28 03:16:10,934 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-11-28 03:16:10,935 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:16:10,935 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:16:10,935 INFO L364 BuchiCegarLoop]: Difference is false [2020-11-28 03:16:10,935 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:16:10,935 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-11-28 03:16:10,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states. [2020-11-28 03:16:10,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 147 [2020-11-28 03:16:10,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:10,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:11,001 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:11,001 INFO L853 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] [2020-11-28 03:16:11,001 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-11-28 03:16:11,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states. [2020-11-28 03:16:11,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 147 [2020-11-28 03:16:11,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:11,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:11,013 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:11,013 INFO L853 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] [2020-11-28 03:16:11,023 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 11#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 181#L591true havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 135#L289true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 7#L296-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 65#L301-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 91#L306-1true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 19#L109true assume !(1 == ~P_1_pc~0); 14#L109-2true is_P_1_triggered_~__retres1~0 := 0; 20#L120true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 144#L121true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 58#L469true assume !(0 != activate_threads_~tmp~1); 32#L469-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 52#L177true assume 1 == ~P_2_pc~0; 167#L178true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 54#L188true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 168#L189true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 63#L477true assume !(0 != activate_threads_~tmp___0~1); 69#L477-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 116#L259true assume 1 == ~C_1_pc~0; 43#L260true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 180#L280true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 121#L281true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 93#L485true assume !(0 != activate_threads_~tmp___1~1); 155#L539-1true [2020-11-28 03:16:11,024 INFO L796 eck$LassoCheckResult]: Loop: 155#L539-1true assume !false; 90#L540true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 123#L388true assume !true; 149#L404true start_simulation_~kernel_st~0 := 2; 129#L289-1true start_simulation_~kernel_st~0 := 3; 170#L415true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 166#L109-6true assume 1 == ~P_1_pc~0; 137#L110-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 16#L120-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 139#L121-2true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 44#L469-6true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 21#L469-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 61#L177-6true assume 1 == ~P_2_pc~0; 161#L178-2true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 47#L188-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 162#L189-2true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 55#L477-6true assume !(0 != activate_threads_~tmp___0~1); 59#L477-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 82#L259-6true assume 1 == ~C_1_pc~0; 38#L260-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 174#L280-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 110#L281-2true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 87#L485-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 64#L485-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 127#L319-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 122#L336-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 41#L337-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 160#L558true assume !(0 == start_simulation_~tmp~3); 163#L558-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 133#L319-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 94#L336-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 45#L337-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 57#L513true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 132#L520true stop_simulation_#res := stop_simulation_~__retres2~0; 60#L521true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 39#L571true assume !(0 != start_simulation_~tmp___0~2); 155#L539-1true [2020-11-28 03:16:11,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2020-11-28 03:16:11,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311784796] [2020-11-28 03:16:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311784796] [2020-11-28 03:16:11,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:11,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453082260] [2020-11-28 03:16:11,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,202 INFO L82 PathProgramCache]: Analyzing trace with hash -583186551, now seen corresponding path program 1 times [2020-11-28 03:16:11,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93652891] [2020-11-28 03:16:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93652891] [2020-11-28 03:16:11,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:16:11,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328804663] [2020-11-28 03:16:11,222 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:11,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:11,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:11,239 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 3 states. [2020-11-28 03:16:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:11,273 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2020-11-28 03:16:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:11,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2020-11-28 03:16:11,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2020-11-28 03:16:11,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2020-11-28 03:16:11,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2020-11-28 03:16:11,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2020-11-28 03:16:11,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2020-11-28 03:16:11,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:11,312 INFO L691 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2020-11-28 03:16:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2020-11-28 03:16:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2020-11-28 03:16:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-28 03:16:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2020-11-28 03:16:11,349 INFO L714 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2020-11-28 03:16:11,350 INFO L594 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2020-11-28 03:16:11,350 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-11-28 03:16:11,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2020-11-28 03:16:11,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2020-11-28 03:16:11,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:11,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:11,357 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:11,361 INFO L853 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, 1, 1, 1, 1] [2020-11-28 03:16:11,362 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 380#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 381#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 523#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 373#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 374#L301-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 477#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 394#L109 assume !(1 == ~P_1_pc~0); 388#L109-2 is_P_1_triggered_~__retres1~0 := 0; 389#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 396#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 468#L469 assume !(0 != activate_threads_~tmp~1); 418#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 419#L177 assume 1 == ~P_2_pc~0; 459#L178 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 447#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 462#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 474#L477 assume !(0 != activate_threads_~tmp___0~1); 475#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 480#L259 assume 1 == ~C_1_pc~0; 443#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 445#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 514#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 504#L485 assume !(0 != activate_threads_~tmp___1~1); 433#L539-1 [2020-11-28 03:16:11,362 INFO L796 eck$LassoCheckResult]: Loop: 433#L539-1 assume !false; 501#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 410#L388 assume !false; 515#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 527#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 450#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 430#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 431#L353 assume !(0 != eval_~tmp___2~0); 496#L404 start_simulation_~kernel_st~0 := 2; 518#L289-1 start_simulation_~kernel_st~0 := 3; 519#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 529#L109-6 assume 1 == ~P_1_pc~0; 524#L110-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 390#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 391#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 440#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 397#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 398#L177-6 assume 1 == ~P_2_pc~0; 471#L178-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 412#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 448#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 460#L477-6 assume !(0 != activate_threads_~tmp___0~1); 461#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 467#L259-6 assume 1 == ~C_1_pc~0; 427#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 428#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 511#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 500#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 472#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 473#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 458#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 438#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 439#L558 assume !(0 == start_simulation_~tmp~3); 508#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 522#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 464#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 441#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 442#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 466#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 469#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 432#L571 assume !(0 != start_simulation_~tmp___0~2); 433#L539-1 [2020-11-28 03:16:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2020-11-28 03:16:11,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396727360] [2020-11-28 03:16:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396727360] [2020-11-28 03:16:11,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:11,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645891724] [2020-11-28 03:16:11,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1970065237, now seen corresponding path program 1 times [2020-11-28 03:16:11,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559501389] [2020-11-28 03:16:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559501389] [2020-11-28 03:16:11,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:11,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609543843] [2020-11-28 03:16:11,523 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:11,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:11,524 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2020-11-28 03:16:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:11,557 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2020-11-28 03:16:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:11,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2020-11-28 03:16:11,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2020-11-28 03:16:11,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2020-11-28 03:16:11,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2020-11-28 03:16:11,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2020-11-28 03:16:11,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2020-11-28 03:16:11,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:11,567 INFO L691 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2020-11-28 03:16:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2020-11-28 03:16:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2020-11-28 03:16:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-28 03:16:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2020-11-28 03:16:11,577 INFO L714 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2020-11-28 03:16:11,577 INFO L594 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2020-11-28 03:16:11,577 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-11-28 03:16:11,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2020-11-28 03:16:11,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2020-11-28 03:16:11,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:11,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:11,581 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:11,581 INFO L853 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, 1, 1, 1, 1] [2020-11-28 03:16:11,582 INFO L794 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 723#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 724#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 866#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 716#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 717#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 819#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 737#L109 assume !(1 == ~P_1_pc~0); 730#L109-2 is_P_1_triggered_~__retres1~0 := 0; 731#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 739#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 810#L469 assume !(0 != activate_threads_~tmp~1); 761#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 762#L177 assume 1 == ~P_2_pc~0; 799#L178 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 790#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 803#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 815#L477 assume !(0 != activate_threads_~tmp___0~1); 816#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 823#L259 assume 1 == ~C_1_pc~0; 783#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 785#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 857#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 847#L485 assume !(0 != activate_threads_~tmp___1~1); 776#L539-1 [2020-11-28 03:16:11,582 INFO L796 eck$LassoCheckResult]: Loop: 776#L539-1 assume !false; 844#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 753#L388 assume !false; 858#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 870#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 793#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 770#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 771#L353 assume !(0 != eval_~tmp___2~0); 839#L404 start_simulation_~kernel_st~0 := 2; 861#L289-1 start_simulation_~kernel_st~0 := 3; 862#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 872#L109-6 assume 1 == ~P_1_pc~0; 867#L110-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 733#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 734#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 786#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 740#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 741#L177-6 assume !(1 == ~P_2_pc~0); 757#L177-8 is_P_2_triggered_~__retres1~1 := 0; 758#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 791#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 804#L477-6 assume !(0 != activate_threads_~tmp___0~1); 805#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 811#L259-6 assume 1 == ~C_1_pc~0; 772#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 773#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 854#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 843#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 817#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 818#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 802#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 781#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 782#L558 assume !(0 == start_simulation_~tmp~3); 851#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 865#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 807#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 787#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 788#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 809#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 812#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 775#L571 assume !(0 != start_simulation_~tmp___0~2); 776#L539-1 [2020-11-28 03:16:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2020-11-28 03:16:11,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471938259] [2020-11-28 03:16:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471938259] [2020-11-28 03:16:11,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:16:11,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128761875] [2020-11-28 03:16:11,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 734507082, now seen corresponding path program 1 times [2020-11-28 03:16:11,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:11,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391932944] [2020-11-28 03:16:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:11,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391932944] [2020-11-28 03:16:11,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:11,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:11,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268677871] [2020-11-28 03:16:11,742 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:11,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:11,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:16:11,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:16:11,743 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 4 states. [2020-11-28 03:16:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:11,945 INFO L93 Difference]: Finished difference Result 432 states and 626 transitions. [2020-11-28 03:16:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:16:11,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 626 transitions. [2020-11-28 03:16:11,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 374 [2020-11-28 03:16:11,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 432 states and 626 transitions. [2020-11-28 03:16:11,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2020-11-28 03:16:11,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2020-11-28 03:16:11,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 626 transitions. [2020-11-28 03:16:11,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:11,959 INFO L691 BuchiCegarLoop]: Abstraction has 432 states and 626 transitions. [2020-11-28 03:16:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 626 transitions. [2020-11-28 03:16:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 392. [2020-11-28 03:16:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-11-28 03:16:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2020-11-28 03:16:11,988 INFO L714 BuchiCegarLoop]: Abstraction has 392 states and 572 transitions. [2020-11-28 03:16:11,988 INFO L594 BuchiCegarLoop]: Abstraction has 392 states and 572 transitions. [2020-11-28 03:16:11,988 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-11-28 03:16:11,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 392 states and 572 transitions. [2020-11-28 03:16:11,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 359 [2020-11-28 03:16:11,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:11,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:11,995 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:11,996 INFO L853 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, 1, 1, 1, 1] [2020-11-28 03:16:11,996 INFO L794 eck$LassoCheckResult]: Stem: 1475#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 1335#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1336#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 1479#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1328#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1329#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1428#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 1348#L109 assume !(1 == ~P_1_pc~0); 1342#L109-2 is_P_1_triggered_~__retres1~0 := 0; 1343#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1349#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1419#L469 assume !(0 != activate_threads_~tmp~1); 1370#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1371#L177 assume !(1 == ~P_2_pc~0); 1398#L177-2 is_P_2_triggered_~__retres1~1 := 0; 1399#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1413#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1424#L477 assume !(0 != activate_threads_~tmp___0~1); 1425#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1431#L259 assume 1 == ~C_1_pc~0; 1395#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1397#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1469#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1455#L485 assume !(0 != activate_threads_~tmp___1~1); 1456#L539-1 [2020-11-28 03:16:11,996 INFO L796 eck$LassoCheckResult]: Loop: 1456#L539-1 assume !false; 1647#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 1645#L388 assume !false; 1486#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1484#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1402#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1379#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1380#L353 assume !(0 != eval_~tmp___2~0); 1446#L404 start_simulation_~kernel_st~0 := 2; 1485#L289-1 start_simulation_~kernel_st~0 := 3; 1644#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 1498#L109-6 assume !(1 == ~P_1_pc~0); 1499#L109-8 is_P_1_triggered_~__retres1~0 := 0; 1685#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1683#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1681#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1679#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1677#L177-6 assume !(1 == ~P_2_pc~0); 1676#L177-8 is_P_2_triggered_~__retres1~1 := 0; 1675#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1671#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1669#L477-6 assume !(0 != activate_threads_~tmp___0~1); 1667#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1665#L259-6 assume 1 == ~C_1_pc~0; 1661#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1657#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1656#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1655#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1654#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1652#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1650#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1646#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1491#L558 assume !(0 == start_simulation_~tmp~3); 1492#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 1673#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1670#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1668#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1666#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1664#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 1663#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1658#L571 assume !(0 != start_simulation_~tmp___0~2); 1456#L539-1 [2020-11-28 03:16:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:11,997 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2020-11-28 03:16:12,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581338787] [2020-11-28 03:16:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:12,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581338787] [2020-11-28 03:16:12,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:12,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:16:12,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887579210] [2020-11-28 03:16:12,068 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash 677362857, now seen corresponding path program 1 times [2020-11-28 03:16:12,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669015746] [2020-11-28 03:16:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:12,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669015746] [2020-11-28 03:16:12,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:12,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:12,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321573297] [2020-11-28 03:16:12,114 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:12,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:16:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:16:12,115 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. cyclomatic complexity: 182 Second operand 4 states. [2020-11-28 03:16:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:12,310 INFO L93 Difference]: Finished difference Result 1082 states and 1540 transitions. [2020-11-28 03:16:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:16:12,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1540 transitions. [2020-11-28 03:16:12,324 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1006 [2020-11-28 03:16:12,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1082 states and 1540 transitions. [2020-11-28 03:16:12,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1082 [2020-11-28 03:16:12,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1082 [2020-11-28 03:16:12,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1082 states and 1540 transitions. [2020-11-28 03:16:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:12,340 INFO L691 BuchiCegarLoop]: Abstraction has 1082 states and 1540 transitions. [2020-11-28 03:16:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states and 1540 transitions. [2020-11-28 03:16:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1023. [2020-11-28 03:16:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2020-11-28 03:16:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1468 transitions. [2020-11-28 03:16:12,403 INFO L714 BuchiCegarLoop]: Abstraction has 1023 states and 1468 transitions. [2020-11-28 03:16:12,405 INFO L594 BuchiCegarLoop]: Abstraction has 1023 states and 1468 transitions. [2020-11-28 03:16:12,405 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-11-28 03:16:12,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1023 states and 1468 transitions. [2020-11-28 03:16:12,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 985 [2020-11-28 03:16:12,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:12,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:12,418 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:12,418 INFO L853 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, 1, 1, 1, 1, 1] [2020-11-28 03:16:12,418 INFO L794 eck$LassoCheckResult]: Stem: 2985#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 2823#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2824#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 2990#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2815#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2816#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2916#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 2836#L109 assume !(1 == ~P_1_pc~0); 2830#L109-2 is_P_1_triggered_~__retres1~0 := 0; 2831#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2837#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2906#L469 assume !(0 != activate_threads_~tmp~1); 2858#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2859#L177 assume !(1 == ~P_2_pc~0); 2884#L177-2 is_P_2_triggered_~__retres1~1 := 0; 2885#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2899#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2912#L477 assume !(0 != activate_threads_~tmp___0~1); 2913#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2919#L259 assume !(1 == ~C_1_pc~0); 2962#L259-2 assume 2 == ~C_1_pc~0; 2963#L270 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 2976#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2977#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2952#L485 assume !(0 != activate_threads_~tmp___1~1); 2953#L539-1 [2020-11-28 03:16:12,420 INFO L796 eck$LassoCheckResult]: Loop: 2953#L539-1 assume !false; 2949#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 2850#L388 assume !false; 3757#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3755#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2974#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2975#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2938#L353 assume !(0 != eval_~tmp___2~0); 2940#L404 start_simulation_~kernel_st~0 := 2; 3802#L289-1 start_simulation_~kernel_st~0 := 3; 3800#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 3798#L109-6 assume !(1 == ~P_1_pc~0); 3797#L109-8 is_P_1_triggered_~__retres1~0 := 0; 3796#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3795#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3794#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 3793#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3792#L177-6 assume !(1 == ~P_2_pc~0); 3791#L177-8 is_P_2_triggered_~__retres1~1 := 0; 3790#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3789#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3788#L477-6 assume !(0 != activate_threads_~tmp___0~1); 3787#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3786#L259-6 assume !(1 == ~C_1_pc~0); 3785#L259-8 assume 2 == ~C_1_pc~0; 3783#L270-2 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 3782#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3781#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 3780#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3779#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3777#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3775#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3774#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3771#L558 assume !(0 == start_simulation_~tmp~3); 3770#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 3768#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3766#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3765#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 3764#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3763#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 3762#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 3761#L571 assume !(0 != start_simulation_~tmp___0~2); 2953#L539-1 [2020-11-28 03:16:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1720008278, now seen corresponding path program 1 times [2020-11-28 03:16:12,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833900299] [2020-11-28 03:16:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:12,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833900299] [2020-11-28 03:16:12,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:12,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:12,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758719551] [2020-11-28 03:16:12,487 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 919348629, now seen corresponding path program 1 times [2020-11-28 03:16:12,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920018115] [2020-11-28 03:16:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:12,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920018115] [2020-11-28 03:16:12,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:12,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:12,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962775408] [2020-11-28 03:16:12,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:12,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:12,541 INFO L87 Difference]: Start difference. First operand 1023 states and 1468 transitions. cyclomatic complexity: 449 Second operand 3 states. [2020-11-28 03:16:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:12,618 INFO L93 Difference]: Finished difference Result 1354 states and 1912 transitions. [2020-11-28 03:16:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:12,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1354 states and 1912 transitions. [2020-11-28 03:16:12,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1311 [2020-11-28 03:16:12,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1354 states to 1354 states and 1912 transitions. [2020-11-28 03:16:12,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1354 [2020-11-28 03:16:12,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1354 [2020-11-28 03:16:12,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1354 states and 1912 transitions. [2020-11-28 03:16:12,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:12,650 INFO L691 BuchiCegarLoop]: Abstraction has 1354 states and 1912 transitions. [2020-11-28 03:16:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states and 1912 transitions. [2020-11-28 03:16:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1330. [2020-11-28 03:16:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-11-28 03:16:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1882 transitions. [2020-11-28 03:16:12,676 INFO L714 BuchiCegarLoop]: Abstraction has 1330 states and 1882 transitions. [2020-11-28 03:16:12,676 INFO L594 BuchiCegarLoop]: Abstraction has 1330 states and 1882 transitions. [2020-11-28 03:16:12,676 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-11-28 03:16:12,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1882 transitions. [2020-11-28 03:16:12,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1287 [2020-11-28 03:16:12,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:12,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:12,689 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:12,690 INFO L853 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, 1, 1, 1, 1, 1] [2020-11-28 03:16:12,690 INFO L794 eck$LassoCheckResult]: Stem: 5360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 5208#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 5209#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 5365#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5201#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5202#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5299#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 5221#L109 assume !(1 == ~P_1_pc~0); 5215#L109-2 is_P_1_triggered_~__retres1~0 := 0; 5216#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5222#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5290#L469 assume !(0 != activate_threads_~tmp~1); 5243#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5244#L177 assume !(1 == ~P_2_pc~0); 5268#L177-2 is_P_2_triggered_~__retres1~1 := 0; 5269#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5284#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5295#L477 assume !(0 != activate_threads_~tmp___0~1); 5296#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5302#L259 assume !(1 == ~C_1_pc~0); 5340#L259-2 assume !(2 == ~C_1_pc~0); 5341#L269-1 is_C_1_triggered_~__retres1~2 := 0; 5395#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5353#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5327#L485 assume !(0 != activate_threads_~tmp___1~1); 5328#L539-1 [2020-11-28 03:16:12,692 INFO L796 eck$LassoCheckResult]: Loop: 5328#L539-1 assume !false; 6337#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 6280#L388 assume !false; 6335#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6333#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6331#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6329#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 6326#L353 assume !(0 != eval_~tmp___2~0); 6327#L404 start_simulation_~kernel_st~0 := 2; 6470#L289-1 start_simulation_~kernel_st~0 := 3; 6468#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 6466#L109-6 assume !(1 == ~P_1_pc~0); 6464#L109-8 is_P_1_triggered_~__retres1~0 := 0; 6462#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6460#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6458#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 6455#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6452#L177-6 assume !(1 == ~P_2_pc~0); 6448#L177-8 is_P_2_triggered_~__retres1~1 := 0; 6444#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6440#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 6434#L477-6 assume !(0 != activate_threads_~tmp___0~1); 6430#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6426#L259-6 assume !(1 == ~C_1_pc~0); 6421#L259-8 assume !(2 == ~C_1_pc~0); 6414#L269-5 is_C_1_triggered_~__retres1~2 := 0; 6413#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6407#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 6403#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 6399#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6393#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6388#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6385#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6363#L558 assume !(0 == start_simulation_~tmp~3); 6357#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 6348#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6344#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6343#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 6342#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6341#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 6340#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6339#L571 assume !(0 != start_simulation_~tmp___0~2); 5328#L539-1 [2020-11-28 03:16:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2020-11-28 03:16:12,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315972881] [2020-11-28 03:16:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:12,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:12,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:12,782 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2059700340, now seen corresponding path program 1 times [2020-11-28 03:16:12,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:12,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107260673] [2020-11-28 03:16:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:12,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107260673] [2020-11-28 03:16:12,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:12,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:12,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822107809] [2020-11-28 03:16:12,839 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:12,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:12,840 INFO L87 Difference]: Start difference. First operand 1330 states and 1882 transitions. cyclomatic complexity: 556 Second operand 5 states. [2020-11-28 03:16:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:12,972 INFO L93 Difference]: Finished difference Result 2355 states and 3300 transitions. [2020-11-28 03:16:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:16:12,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2355 states and 3300 transitions. [2020-11-28 03:16:12,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2294 [2020-11-28 03:16:13,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2355 states to 2355 states and 3300 transitions. [2020-11-28 03:16:13,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2355 [2020-11-28 03:16:13,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2355 [2020-11-28 03:16:13,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2355 states and 3300 transitions. [2020-11-28 03:16:13,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:13,017 INFO L691 BuchiCegarLoop]: Abstraction has 2355 states and 3300 transitions. [2020-11-28 03:16:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states and 3300 transitions. [2020-11-28 03:16:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1366. [2020-11-28 03:16:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2020-11-28 03:16:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1918 transitions. [2020-11-28 03:16:13,048 INFO L714 BuchiCegarLoop]: Abstraction has 1366 states and 1918 transitions. [2020-11-28 03:16:13,048 INFO L594 BuchiCegarLoop]: Abstraction has 1366 states and 1918 transitions. [2020-11-28 03:16:13,048 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-11-28 03:16:13,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1366 states and 1918 transitions. [2020-11-28 03:16:13,055 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1323 [2020-11-28 03:16:13,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:13,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:13,057 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:13,057 INFO L853 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:13,058 INFO L794 eck$LassoCheckResult]: Stem: 9069#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 8909#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 8910#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 9076#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 8902#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 8903#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 9007#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 8922#L109 assume !(1 == ~P_1_pc~0); 8915#L109-2 is_P_1_triggered_~__retres1~0 := 0; 8916#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8923#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8995#L469 assume !(0 != activate_threads_~tmp~1); 8946#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8947#L177 assume !(1 == ~P_2_pc~0); 8973#L177-2 is_P_2_triggered_~__retres1~1 := 0; 8974#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8988#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9005#L477 assume !(0 != activate_threads_~tmp___0~1); 9006#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 9012#L259 assume !(1 == ~C_1_pc~0); 9051#L259-2 assume !(2 == ~C_1_pc~0); 9052#L269-1 is_C_1_triggered_~__retres1~2 := 0; 9120#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9065#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9041#L485 assume !(0 != activate_threads_~tmp___1~1); 8961#L539-1 [2020-11-28 03:16:13,063 INFO L796 eck$LassoCheckResult]: Loop: 8961#L539-1 assume !false; 9038#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 9039#L388 assume !false; 9066#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9090#L319 assume !(0 == ~P_1_st~0); 8977#L323 assume !(0 == ~P_2_st~0); 8979#L327 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 9093#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8955#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 8956#L353 assume !(0 != eval_~tmp___2~0); 9091#L404 start_simulation_~kernel_st~0 := 2; 9092#L289-1 start_simulation_~kernel_st~0 := 3; 9113#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 9114#L109-6 assume !(1 == ~P_1_pc~0); 9101#L109-8 is_P_1_triggered_~__retres1~0 := 0; 9102#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 9081#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 9082#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8926#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8927#L177-6 assume !(1 == ~P_2_pc~0); 8942#L177-8 is_P_2_triggered_~__retres1~1 := 0; 8943#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 9106#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9107#L477-6 assume !(0 != activate_threads_~tmp___0~1); 8996#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8997#L259-6 assume !(1 == ~C_1_pc~0); 9024#L259-8 assume !(2 == ~C_1_pc~0); 9025#L269-5 is_C_1_triggered_~__retres1~2 := 0; 9116#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9117#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9036#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 9037#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9068#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8987#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8962#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 8963#L558 assume !(0 == start_simulation_~tmp~3); 9049#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 9108#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 10232#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8969#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 8970#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8994#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 8998#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 8960#L571 assume !(0 != start_simulation_~tmp___0~2); 8961#L539-1 [2020-11-28 03:16:13,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2020-11-28 03:16:13,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178280983] [2020-11-28 03:16:13,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,086 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,119 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1466064813, now seen corresponding path program 1 times [2020-11-28 03:16:13,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540027094] [2020-11-28 03:16:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:13,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540027094] [2020-11-28 03:16:13,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:13,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:16:13,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057012506] [2020-11-28 03:16:13,205 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:13,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:16:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:16:13,206 INFO L87 Difference]: Start difference. First operand 1366 states and 1918 transitions. cyclomatic complexity: 556 Second operand 5 states. [2020-11-28 03:16:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:13,358 INFO L93 Difference]: Finished difference Result 2664 states and 3733 transitions. [2020-11-28 03:16:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:16:13,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2664 states and 3733 transitions. [2020-11-28 03:16:13,385 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2621 [2020-11-28 03:16:13,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2664 states to 2664 states and 3733 transitions. [2020-11-28 03:16:13,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2664 [2020-11-28 03:16:13,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2664 [2020-11-28 03:16:13,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2664 states and 3733 transitions. [2020-11-28 03:16:13,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:13,415 INFO L691 BuchiCegarLoop]: Abstraction has 2664 states and 3733 transitions. [2020-11-28 03:16:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states and 3733 transitions. [2020-11-28 03:16:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1420. [2020-11-28 03:16:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2020-11-28 03:16:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1957 transitions. [2020-11-28 03:16:13,449 INFO L714 BuchiCegarLoop]: Abstraction has 1420 states and 1957 transitions. [2020-11-28 03:16:13,449 INFO L594 BuchiCegarLoop]: Abstraction has 1420 states and 1957 transitions. [2020-11-28 03:16:13,449 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-11-28 03:16:13,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1420 states and 1957 transitions. [2020-11-28 03:16:13,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1377 [2020-11-28 03:16:13,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:13,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:13,458 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:13,458 INFO L853 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:13,458 INFO L794 eck$LassoCheckResult]: Stem: 13109#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 12953#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 12954#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 13116#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12946#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12947#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 13047#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 12966#L109 assume !(1 == ~P_1_pc~0); 12960#L109-2 is_P_1_triggered_~__retres1~0 := 0; 12961#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12967#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 13038#L469 assume !(0 != activate_threads_~tmp~1); 12991#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12992#L177 assume !(1 == ~P_2_pc~0); 13017#L177-2 is_P_2_triggered_~__retres1~1 := 0; 13018#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 13031#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 13043#L477 assume !(0 != activate_threads_~tmp___0~1); 13044#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13051#L259 assume !(1 == ~C_1_pc~0); 13087#L259-2 assume !(2 == ~C_1_pc~0); 13088#L269-1 is_C_1_triggered_~__retres1~2 := 0; 13145#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13102#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 13078#L485 assume !(0 != activate_threads_~tmp___1~1); 13079#L539-1 [2020-11-28 03:16:13,459 INFO L796 eck$LassoCheckResult]: Loop: 13079#L539-1 assume !false; 13464#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 13790#L388 assume !false; 13789#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13459#L319 assume !(0 == ~P_1_st~0); 13460#L323 assume !(0 == ~P_2_st~0); 13457#L327 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 13458#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13786#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 13525#L353 assume !(0 != eval_~tmp___2~0); 13524#L404 start_simulation_~kernel_st~0 := 2; 13523#L289-1 start_simulation_~kernel_st~0 := 3; 13522#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 13521#L109-6 assume !(1 == ~P_1_pc~0); 13520#L109-8 is_P_1_triggered_~__retres1~0 := 0; 13518#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13516#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 13514#L469-6 assume !(0 != activate_threads_~tmp~1); 13512#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13510#L177-6 assume !(1 == ~P_2_pc~0); 13508#L177-8 is_P_2_triggered_~__retres1~1 := 0; 13506#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 13504#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 13502#L477-6 assume !(0 != activate_threads_~tmp___0~1); 13500#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13498#L259-6 assume !(1 == ~C_1_pc~0); 13496#L259-8 assume !(2 == ~C_1_pc~0); 13494#L269-5 is_C_1_triggered_~__retres1~2 := 0; 13492#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13490#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 13488#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 13486#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13483#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13480#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13478#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 13475#L558 assume !(0 == start_simulation_~tmp~3); 13474#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, 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~3;havoc exists_runnable_thread_~__retres1~3; 13472#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13470#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13469#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 13468#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 13467#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 13466#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 13465#L571 assume !(0 != start_simulation_~tmp___0~2); 13079#L539-1 [2020-11-28 03:16:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2020-11-28 03:16:13,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901360909] [2020-11-28 03:16:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash -905674449, now seen corresponding path program 1 times [2020-11-28 03:16:13,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545619829] [2020-11-28 03:16:13,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:13,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545619829] [2020-11-28 03:16:13,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:13,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:13,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313414696] [2020-11-28 03:16:13,530 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-11-28 03:16:13,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:13,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:13,531 INFO L87 Difference]: Start difference. First operand 1420 states and 1957 transitions. cyclomatic complexity: 541 Second operand 3 states. [2020-11-28 03:16:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:13,588 INFO L93 Difference]: Finished difference Result 2199 states and 2992 transitions. [2020-11-28 03:16:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:13,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2199 states and 2992 transitions. [2020-11-28 03:16:13,605 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2112 [2020-11-28 03:16:13,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2199 states to 2199 states and 2992 transitions. [2020-11-28 03:16:13,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2199 [2020-11-28 03:16:13,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2199 [2020-11-28 03:16:13,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2199 states and 2992 transitions. [2020-11-28 03:16:13,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:13,627 INFO L691 BuchiCegarLoop]: Abstraction has 2199 states and 2992 transitions. [2020-11-28 03:16:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states and 2992 transitions. [2020-11-28 03:16:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2199. [2020-11-28 03:16:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2199 states. [2020-11-28 03:16:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2992 transitions. [2020-11-28 03:16:13,689 INFO L714 BuchiCegarLoop]: Abstraction has 2199 states and 2992 transitions. [2020-11-28 03:16:13,689 INFO L594 BuchiCegarLoop]: Abstraction has 2199 states and 2992 transitions. [2020-11-28 03:16:13,689 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-11-28 03:16:13,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2199 states and 2992 transitions. [2020-11-28 03:16:13,709 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2112 [2020-11-28 03:16:13,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:13,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:13,710 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:13,710 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:13,710 INFO L794 eck$LassoCheckResult]: Stem: 16730#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 16577#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 16578#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 16737#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 16570#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16571#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 16668#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 16590#L109 assume !(1 == ~P_1_pc~0); 16583#L109-2 is_P_1_triggered_~__retres1~0 := 0; 16584#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 16591#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 16659#L469 assume !(0 != activate_threads_~tmp~1); 16612#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 16613#L177 assume !(1 == ~P_2_pc~0); 16637#L177-2 is_P_2_triggered_~__retres1~1 := 0; 16638#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 16652#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 16664#L477 assume !(0 != activate_threads_~tmp___0~1); 16665#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 16673#L259 assume !(1 == ~C_1_pc~0); 16712#L259-2 assume !(2 == ~C_1_pc~0); 16713#L269-1 is_C_1_triggered_~__retres1~2 := 0; 16767#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 16724#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 16699#L485 assume !(0 != activate_threads_~tmp___1~1); 16700#L539-1 assume !false; 18147#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 18148#L388 [2020-11-28 03:16:13,710 INFO L796 eck$LassoCheckResult]: Loop: 18148#L388 assume !false; 18471#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18470#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 18469#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18468#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 18467#L353 assume 0 != eval_~tmp___2~0; 18130#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 18131#L362 assume !(0 != eval_~tmp~0); 18478#L358 assume !(0 == ~P_2_st~0); 18475#L373 assume !(0 == ~C_1_st~0); 18148#L388 [2020-11-28 03:16:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2020-11-28 03:16:13,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060676369] [2020-11-28 03:16:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,738 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1012948955, now seen corresponding path program 1 times [2020-11-28 03:16:13,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196961517] [2020-11-28 03:16:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:13,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:13,757 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1596401401, now seen corresponding path program 1 times [2020-11-28 03:16:13,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:13,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694799912] [2020-11-28 03:16:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:13,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694799912] [2020-11-28 03:16:13,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:13,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:13,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987128908] [2020-11-28 03:16:13,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:13,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:13,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:13,890 INFO L87 Difference]: Start difference. First operand 2199 states and 2992 transitions. cyclomatic complexity: 800 Second operand 3 states. [2020-11-28 03:16:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:13,974 INFO L93 Difference]: Finished difference Result 3650 states and 4893 transitions. [2020-11-28 03:16:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:13,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 4893 transitions. [2020-11-28 03:16:13,998 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3517 [2020-11-28 03:16:14,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 4893 transitions. [2020-11-28 03:16:14,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2020-11-28 03:16:14,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2020-11-28 03:16:14,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 4893 transitions. [2020-11-28 03:16:14,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:14,037 INFO L691 BuchiCegarLoop]: Abstraction has 3650 states and 4893 transitions. [2020-11-28 03:16:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 4893 transitions. [2020-11-28 03:16:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3574. [2020-11-28 03:16:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2020-11-28 03:16:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4799 transitions. [2020-11-28 03:16:14,132 INFO L714 BuchiCegarLoop]: Abstraction has 3574 states and 4799 transitions. [2020-11-28 03:16:14,132 INFO L594 BuchiCegarLoop]: Abstraction has 3574 states and 4799 transitions. [2020-11-28 03:16:14,132 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-11-28 03:16:14,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3574 states and 4799 transitions. [2020-11-28 03:16:14,146 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2020-11-28 03:16:14,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:14,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:14,149 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:14,149 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:14,150 INFO L794 eck$LassoCheckResult]: Stem: 22598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 22435#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 22436#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 22606#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 22427#L296-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 22428#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 22532#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 22448#L109 assume !(1 == ~P_1_pc~0); 22449#L109-2 is_P_1_triggered_~__retres1~0 := 0; 22450#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 22451#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 22521#L469 assume !(0 != activate_threads_~tmp~1); 22522#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 22509#L177 assume !(1 == ~P_2_pc~0); 22510#L177-2 is_P_2_triggered_~__retres1~1 := 0; 22513#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 22514#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 22527#L477 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 22528#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 22537#L259 assume !(1 == ~C_1_pc~0); 22577#L259-2 assume !(2 == ~C_1_pc~0); 22578#L269-1 is_C_1_triggered_~__retres1~2 := 0; 22653#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 22654#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 25100#L485 assume !(0 != activate_threads_~tmp___1~1); 25099#L539-1 assume !false; 25097#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 25095#L388 [2020-11-28 03:16:14,150 INFO L796 eck$LassoCheckResult]: Loop: 25095#L388 assume !false; 25092#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 25090#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 24988#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 24963#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 24961#L353 assume 0 != eval_~tmp___2~0; 24253#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 24255#L362 assume !(0 != eval_~tmp~0); 24955#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 24952#L377 assume !(0 != eval_~tmp___0~0); 24953#L373 assume !(0 == ~C_1_st~0); 25095#L388 [2020-11-28 03:16:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1311379569, now seen corresponding path program 1 times [2020-11-28 03:16:14,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:14,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514971538] [2020-11-28 03:16:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:14,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514971538] [2020-11-28 03:16:14,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:14,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:16:14,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141760017] [2020-11-28 03:16:14,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-11-28 03:16:14,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1336506855, now seen corresponding path program 1 times [2020-11-28 03:16:14,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:14,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310508358] [2020-11-28 03:16:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,189 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:14,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:14,285 INFO L87 Difference]: Start difference. First operand 3574 states and 4799 transitions. cyclomatic complexity: 1232 Second operand 3 states. [2020-11-28 03:16:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:14,329 INFO L93 Difference]: Finished difference Result 3552 states and 4774 transitions. [2020-11-28 03:16:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:14,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3552 states and 4774 transitions. [2020-11-28 03:16:14,357 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2020-11-28 03:16:14,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3552 states to 3552 states and 4774 transitions. [2020-11-28 03:16:14,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3552 [2020-11-28 03:16:14,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3552 [2020-11-28 03:16:14,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3552 states and 4774 transitions. [2020-11-28 03:16:14,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:14,390 INFO L691 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2020-11-28 03:16:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states and 4774 transitions. [2020-11-28 03:16:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3552. [2020-11-28 03:16:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3552 states. [2020-11-28 03:16:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4774 transitions. [2020-11-28 03:16:14,518 INFO L714 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2020-11-28 03:16:14,518 INFO L594 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2020-11-28 03:16:14,518 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-11-28 03:16:14,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3552 states and 4774 transitions. [2020-11-28 03:16:14,532 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2020-11-28 03:16:14,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:14,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:14,534 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:14,534 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:14,534 INFO L794 eck$LassoCheckResult]: Stem: 29722#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 29568#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 29569#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 29729#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 29560#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 29561#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 29656#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 29582#L109 assume !(1 == ~P_1_pc~0); 29574#L109-2 is_P_1_triggered_~__retres1~0 := 0; 29575#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 29583#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 29647#L469 assume !(0 != activate_threads_~tmp~1); 29604#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 29605#L177 assume !(1 == ~P_2_pc~0); 29629#L177-2 is_P_2_triggered_~__retres1~1 := 0; 29630#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 29640#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 29652#L477 assume !(0 != activate_threads_~tmp___0~1); 29653#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 29661#L259 assume !(1 == ~C_1_pc~0); 29702#L259-2 assume !(2 == ~C_1_pc~0); 29703#L269-1 is_C_1_triggered_~__retres1~2 := 0; 29761#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 29715#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 29691#L485 assume !(0 != activate_threads_~tmp___1~1); 29692#L539-1 assume !false; 31991#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 31986#L388 [2020-11-28 03:16:14,535 INFO L796 eck$LassoCheckResult]: Loop: 31986#L388 assume !false; 31987#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 31980#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 31981#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 31973#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 31974#L353 assume 0 != eval_~tmp___2~0; 31653#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 31654#L362 assume !(0 != eval_~tmp~0); 31649#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 31645#L377 assume !(0 != eval_~tmp___0~0); 31646#L373 assume !(0 == ~C_1_st~0); 31986#L388 [2020-11-28 03:16:14,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:14,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2020-11-28 03:16:14,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:14,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684657817] [2020-11-28 03:16:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,563 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1336506855, now seen corresponding path program 2 times [2020-11-28 03:16:14,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:14,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674785907] [2020-11-28 03:16:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,578 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:14,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:14,582 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:14,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2051024443, now seen corresponding path program 1 times [2020-11-28 03:16:14,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:14,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569975052] [2020-11-28 03:16:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:16:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:16:14,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569975052] [2020-11-28 03:16:14,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:16:14,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:16:14,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198564869] [2020-11-28 03:16:14,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:16:14,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:16:14,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:16:14,708 INFO L87 Difference]: Start difference. First operand 3552 states and 4774 transitions. cyclomatic complexity: 1229 Second operand 3 states. [2020-11-28 03:16:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:16:14,826 INFO L93 Difference]: Finished difference Result 6198 states and 8252 transitions. [2020-11-28 03:16:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:16:14,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6198 states and 8252 transitions. [2020-11-28 03:16:14,858 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6003 [2020-11-28 03:16:14,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6198 states to 6198 states and 8252 transitions. [2020-11-28 03:16:14,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6198 [2020-11-28 03:16:14,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6198 [2020-11-28 03:16:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6198 states and 8252 transitions. [2020-11-28 03:16:14,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-11-28 03:16:14,915 INFO L691 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2020-11-28 03:16:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6198 states and 8252 transitions. [2020-11-28 03:16:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6198 to 6198. [2020-11-28 03:16:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6198 states. [2020-11-28 03:16:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 8252 transitions. [2020-11-28 03:16:15,062 INFO L714 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2020-11-28 03:16:15,062 INFO L594 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2020-11-28 03:16:15,062 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-11-28 03:16:15,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6198 states and 8252 transitions. [2020-11-28 03:16:15,090 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6003 [2020-11-28 03:16:15,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-11-28 03:16:15,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-11-28 03:16:15,091 INFO L852 BuchiCegarLoop]: Counterexample stem 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] [2020-11-28 03:16:15,091 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:16:15,092 INFO L794 eck$LassoCheckResult]: Stem: 39488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_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; 39324#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;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 39325#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, 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; 39496#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 39317#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 39318#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 39415#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, 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; 39337#L109 assume !(1 == ~P_1_pc~0); 39330#L109-2 is_P_1_triggered_~__retres1~0 := 0; 39331#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 39338#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 39404#L469 assume !(0 != activate_threads_~tmp~1); 39358#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 39359#L177 assume !(1 == ~P_2_pc~0); 39386#L177-2 is_P_2_triggered_~__retres1~1 := 0; 39387#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 39397#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 39411#L477 assume !(0 != activate_threads_~tmp___0~1); 39412#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 39422#L259 assume !(1 == ~C_1_pc~0); 39468#L259-2 assume !(2 == ~C_1_pc~0); 39469#L269-1 is_C_1_triggered_~__retres1~2 := 0; 39536#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 39481#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 39457#L485 assume !(0 != activate_threads_~tmp___1~1); 39458#L539-1 assume !false; 40243#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, 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; 40244#L388 [2020-11-28 03:16:15,092 INFO L796 eck$LassoCheckResult]: Loop: 40244#L388 assume !false; 43791#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 43790#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 43789#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 43788#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 43787#L353 assume 0 != eval_~tmp___2~0; 43786#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 43785#L362 assume !(0 != eval_~tmp~0); 43784#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 43779#L377 assume !(0 != eval_~tmp___0~0); 40259#L373 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 40260#L392 assume !(0 != eval_~tmp___1~0); 40244#L388 [2020-11-28 03:16:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2020-11-28 03:16:15,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:15,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64287822] [2020-11-28 03:16:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,121 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1517962496, now seen corresponding path program 1 times [2020-11-28 03:16:15,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:15,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637098274] [2020-11-28 03:16:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:16:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash -842753748, now seen corresponding path program 1 times [2020-11-28 03:16:15,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:16:15,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188810955] [2020-11-28 03:16:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:16:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:16:15,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:16:15,164 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:16:15,267 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2020-11-28 03:16:16,254 WARN L193 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 141 [2020-11-28 03:16:16,591 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-11-28 03:16:16,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:16:16 BoogieIcfgContainer [2020-11-28 03:16:16,643 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-11-28 03:16:16,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:16:16,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:16:16,644 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:16:16,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:16:10" (3/4) ... [2020-11-28 03:16:16,647 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-11-28 03:16:16,696 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e6ea20d4-9c0b-40b3-bacd-f42ebdd10b87/bin/uautomizer/witness.graphml [2020-11-28 03:16:16,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:16:16,697 INFO L168 Benchmark]: Toolchain (without parser) took 7323.20 ms. Allocated memory was 94.4 MB in the beginning and 220.2 MB in the end (delta: 125.8 MB). Free memory was 64.2 MB in the beginning and 110.0 MB in the end (delta: -45.8 MB). Peak memory consumption was 78.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,698 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory was 50.4 MB in the beginning and 50.4 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:16:16,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.19 ms. Allocated memory is still 94.4 MB. Free memory was 64.2 MB in the beginning and 68.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.24 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 66.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,699 INFO L168 Benchmark]: Boogie Preprocessor took 39.62 ms. Allocated memory is still 94.4 MB. Free memory was 66.0 MB in the beginning and 63.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,699 INFO L168 Benchmark]: RCFGBuilder took 1003.92 ms. Allocated memory is still 94.4 MB. Free memory was 63.5 MB in the beginning and 57.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,700 INFO L168 Benchmark]: BuchiAutomizer took 5776.39 ms. Allocated memory was 94.4 MB in the beginning and 220.2 MB in the end (delta: 125.8 MB). Free memory was 57.1 MB in the beginning and 112.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 112.9 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,700 INFO L168 Benchmark]: Witness Printer took 52.56 ms. Allocated memory is still 220.2 MB. Free memory was 112.1 MB in the beginning and 110.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:16:16,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 77.6 MB. Free memory was 50.4 MB in the beginning and 50.4 MB in the end (delta: 24.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 379.19 ms. Allocated memory is still 94.4 MB. Free memory was 64.2 MB in the beginning and 68.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.24 ms. Allocated memory is still 94.4 MB. Free memory was 68.6 MB in the beginning and 66.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.62 ms. Allocated memory is still 94.4 MB. Free memory was 66.0 MB in the beginning and 63.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1003.92 ms. Allocated memory is still 94.4 MB. Free memory was 63.5 MB in the beginning and 57.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5776.39 ms. Allocated memory was 94.4 MB in the beginning and 220.2 MB in the end (delta: 125.8 MB). Free memory was 57.1 MB in the beginning and 112.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 112.9 MB. Max. memory is 16.1 GB. * Witness Printer took 52.56 ms. Allocated memory is still 220.2 MB. Free memory was 112.1 MB in the beginning and 110.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 6198 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.5s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2432 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 6198 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2657 SDtfs, 3757 SDslu, 3263 SDs, 0 SdLazy, 276 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN1 SILU0 SILI5 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: 348]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {count=0, NULL=0, \result=0, P_1_pc=0, NULL=1, C_1_i=1, tmp=0, C_1_st=0, data_0=0, kernel_st=1, tmp___2=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72eca83c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c4425b9=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d719145=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42f2179d=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@366c3436=0, NULL=4, \result=0, __retres1=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=2, NULL=2, NULL=0, tmp=0, NULL=3, C_1_pr=0, P_1_st=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ea287dd=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d17fadd=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3322cf7f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4400e4c7=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 348]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int P_2_pc ; [L125] int P_2_st ; [L126] int P_2_i ; [L127] int P_2_ev ; [L192] int C_1_pc ; [L193] int C_1_st ; [L194] int C_1_i ; [L195] int C_1_ev ; [L196] int C_1_pr ; [L595] int count ; [L596] int __retres2 ; [L600] num = 0 [L601] i = 0 [L602] max_loop = 2 [L604] timer = 0 [L605] P_1_pc = 0 [L606] P_2_pc = 0 [L607] C_1_pc = 0 [L609] count = 0 [L587] P_1_i = 1 [L588] P_2_i = 1 [L589] C_1_i = 1 [L525] int kernel_st ; [L526] int tmp ; [L527] int tmp___0 ; [L531] kernel_st = 0 [L296] COND TRUE (int )P_1_i == 1 [L297] P_1_st = 0 [L301] COND TRUE (int )P_2_i == 1 [L302] P_2_st = 0 [L306] COND TRUE (int )C_1_i == 1 [L307] C_1_st = 0 [L461] int tmp ; [L462] int tmp___0 ; [L463] int tmp___1 ; [L106] int __retres1 ; [L109] COND FALSE !((int )P_1_pc == 1) [L119] __retres1 = 0 [L121] return (__retres1); [L467] tmp = is_P_1_triggered() [L469] COND FALSE !(\read(tmp)) [L174] int __retres1 ; [L177] COND FALSE !((int )P_2_pc == 1) [L187] __retres1 = 0 [L189] return (__retres1); [L475] tmp___0 = is_P_2_triggered() [L477] COND FALSE !(\read(tmp___0)) [L256] int __retres1 ; [L259] COND FALSE !((int )C_1_pc == 1) [L269] COND FALSE !((int )C_1_pc == 2) [L279] __retres1 = 0 [L281] return (__retres1); [L483] tmp___1 = is_C_1_triggered() [L485] COND FALSE !(\read(tmp___1)) [L539] COND TRUE 1 [L542] kernel_st = 1 [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; [L344] int tmp___2 ; Loop: [L348] COND TRUE 1 [L316] int __retres1 ; [L319] COND TRUE (int )P_1_st == 0 [L320] __retres1 = 1 [L337] return (__retres1); [L351] tmp___2 = exists_runnable_thread() [L353] COND TRUE \read(tmp___2) [L358] COND TRUE (int )P_1_st == 0 [L360] tmp = __VERIFIER_nondet_int() [L362] COND FALSE !(\read(tmp)) [L373] COND TRUE (int )P_2_st == 0 [L375] tmp___0 = __VERIFIER_nondet_int() [L377] COND FALSE !(\read(tmp___0)) [L388] COND TRUE (int )C_1_st == 0 [L390] tmp___1 = __VERIFIER_nondet_int() [L392] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...