./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:20:50,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:20:50,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:20:50,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:20:50,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:20:50,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:20:50,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:20:50,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:20:50,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:20:50,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:20:50,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:20:50,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:20:50,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:20:50,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:20:50,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:20:50,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:20:50,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:20:50,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:20:50,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:20:50,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:20:50,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:20:50,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:20:50,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:20:50,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:20:50,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:20:50,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:20:50,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:20:50,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:20:50,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:20:50,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:20:50,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:20:50,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:20:50,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:20:50,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:20:50,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:20:50,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:20:50,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:20:50,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:20:50,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:20:50,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:20:50,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:20:50,281 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-09 09:20:50,305 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:20:50,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:20:50,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:20:50,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:20:50,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:20:50,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:20:50,314 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:20:50,314 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-09 09:20:50,314 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-09 09:20:50,315 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-09 09:20:50,315 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-09 09:20:50,315 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-09 09:20:50,315 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-09 09:20:50,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:20:50,316 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:20:50,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 09:20:50,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:20:50,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:20:50,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:20:50,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-09 09:20:50,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-09 09:20:50,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-09 09:20:50,318 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:20:50,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:20:50,318 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-09 09:20:50,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:20:50,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-09 09:20:50,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:20:50,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:20:50,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:20:50,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:20:50,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:20:50,322 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-09 09:20:50,323 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_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/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_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2021-11-09 09:20:50,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:20:50,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:20:50,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:20:50,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:20:50,589 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:20:50,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/systemc/kundu1.cil.c [2021-11-09 09:20:50,647 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/data/7aa5f3e2e/e897104c85164cb38247c7a8bc2e6505/FLAGbd2eb6f04 [2021-11-09 09:20:51,133 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:20:51,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/sv-benchmarks/c/systemc/kundu1.cil.c [2021-11-09 09:20:51,162 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/data/7aa5f3e2e/e897104c85164cb38247c7a8bc2e6505/FLAGbd2eb6f04 [2021-11-09 09:20:51,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/data/7aa5f3e2e/e897104c85164cb38247c7a8bc2e6505 [2021-11-09 09:20:51,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:20:51,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:20:51,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:20:51,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:20:51,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:20:51,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f97f523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51, skipping insertion in model container [2021-11-09 09:20:51,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:20:51,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:20:51,694 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2021-11-09 09:20:51,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:20:51,763 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:20:51,773 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2021-11-09 09:20:51,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:20:51,832 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:20:51,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51 WrapperNode [2021-11-09 09:20:51,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:20:51,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:20:51,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:20:51,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:20:51,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:20:51,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:20:51,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:20:51,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:20:51,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:51,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:52,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:20:52,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:20:52,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:20:52,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:20:52,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (1/1) ... [2021-11-09 09:20:52,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:20:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:20:52,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:20:52,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-09 09:20:52,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:20:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:20:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:20:52,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:20:52,652 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:20:52,652 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2021-11-09 09:20:52,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:20:52 BoogieIcfgContainer [2021-11-09 09:20:52,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:20:52,655 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-09 09:20:52,656 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-09 09:20:52,659 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-09 09:20:52,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:20:52,660 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 09:20:51" (1/3) ... [2021-11-09 09:20:52,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d3df12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:20:52, skipping insertion in model container [2021-11-09 09:20:52,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:20:52,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:20:51" (2/3) ... [2021-11-09 09:20:52,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d3df12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:20:52, skipping insertion in model container [2021-11-09 09:20:52,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:20:52,668 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:20:52" (3/3) ... [2021-11-09 09:20:52,669 INFO L389 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2021-11-09 09:20:52,708 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-09 09:20:52,708 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-09 09:20:52,709 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-09 09:20:52,709 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-09 09:20:52,709 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-09 09:20:52,709 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-09 09:20:52,709 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-09 09:20:52,709 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-09 09:20:52,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:52,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-11-09 09:20:52,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:52,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:52,761 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:52,761 INFO L843 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] [2021-11-09 09:20:52,762 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-09 09:20:52,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:52,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-11-09 09:20:52,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:52,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:52,772 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:52,772 INFO L843 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] [2021-11-09 09:20:52,779 INFO L791 eck$LassoCheckResult]: Stem: 105#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;~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; 41#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 72#L496true havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 111#L229true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 112#L236-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 110#L241-1true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 7#L117true assume 1 == ~P_1_pc~0; 81#L118true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 54#L128true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 99#L129true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 51#L383true assume !(0 != activate_threads_~tmp~1); 24#L383-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 50#L199true assume 1 == ~C_1_pc~0; 91#L200true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 63#L220true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 74#L221true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 73#L391true assume !(0 != activate_threads_~tmp___1~1); 44#L445-1true [2021-11-09 09:20:52,780 INFO L793 eck$LassoCheckResult]: Loop: 44#L445-1true assume !false; 94#L446true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 86#L304true assume false; 71#L320true start_simulation_~kernel_st~0 := 2; 60#L229-1true start_simulation_~kernel_st~0 := 3; 13#L331true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 5#L117-3true assume !(1 == ~P_1_pc~0); 70#L117-5true is_P_1_triggered_~__retres1~0 := 0; 76#L128-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 45#L129-1true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 35#L383-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17#L383-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 108#L199-3true assume 1 == ~C_1_pc~0; 21#L200-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 97#L220-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 57#L221-1true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 116#L391-3true assume !(0 != activate_threads_~tmp___1~1); 37#L391-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 12#L254-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 40#L267-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 66#L268-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 95#L464true assume !(0 == start_simulation_~tmp~3); 33#L464-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 27#L254-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 77#L267-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 88#L268-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 6#L419true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 101#L426true stop_simulation_#res := stop_simulation_~__retres2~0; 79#L427true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 28#L477true assume !(0 != start_simulation_~tmp___0~2); 44#L445-1true [2021-11-09 09:20:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2021-11-09 09:20:52,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:52,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034622358] [2021-11-09 09:20:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:52,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034622358] [2021-11-09 09:20:53,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034622358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:20:53,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218711701] [2021-11-09 09:20:53,044 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:20:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1489064257, now seen corresponding path program 1 times [2021-11-09 09:20:53,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661058209] [2021-11-09 09:20:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661058209] [2021-11-09 09:20:53,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661058209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:20:53,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994985860] [2021-11-09 09:20:53,080 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:53,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:20:53,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:20:53,105 INFO L87 Difference]: Start difference. First operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:53,141 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-11-09 09:20:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:20:53,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2021-11-09 09:20:53,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-11-09 09:20:53,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2021-11-09 09:20:53,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-11-09 09:20:53,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-11-09 09:20:53,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2021-11-09 09:20:53,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:53,170 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-11-09 09:20:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2021-11-09 09:20:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-11-09 09:20:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.471698113207547) internal successors, (156), 105 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2021-11-09 09:20:53,222 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-11-09 09:20:53,222 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-11-09 09:20:53,222 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-09 09:20:53,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2021-11-09 09:20:53,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-11-09 09:20:53,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:53,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:53,231 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:53,231 INFO L843 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] [2021-11-09 09:20:53,231 INFO L791 eck$LassoCheckResult]: Stem: 339#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;~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; 297#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 298#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 329#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 341#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 340#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 244#L117 assume 1 == ~P_1_pc~0; 245#L118 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 273#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 317#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 313#L383 assume !(0 != activate_threads_~tmp~1); 274#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 275#L199 assume 1 == ~C_1_pc~0; 312#L200 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 253#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 326#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 330#L391 assume !(0 != activate_threads_~tmp___1~1); 283#L445-1 [2021-11-09 09:20:53,232 INFO L793 eck$LassoCheckResult]: Loop: 283#L445-1 assume !false; 302#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 248#L304 assume !false; 334#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 316#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 276#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 271#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 272#L284 assume !(0 != eval_~tmp___2~0); 325#L320 start_simulation_~kernel_st~0 := 2; 323#L229-1 start_simulation_~kernel_st~0 := 3; 258#L331 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 239#L117-3 assume !(1 == ~P_1_pc~0); 240#L117-5 is_P_1_triggered_~__retres1~0 := 0; 318#L128-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 303#L129-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 290#L383-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 263#L383-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 264#L199-3 assume 1 == ~C_1_pc~0; 268#L200-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 269#L220-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 319#L221-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 320#L391-3 assume !(0 != activate_threads_~tmp___1~1); 291#L391-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 255#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 256#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 296#L268-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 327#L464 assume !(0 == start_simulation_~tmp~3); 289#L464-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 279#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 280#L267-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L268-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 242#L419 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 243#L426 stop_simulation_#res := stop_simulation_~__retres2~0; 332#L427 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 282#L477 assume !(0 != start_simulation_~tmp___0~2); 283#L445-1 [2021-11-09 09:20:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2021-11-09 09:20:53,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090695115] [2021-11-09 09:20:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090695115] [2021-11-09 09:20:53,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090695115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:20:53,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406575107] [2021-11-09 09:20:53,319 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:20:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2021-11-09 09:20:53,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204132845] [2021-11-09 09:20:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204132845] [2021-11-09 09:20:53,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204132845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:20:53,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106192445] [2021-11-09 09:20:53,432 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:53,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:20:53,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:20:53,433 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:53,500 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-11-09 09:20:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:20:53,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 270 transitions. [2021-11-09 09:20:53,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2021-11-09 09:20:53,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 270 transitions. [2021-11-09 09:20:53,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-11-09 09:20:53,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2021-11-09 09:20:53,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 270 transitions. [2021-11-09 09:20:53,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:53,519 INFO L681 BuchiCegarLoop]: Abstraction has 187 states and 270 transitions. [2021-11-09 09:20:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 270 transitions. [2021-11-09 09:20:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2021-11-09 09:20:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.4480874316939891) internal successors, (265), 182 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2021-11-09 09:20:53,531 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-11-09 09:20:53,531 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-11-09 09:20:53,531 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-09 09:20:53,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2021-11-09 09:20:53,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 163 [2021-11-09 09:20:53,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:53,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:53,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:53,535 INFO L843 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] [2021-11-09 09:20:53,535 INFO L791 eck$LassoCheckResult]: Stem: 649#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;~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; 597#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 598#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 635#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 651#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 650#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 545#L117 assume !(1 == ~P_1_pc~0); 546#L117-2 is_P_1_triggered_~__retres1~0 := 0; 573#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 618#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 614#L383 assume !(0 != activate_threads_~tmp~1); 574#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 575#L199 assume 1 == ~C_1_pc~0; 613#L200 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 553#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 632#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 636#L391 assume !(0 != activate_threads_~tmp___1~1); 637#L445-1 [2021-11-09 09:20:53,535 INFO L793 eck$LassoCheckResult]: Loop: 637#L445-1 assume !false; 670#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 664#L304 assume !false; 663#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 661#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 576#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 571#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 572#L284 assume !(0 != eval_~tmp___2~0); 631#L320 start_simulation_~kernel_st~0 := 2; 630#L229-1 start_simulation_~kernel_st~0 := 3; 558#L331 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 541#L117-3 assume !(1 == ~P_1_pc~0); 542#L117-5 is_P_1_triggered_~__retres1~0 := 0; 719#L128-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 718#L129-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 717#L383-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 716#L383-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 715#L199-3 assume 1 == ~C_1_pc~0; 713#L200-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 710#L220-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 627#L221-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 628#L391-3 assume !(0 != activate_threads_~tmp___1~1); 592#L391-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 555#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 556#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 595#L268-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 633#L464 assume !(0 == start_simulation_~tmp~3); 590#L464-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 579#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 580#L267-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 638#L268-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 644#L419 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 693#L426 stop_simulation_#res := stop_simulation_~__retres2~0; 692#L427 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 689#L477 assume !(0 != start_simulation_~tmp___0~2); 637#L445-1 [2021-11-09 09:20:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2021-11-09 09:20:53,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518195015] [2021-11-09 09:20:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518195015] [2021-11-09 09:20:53,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518195015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:20:53,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770730747] [2021-11-09 09:20:53,600 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:20:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 2 times [2021-11-09 09:20:53,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140780437] [2021-11-09 09:20:53,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:53,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:53,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140780437] [2021-11-09 09:20:53,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140780437] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:53,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:53,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:20:53,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420593777] [2021-11-09 09:20:53,670 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:53,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:20:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:20:53,671 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. cyclomatic complexity: 83 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:53,817 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2021-11-09 09:20:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:20:53,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 574 transitions. [2021-11-09 09:20:53,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 378 [2021-11-09 09:20:53,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 574 transitions. [2021-11-09 09:20:53,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2021-11-09 09:20:53,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2021-11-09 09:20:53,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 574 transitions. [2021-11-09 09:20:53,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:53,836 INFO L681 BuchiCegarLoop]: Abstraction has 409 states and 574 transitions. [2021-11-09 09:20:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 574 transitions. [2021-11-09 09:20:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 315. [2021-11-09 09:20:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 314 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 448 transitions. [2021-11-09 09:20:53,875 INFO L704 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-11-09 09:20:53,875 INFO L587 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-11-09 09:20:53,875 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-09 09:20:53,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 448 transitions. [2021-11-09 09:20:53,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2021-11-09 09:20:53,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:53,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:53,886 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:53,886 INFO L843 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] [2021-11-09 09:20:53,886 INFO L791 eck$LassoCheckResult]: Stem: 1256#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;~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; 1205#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1206#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 1241#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1258#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1257#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1150#L117 assume !(1 == ~P_1_pc~0); 1151#L117-2 is_P_1_triggered_~__retres1~0 := 0; 1180#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1224#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1220#L383 assume !(0 != activate_threads_~tmp~1); 1181#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1182#L199 assume !(1 == ~C_1_pc~0); 1219#L199-2 assume !(2 == ~C_1_pc~0); 1162#L209-1 is_C_1_triggered_~__retres1~1 := 0; 1161#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1238#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1242#L391 assume !(0 != activate_threads_~tmp___1~1); 1190#L445-1 [2021-11-09 09:20:53,887 INFO L793 eck$LassoCheckResult]: Loop: 1190#L445-1 assume !false; 1210#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 1166#L304 assume !false; 1249#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1223#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1183#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1178#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1179#L284 assume !(0 != eval_~tmp___2~0); 1237#L320 start_simulation_~kernel_st~0 := 2; 1236#L229-1 start_simulation_~kernel_st~0 := 3; 1163#L331 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 1146#L117-3 assume !(1 == ~P_1_pc~0); 1147#L117-5 is_P_1_triggered_~__retres1~0 := 0; 1240#L128-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1211#L129-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1198#L383-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1169#L383-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1170#L199-3 assume !(1 == ~C_1_pc~0); 1255#L199-5 assume 2 == ~C_1_pc~0; 1191#L210-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 1192#L220-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1233#L221-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1234#L391-3 assume !(0 != activate_threads_~tmp___1~1); 1199#L391-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1157#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1158#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1202#L268-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1239#L464 assume !(0 == start_simulation_~tmp~3); 1196#L464-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1186#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1187#L267-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1246#L268-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1148#L419 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1149#L426 stop_simulation_#res := stop_simulation_~__retres2~0; 1247#L427 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1189#L477 assume !(0 != start_simulation_~tmp___0~2); 1190#L445-1 [2021-11-09 09:20:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2021-11-09 09:20:53,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007252102] [2021-11-09 09:20:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:53,917 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:53,976 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2030427419, now seen corresponding path program 1 times [2021-11-09 09:20:53,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:53,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974825488] [2021-11-09 09:20:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:53,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:54,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:54,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974825488] [2021-11-09 09:20:54,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974825488] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:54,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:54,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:20:54,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080844080] [2021-11-09 09:20:54,049 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:54,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:20:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:20:54,056 INFO L87 Difference]: Start difference. First operand 315 states and 448 transitions. cyclomatic complexity: 134 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:54,136 INFO L93 Difference]: Finished difference Result 549 states and 768 transitions. [2021-11-09 09:20:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:20:54,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 768 transitions. [2021-11-09 09:20:54,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 530 [2021-11-09 09:20:54,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 768 transitions. [2021-11-09 09:20:54,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 549 [2021-11-09 09:20:54,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 549 [2021-11-09 09:20:54,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 768 transitions. [2021-11-09 09:20:54,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:54,158 INFO L681 BuchiCegarLoop]: Abstraction has 549 states and 768 transitions. [2021-11-09 09:20:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 768 transitions. [2021-11-09 09:20:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 327. [2021-11-09 09:20:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 327 states have (on average 1.4067278287461773) internal successors, (460), 326 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2021-11-09 09:20:54,190 INFO L704 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-11-09 09:20:54,190 INFO L587 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-11-09 09:20:54,190 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-09 09:20:54,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 460 transitions. [2021-11-09 09:20:54,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2021-11-09 09:20:54,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:54,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:54,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,194 INFO L843 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] [2021-11-09 09:20:54,194 INFO L791 eck$LassoCheckResult]: Stem: 2155#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;~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; 2088#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 2089#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 2128#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2160#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2159#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2030#L117 assume !(1 == ~P_1_pc~0); 2031#L117-2 is_P_1_triggered_~__retres1~0 := 0; 2059#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2109#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2105#L383 assume !(0 != activate_threads_~tmp~1); 2060#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2061#L199 assume !(1 == ~C_1_pc~0); 2104#L199-2 assume !(2 == ~C_1_pc~0); 2039#L209-1 is_C_1_triggered_~__retres1~1 := 0; 2038#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2123#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2129#L391 assume !(0 != activate_threads_~tmp___1~1); 2130#L445-1 [2021-11-09 09:20:54,194 INFO L793 eck$LassoCheckResult]: Loop: 2130#L445-1 assume !false; 2267#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 2157#L304 assume !false; 2220#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2217#L254 assume !(0 == ~P_1_st~0); 2212#L258 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2208#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2187#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2188#L284 assume !(0 != eval_~tmp___2~0); 2127#L320 start_simulation_~kernel_st~0 := 2; 2120#L229-1 start_simulation_~kernel_st~0 := 3; 2121#L331 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 2026#L117-3 assume !(1 == ~P_1_pc~0); 2027#L117-5 is_P_1_triggered_~__retres1~0 := 0; 2126#L128-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2094#L129-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2080#L383-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2081#L383-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2299#L199-3 assume !(1 == ~C_1_pc~0); 2298#L199-5 assume !(2 == ~C_1_pc~0); 2295#L209-3 is_C_1_triggered_~__retres1~1 := 0; 2294#L220-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2293#L221-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2292#L391-3 assume !(0 != activate_threads_~tmp___1~1); 2291#L391-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2289#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2288#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2286#L268-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2285#L464 assume !(0 == start_simulation_~tmp~3); 2283#L464-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2281#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2280#L267-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2278#L268-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2276#L419 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2274#L426 stop_simulation_#res := stop_simulation_~__retres2~0; 2272#L427 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2270#L477 assume !(0 != start_simulation_~tmp___0~2); 2130#L445-1 [2021-11-09 09:20:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2021-11-09 09:20:54,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263498844] [2021-11-09 09:20:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,225 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,255 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2021-11-09 09:20:54,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845470224] [2021-11-09 09:20:54,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:54,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:54,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845470224] [2021-11-09 09:20:54,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845470224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:54,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:54,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:20:54,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80096458] [2021-11-09 09:20:54,358 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:54,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:54,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:20:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:20:54,359 INFO L87 Difference]: Start difference. First operand 327 states and 460 transitions. cyclomatic complexity: 134 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:54,437 INFO L93 Difference]: Finished difference Result 723 states and 1015 transitions. [2021-11-09 09:20:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:20:54,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 1015 transitions. [2021-11-09 09:20:54,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 704 [2021-11-09 09:20:54,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 723 states and 1015 transitions. [2021-11-09 09:20:54,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2021-11-09 09:20:54,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 723 [2021-11-09 09:20:54,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 723 states and 1015 transitions. [2021-11-09 09:20:54,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:54,454 INFO L681 BuchiCegarLoop]: Abstraction has 723 states and 1015 transitions. [2021-11-09 09:20:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states and 1015 transitions. [2021-11-09 09:20:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 339. [2021-11-09 09:20:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 339 states have (on average 1.3775811209439528) internal successors, (467), 338 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2021-11-09 09:20:54,464 INFO L704 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-11-09 09:20:54,464 INFO L587 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-11-09 09:20:54,464 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-09 09:20:54,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 467 transitions. [2021-11-09 09:20:54,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2021-11-09 09:20:54,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:54,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:54,468 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,468 INFO L843 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] [2021-11-09 09:20:54,468 INFO L791 eck$LassoCheckResult]: Stem: 3212#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;~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; 3151#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3152#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 3190#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3217#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3216#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3093#L117 assume !(1 == ~P_1_pc~0); 3094#L117-2 is_P_1_triggered_~__retres1~0 := 0; 3123#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3173#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3169#L383 assume !(0 != activate_threads_~tmp~1); 3124#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3125#L199 assume !(1 == ~C_1_pc~0); 3168#L199-2 assume !(2 == ~C_1_pc~0); 3102#L209-1 is_C_1_triggered_~__retres1~1 := 0; 3101#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3185#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3191#L391 assume !(0 != activate_threads_~tmp___1~1); 3192#L445-1 [2021-11-09 09:20:54,470 INFO L793 eck$LassoCheckResult]: Loop: 3192#L445-1 assume !false; 3301#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 3295#L304 assume !false; 3292#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3289#L254 assume !(0 == ~P_1_st~0); 3284#L258 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3281#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3278#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 3269#L284 assume !(0 != eval_~tmp___2~0); 3267#L320 start_simulation_~kernel_st~0 := 2; 3265#L229-1 start_simulation_~kernel_st~0 := 3; 3259#L331 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3089#L117-3 assume !(1 == ~P_1_pc~0); 3090#L117-5 is_P_1_triggered_~__retres1~0 := 0; 3264#L128-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3263#L129-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3262#L383-3 assume !(0 != activate_threads_~tmp~1); 3261#L383-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3260#L199-3 assume !(1 == ~C_1_pc~0); 3252#L199-5 assume 2 == ~C_1_pc~0; 3246#L210-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 3244#L220-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3245#L221-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3240#L391-3 assume !(0 != activate_threads_~tmp___1~1); 3241#L391-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3235#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3236#L267-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3231#L268-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3232#L464 assume !(0 == start_simulation_~tmp~3); 3312#L464-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3310#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3309#L267-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3308#L268-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 3307#L419 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3306#L426 stop_simulation_#res := stop_simulation_~__retres2~0; 3305#L427 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 3304#L477 assume !(0 != start_simulation_~tmp___0~2); 3192#L445-1 [2021-11-09 09:20:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2021-11-09 09:20:54,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167104734] [2021-11-09 09:20:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,493 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1127181323, now seen corresponding path program 1 times [2021-11-09 09:20:54,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574074706] [2021-11-09 09:20:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:54,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:54,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574074706] [2021-11-09 09:20:54,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574074706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:54,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:54,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:20:54,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932652250] [2021-11-09 09:20:54,551 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:20:54,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:54,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:20:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:20:54,552 INFO L87 Difference]: Start difference. First operand 339 states and 467 transitions. cyclomatic complexity: 129 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:54,580 INFO L93 Difference]: Finished difference Result 493 states and 667 transitions. [2021-11-09 09:20:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:20:54,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 667 transitions. [2021-11-09 09:20:54,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-11-09 09:20:54,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 493 states and 667 transitions. [2021-11-09 09:20:54,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2021-11-09 09:20:54,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2021-11-09 09:20:54,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 667 transitions. [2021-11-09 09:20:54,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:54,591 INFO L681 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-11-09 09:20:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 667 transitions. [2021-11-09 09:20:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-11-09 09:20:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 493 states have (on average 1.3529411764705883) internal successors, (667), 492 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2021-11-09 09:20:54,603 INFO L704 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-11-09 09:20:54,603 INFO L587 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-11-09 09:20:54,603 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-09 09:20:54,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 667 transitions. [2021-11-09 09:20:54,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-11-09 09:20:54,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:54,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:54,607 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,607 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,608 INFO L791 eck$LassoCheckResult]: Stem: 4047#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;~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; 3987#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3988#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 4026#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 4049#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4048#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 3931#L117 assume !(1 == ~P_1_pc~0); 3932#L117-2 is_P_1_triggered_~__retres1~0 := 0; 3962#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4005#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4001#L383 assume !(0 != activate_threads_~tmp~1); 3963#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3964#L199 assume !(1 == ~C_1_pc~0); 4000#L199-2 assume !(2 == ~C_1_pc~0); 3940#L209-1 is_C_1_triggered_~__retres1~1 := 0; 3939#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4020#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 4027#L391 assume !(0 != activate_threads_~tmp___1~1); 4028#L445-1 assume !false; 4330#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 4325#L304 [2021-11-09 09:20:54,608 INFO L793 eck$LassoCheckResult]: Loop: 4325#L304 assume !false; 4321#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4320#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4319#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4317#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 4315#L284 assume 0 != eval_~tmp___2~0; 4314#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4045#L293 assume !(0 != eval_~tmp~0); 4046#L289 assume !(0 == ~C_1_st~0); 4325#L304 [2021-11-09 09:20:54,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2021-11-09 09:20:54,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322913522] [2021-11-09 09:20:54,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,625 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2021-11-09 09:20:54,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328978152] [2021-11-09 09:20:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,643 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,648 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2021-11-09 09:20:54,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957145054] [2021-11-09 09:20:54,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:54,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:54,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957145054] [2021-11-09 09:20:54,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957145054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:54,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:54,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:20:54,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570139404] [2021-11-09 09:20:54,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:20:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:20:54,731 INFO L87 Difference]: Start difference. First operand 493 states and 667 transitions. cyclomatic complexity: 177 Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:54,763 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2021-11-09 09:20:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:20:54,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 801 states and 1061 transitions. [2021-11-09 09:20:54,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-11-09 09:20:54,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 801 states to 801 states and 1061 transitions. [2021-11-09 09:20:54,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2021-11-09 09:20:54,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2021-11-09 09:20:54,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 801 states and 1061 transitions. [2021-11-09 09:20:54,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:54,780 INFO L681 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-11-09 09:20:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states and 1061 transitions. [2021-11-09 09:20:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2021-11-09 09:20:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 801 states have (on average 1.3245942571785267) internal successors, (1061), 800 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1061 transitions. [2021-11-09 09:20:54,798 INFO L704 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-11-09 09:20:54,798 INFO L587 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-11-09 09:20:54,798 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-09 09:20:54,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1061 transitions. [2021-11-09 09:20:54,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-11-09 09:20:54,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:54,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:54,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,804 INFO L791 eck$LassoCheckResult]: Stem: 5349#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;~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; 5288#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5289#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 5329#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5357#L236-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5356#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 5233#L117 assume !(1 == ~P_1_pc~0); 5234#L117-2 is_P_1_triggered_~__retres1~0 := 0; 5262#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5308#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5304#L383 assume !(0 != activate_threads_~tmp~1); 5263#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5264#L199 assume !(1 == ~C_1_pc~0); 5676#L199-2 assume !(2 == ~C_1_pc~0); 5670#L209-1 is_C_1_triggered_~__retres1~1 := 0; 5322#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5323#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5332#L391 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5331#L445-1 assume !false; 5639#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 5616#L304 [2021-11-09 09:20:54,804 INFO L793 eck$LassoCheckResult]: Loop: 5616#L304 assume !false; 5636#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5633#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5629#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5627#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 5625#L284 assume 0 != eval_~tmp___2~0; 5621#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5618#L293 assume !(0 != eval_~tmp~0); 5617#L289 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 5453#L308 assume !(0 != eval_~tmp___1~0); 5616#L304 [2021-11-09 09:20:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2021-11-09 09:20:54,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84193572] [2021-11-09 09:20:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:20:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:20:54,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:20:54,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84193572] [2021-11-09 09:20:54,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84193572] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:20:54,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:20:54,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:20:54,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370011815] [2021-11-09 09:20:54,825 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:20:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2021-11-09 09:20:54,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755325051] [2021-11-09 09:20:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,829 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,834 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:54,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:20:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:20:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:20:54,914 INFO L87 Difference]: Start difference. First operand 801 states and 1061 transitions. cyclomatic complexity: 263 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:20:54,923 INFO L93 Difference]: Finished difference Result 785 states and 1041 transitions. [2021-11-09 09:20:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:20:54,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1041 transitions. [2021-11-09 09:20:54,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-11-09 09:20:54,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1041 transitions. [2021-11-09 09:20:54,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2021-11-09 09:20:54,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 785 [2021-11-09 09:20:54,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1041 transitions. [2021-11-09 09:20:54,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:20:54,940 INFO L681 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-11-09 09:20:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1041 transitions. [2021-11-09 09:20:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2021-11-09 09:20:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 785 states have (on average 1.3261146496815286) internal successors, (1041), 784 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:20:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1041 transitions. [2021-11-09 09:20:54,960 INFO L704 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-11-09 09:20:54,960 INFO L587 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-11-09 09:20:54,960 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-09 09:20:54,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 785 states and 1041 transitions. [2021-11-09 09:20:54,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-11-09 09:20:54,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:20:54,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:20:54,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:20:54,967 INFO L791 eck$LassoCheckResult]: Stem: 6946#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;~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; 6885#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 6886#L496 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, 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; 6924#L229 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6952#L236-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6951#L241-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, 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; 6825#L117 assume !(1 == ~P_1_pc~0); 6826#L117-2 is_P_1_triggered_~__retres1~0 := 0; 6858#L128 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6907#L129 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6902#L383 assume !(0 != activate_threads_~tmp~1); 6859#L383-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6860#L199 assume !(1 == ~C_1_pc~0); 6899#L199-2 assume !(2 == ~C_1_pc~0); 6836#L209-1 is_C_1_triggered_~__retres1~1 := 0; 6835#L220 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6918#L221 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6925#L391 assume !(0 != activate_threads_~tmp___1~1); 6926#L445-1 assume !false; 7164#L446 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, 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; 7085#L304 [2021-11-09 09:20:54,967 INFO L793 eck$LassoCheckResult]: Loop: 7085#L304 assume !false; 7156#L280 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7153#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7150#L267 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7148#L268 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 7145#L284 assume 0 != eval_~tmp___2~0; 7143#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 7141#L293 assume !(0 != eval_~tmp~0); 7088#L289 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 7084#L308 assume !(0 != eval_~tmp___1~0); 7085#L304 [2021-11-09 09:20:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2021-11-09 09:20:54,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:54,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827943783] [2021-11-09 09:20:54,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:54,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:54,984 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:55,009 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2021-11-09 09:20:55,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:55,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373966617] [2021-11-09 09:20:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:55,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:55,019 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:55,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:55,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:20:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2021-11-09 09:20:55,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:20:55,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523138055] [2021-11-09 09:20:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:20:55,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:20:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:55,036 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:20:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:20:55,054 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:20:56,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 09:20:56 BoogieIcfgContainer [2021-11-09 09:20:56,181 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-09 09:20:56,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:20:56,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:20:56,182 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:20:56,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:20:52" (3/4) ... [2021-11-09 09:20:56,184 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-09 09:20:56,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:20:56,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:20:56,233 INFO L168 Benchmark]: Toolchain (without parser) took 4744.42 ms. Allocated memory was 102.8 MB in the beginning and 148.9 MB in the end (delta: 46.1 MB). Free memory was 72.9 MB in the beginning and 65.3 MB in the end (delta: 7.6 MB). Peak memory consumption was 54.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,233 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 102.8 MB. Free memory is still 58.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:20:56,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.00 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 72.7 MB in the beginning and 96.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.63 ms. Allocated memory is still 123.7 MB. Free memory was 96.4 MB in the beginning and 93.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,234 INFO L168 Benchmark]: Boogie Preprocessor took 63.05 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 92.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:20:56,235 INFO L168 Benchmark]: RCFGBuilder took 653.72 ms. Allocated memory is still 123.7 MB. Free memory was 91.8 MB in the beginning and 75.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,235 INFO L168 Benchmark]: BuchiAutomizer took 3525.30 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 75.0 MB in the beginning and 68.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 42.6 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,236 INFO L168 Benchmark]: Witness Printer took 50.09 ms. Allocated memory is still 148.9 MB. Free memory was 68.5 MB in the beginning and 65.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:20:56,238 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.24 ms. Allocated memory is still 102.8 MB. Free memory is still 58.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 344.00 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 72.7 MB in the beginning and 96.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.63 ms. Allocated memory is still 123.7 MB. Free memory was 96.4 MB in the beginning and 93.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.05 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 92.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 653.72 ms. Allocated memory is still 123.7 MB. Free memory was 91.8 MB in the beginning and 75.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3525.30 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 75.0 MB in the beginning and 68.5 MB in the end (delta: 6.5 MB). Peak memory consumption was 42.6 MB. Max. memory is 16.1 GB. * Witness Printer took 50.09 ms. Allocated memory is still 148.9 MB. Free memory was 68.5 MB in the beginning and 65.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 785 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 704 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 801 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1213 SDtfs, 1658 SDslu, 1640 SDs, 0 SdLazy, 174 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 279]: 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@7bba659f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a4014ab=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c8de7f3=0, __retres1=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cce978b=0, NULL=3, \result=0, __retres1=0, tmp___0=0, tmp___1=0, data_1=0, __retres1=1, max_loop=2, NULL=5, NULL=0, tmp=0, NULL=4, C_1_pr=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e55ceed=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31d5490b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d94855d=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 279]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L493] P_1_i = 1 [L494] C_1_i = 1 [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L114] int __retres1 ; [L117] COND FALSE !((int )P_1_pc == 1) [L127] __retres1 = 0 [L129] return (__retres1); [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L196] int __retres1 ; [L199] COND FALSE !((int )C_1_pc == 1) [L209] COND FALSE !((int )C_1_pc == 2) [L219] __retres1 = 0 [L221] return (__retres1); [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L445] COND TRUE 1 [L448] kernel_st = 1 [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; Loop: [L279] COND TRUE 1 [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-09 09:20:56,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1dacf6d1-3c20-4062-a51a-95f3773186f1/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)