./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 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 296e273b1c19d017b7d3722a7c74d29ba546c812 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:17:59,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:17:59,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:17:59,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:17:59,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:17:59,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:17:59,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:17:59,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:17:59,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:17:59,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:17:59,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:17:59,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:17:59,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:17:59,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:17:59,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:17:59,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:17:59,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:17:59,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:17:59,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:17:59,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:17:59,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:17:59,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:17:59,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:17:59,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:17:59,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:17:59,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:17:59,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:17:59,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:17:59,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:17:59,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:17:59,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:17:59,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:17:59,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:17:59,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:17:59,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:17:59,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:17:59,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:17:59,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:17:59,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:17:59,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:17:59,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:17:59,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:17:59,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:17:59,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:17:59,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:17:59,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:17:59,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:17:59,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:17:59,479 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:17:59,479 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:17:59,479 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:17:59,480 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:17:59,480 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:17:59,480 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:17:59,480 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:17:59,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:17:59,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:17:59,482 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:17:59,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:17:59,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:17:59,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:17:59,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:17:59,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:17:59,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:17:59,485 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:17:59,485 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2021-08-31 04:17:59,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:17:59,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:17:59,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:17:59,852 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:17:59,853 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:17:59,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2021-08-31 04:17:59,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b290a0c37/adb20e18c38a47029ccff9474ca78546/FLAG4fe0cf26c [2021-08-31 04:18:00,360 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:18:00,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2021-08-31 04:18:00,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b290a0c37/adb20e18c38a47029ccff9474ca78546/FLAG4fe0cf26c [2021-08-31 04:18:00,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b290a0c37/adb20e18c38a47029ccff9474ca78546 [2021-08-31 04:18:00,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:18:00,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:18:00,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:00,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:18:00,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:18:00,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:00" (1/1) ... [2021-08-31 04:18:00,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d557b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:00, skipping insertion in model container [2021-08-31 04:18:00,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:00" (1/1) ... [2021-08-31 04:18:00,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:18:00,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:18:00,905 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2021-08-31 04:18:00,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:00,968 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:18:00,999 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2021-08-31 04:18:01,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:01,050 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:18:01,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01 WrapperNode [2021-08-31 04:18:01,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:01,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:01,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:18:01,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:18:01,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:01,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:18:01,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:18:01,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:18:01,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:18:01,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:18:01,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:18:01,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:18:01,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:01,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:18:01,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 04:18:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:18:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:18:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:18:01,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:18:01,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:18:01,528 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2021-08-31 04:18:01,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:01 BoogieIcfgContainer [2021-08-31 04:18:01,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:18:01,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:18:01,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:18:01,534 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:18:01,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:01,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:18:00" (1/3) ... [2021-08-31 04:18:01,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765496e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:01, skipping insertion in model container [2021-08-31 04:18:01,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:01,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01" (2/3) ... [2021-08-31 04:18:01,540 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@765496e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:01, skipping insertion in model container [2021-08-31 04:18:01,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:01,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:01" (3/3) ... [2021-08-31 04:18:01,542 INFO L389 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2021-08-31 04:18:01,591 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:18:01,592 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:18:01,592 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:18:01,592 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:18:01,592 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:18:01,592 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:18:01,592 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:18:01,592 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:18:01,611 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-08-31 04:18:01,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-31 04:18:01,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:01,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:01,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:01,653 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-08-31 04:18:01,653 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:18:01,654 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-08-31 04:18:01,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-31 04:18:01,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:01,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:01,670 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:01,670 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-08-31 04:18:01,680 INFO L791 eck$LassoCheckResult]: Stem: 106#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; 33#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; 56#L488true 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; 76#L221true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 48#L228-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 54#L233-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; 101#L109true assume 1 == ~P_1_pc~0; 59#L110true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 40#L120true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 24#L121true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 13#L375true assume !(0 != activate_threads_~tmp~1); 34#L375-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 72#L191true assume 1 == ~C_1_pc~0; 88#L192true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 67#L212true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 112#L213true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 45#L383true assume !(0 != activate_threads_~tmp___1~1); 28#L437-1true [2021-08-31 04:18:01,681 INFO L793 eck$LassoCheckResult]: Loop: 28#L437-1true assume !false; 84#L438true 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; 47#L296true assume false; 114#L312true start_simulation_~kernel_st~0 := 2; 51#L221-1true start_simulation_~kernel_st~0 := 3; 7#L323true 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; 4#L109-3true assume 1 == ~P_1_pc~0; 19#L110-1true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 41#L120-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 96#L121-1true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 107#L375-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 37#L375-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 22#L191-3true assume 1 == ~C_1_pc~0; 115#L192-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 92#L212-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 105#L213-1true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 30#L383-3true assume !(0 != activate_threads_~tmp___1~1); 14#L383-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 20#L246-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 52#L259-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 73#L260-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 99#L456true assume !(0 == start_simulation_~tmp~3); 85#L456-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; 16#L246-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 103#L259-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 86#L260-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 49#L411true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17#L418true stop_simulation_#res := stop_simulation_~__retres2~0; 8#L419true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 12#L469true assume !(0 != start_simulation_~tmp___0~2); 28#L437-1true [2021-08-31 04:18:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2021-08-31 04:18:01,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:01,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566489068] [2021-08-31 04:18:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:01,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:01,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:01,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566489068] [2021-08-31 04:18:01,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566489068] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:01,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:01,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:01,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494234155] [2021-08-31 04:18:01,913 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 101330720, now seen corresponding path program 1 times [2021-08-31 04:18:01,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:01,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631994256] [2021-08-31 04:18:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:01,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:01,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:01,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631994256] [2021-08-31 04:18:01,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631994256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:01,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:01,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:01,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656320241] [2021-08-31 04:18:01,943 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:01,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:01,971 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-08-31 04:18:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:02,225 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-08-31 04:18:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:02,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2021-08-31 04:18:02,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-08-31 04:18:02,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2021-08-31 04:18:02,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-08-31 04:18:02,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-08-31 04:18:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2021-08-31 04:18:02,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:02,250 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-31 04:18:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2021-08-31 04:18:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-31 04:18:02,284 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-08-31 04:18:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2021-08-31 04:18:02,288 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-31 04:18:02,288 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-31 04:18:02,288 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:18:02,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2021-08-31 04:18:02,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-08-31 04:18:02,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:02,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:02,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:02,298 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-08-31 04:18:02,298 INFO L791 eck$LassoCheckResult]: Stem: 341#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; 287#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; 288#L488 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; 316#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 305#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 306#L233-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; 314#L109 assume 1 == ~P_1_pc~0; 318#L110 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 297#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 276#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 253#L375 assume !(0 != activate_threads_~tmp~1); 254#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 289#L191 assume 1 == ~C_1_pc~0; 332#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 329#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 330#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 302#L383 assume !(0 != activate_threads_~tmp___1~1); 252#L437-1 [2021-08-31 04:18:02,298 INFO L793 eck$LassoCheckResult]: Loop: 252#L437-1 assume !false; 281#L438 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; 259#L296 assume !false; 295#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 296#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 312#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 315#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 241#L276 assume !(0 != eval_~tmp___2~0); 243#L312 start_simulation_~kernel_st~0 := 2; 310#L221-1 start_simulation_~kernel_st~0 := 3; 244#L323 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; 236#L109-3 assume !(1 == ~P_1_pc~0); 237#L109-5 is_P_1_triggered_~__retres1~0 := 0; 249#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 298#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 338#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 294#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 273#L191-3 assume 1 == ~C_1_pc~0; 274#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 301#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 337#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 284#L383-3 assume !(0 != activate_threads_~tmp___1~1); 255#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 256#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 267#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 311#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 333#L456 assume !(0 == start_simulation_~tmp~3); 334#L456-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; 260#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 261#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 336#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 307#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 263#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 245#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 246#L469 assume !(0 != start_simulation_~tmp___0~2); 252#L437-1 [2021-08-31 04:18:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,299 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2021-08-31 04:18:02,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966225744] [2021-08-31 04:18:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:02,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966225744] [2021-08-31 04:18:02,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966225744] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:02,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356442259] [2021-08-31 04:18:02,352 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2021-08-31 04:18:02,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626922064] [2021-08-31 04:18:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:02,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626922064] [2021-08-31 04:18:02,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626922064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:02,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429591487] [2021-08-31 04:18:02,397 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:02,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:02,398 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-08-31 04:18:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:02,754 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-08-31 04:18:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:02,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 270 transitions. [2021-08-31 04:18:02,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2021-08-31 04:18:02,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 270 transitions. [2021-08-31 04:18:02,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-08-31 04:18:02,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2021-08-31 04:18:02,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 270 transitions. [2021-08-31 04:18:02,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:02,768 INFO L681 BuchiCegarLoop]: Abstraction has 187 states and 270 transitions. [2021-08-31 04:18:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 270 transitions. [2021-08-31 04:18:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2021-08-31 04:18:02,781 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-08-31 04:18:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2021-08-31 04:18:02,782 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-08-31 04:18:02,782 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-08-31 04:18:02,782 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:18:02,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2021-08-31 04:18:02,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 163 [2021-08-31 04:18:02,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:02,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:02,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:02,786 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-08-31 04:18:02,786 INFO L791 eck$LassoCheckResult]: Stem: 653#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; 592#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; 593#L488 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; 623#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 612#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 613#L233-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; 621#L109 assume !(1 == ~P_1_pc~0); 650#L109-2 is_P_1_triggered_~__retres1~0 := 0; 602#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 580#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 554#L375 assume !(0 != activate_threads_~tmp~1); 555#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 598#L191 assume 1 == ~C_1_pc~0; 640#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 635#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 636#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 607#L383 assume !(0 != activate_threads_~tmp___1~1); 553#L437-1 [2021-08-31 04:18:02,787 INFO L793 eck$LassoCheckResult]: Loop: 553#L437-1 assume !false; 585#L438 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; 560#L296 assume !false; 668#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 666#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 665#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 622#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 542#L276 assume !(0 != eval_~tmp___2~0); 544#L312 start_simulation_~kernel_st~0 := 2; 616#L221-1 start_simulation_~kernel_st~0 := 3; 547#L323 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; 538#L109-3 assume !(1 == ~P_1_pc~0); 539#L109-5 is_P_1_triggered_~__retres1~0 := 0; 550#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 603#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 648#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 599#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 577#L191-3 assume 1 == ~C_1_pc~0; 578#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 606#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 647#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 588#L383-3 assume !(0 != activate_threads_~tmp___1~1); 589#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 708#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 617#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 618#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 641#L456 assume !(0 == start_simulation_~tmp~3); 643#L456-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; 561#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 562#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 645#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 611#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 564#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 545#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 546#L469 assume !(0 != start_simulation_~tmp___0~2); 553#L437-1 [2021-08-31 04:18:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2021-08-31 04:18:02,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403884455] [2021-08-31 04:18:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:02,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403884455] [2021-08-31 04:18:02,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403884455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:18:02,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537051284] [2021-08-31 04:18:02,847 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:02,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 2 times [2021-08-31 04:18:02,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099967267] [2021-08-31 04:18:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:02,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099967267] [2021-08-31 04:18:02,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099967267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:02,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201380950] [2021-08-31 04:18:02,879 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:02,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:02,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:18:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:18:02,880 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-08-31 04:18:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:03,309 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2021-08-31 04:18:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 04:18:03,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 574 transitions. [2021-08-31 04:18:03,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 378 [2021-08-31 04:18:03,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 574 transitions. [2021-08-31 04:18:03,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2021-08-31 04:18:03,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2021-08-31 04:18:03,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 574 transitions. [2021-08-31 04:18:03,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:03,321 INFO L681 BuchiCegarLoop]: Abstraction has 409 states and 574 transitions. [2021-08-31 04:18:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 574 transitions. [2021-08-31 04:18:03,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 315. [2021-08-31 04:18:03,340 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-08-31 04:18:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 448 transitions. [2021-08-31 04:18:03,341 INFO L704 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-08-31 04:18:03,341 INFO L587 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-08-31 04:18:03,341 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:18:03,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 448 transitions. [2021-08-31 04:18:03,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2021-08-31 04:18:03,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:03,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:03,344 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-08-31 04:18:03,344 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-08-31 04:18:03,345 INFO L791 eck$LassoCheckResult]: Stem: 1254#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; 1194#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; 1195#L488 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; 1224#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1214#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1215#L233-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; 1222#L109 assume !(1 == ~P_1_pc~0); 1252#L109-2 is_P_1_triggered_~__retres1~0 := 0; 1205#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1183#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1161#L375 assume !(0 != activate_threads_~tmp~1); 1162#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1201#L191 assume !(1 == ~C_1_pc~0); 1230#L191-2 assume !(2 == ~C_1_pc~0); 1231#L201-1 is_C_1_triggered_~__retres1~1 := 0; 1234#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1235#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1210#L383 assume !(0 != activate_threads_~tmp___1~1); 1158#L437-1 [2021-08-31 04:18:03,345 INFO L793 eck$LassoCheckResult]: Loop: 1158#L437-1 assume !false; 1188#L438 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; 1165#L296 assume !false; 1203#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1204#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1220#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1223#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1147#L276 assume !(0 != eval_~tmp___2~0); 1149#L312 start_simulation_~kernel_st~0 := 2; 1218#L221-1 start_simulation_~kernel_st~0 := 3; 1152#L323 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; 1143#L109-3 assume !(1 == ~P_1_pc~0); 1144#L109-5 is_P_1_triggered_~__retres1~0 := 0; 1155#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1206#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1250#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1202#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1179#L191-3 assume !(1 == ~C_1_pc~0); 1180#L191-5 assume 2 == ~C_1_pc~0; 1238#L202-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 1209#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1249#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1191#L383-3 assume !(0 != activate_threads_~tmp___1~1); 1159#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1160#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1175#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1219#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1239#L456 assume !(0 == start_simulation_~tmp~3); 1241#L456-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; 1166#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1167#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1245#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1213#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1169#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 1150#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1151#L469 assume !(0 != start_simulation_~tmp___0~2); 1158#L437-1 [2021-08-31 04:18:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2021-08-31 04:18:03,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041643726] [2021-08-31 04:18:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:03,356 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:03,384 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2030427419, now seen corresponding path program 1 times [2021-08-31 04:18:03,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131540121] [2021-08-31 04:18:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:03,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131540121] [2021-08-31 04:18:03,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131540121] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:03,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428836564] [2021-08-31 04:18:03,427 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:03,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:18:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:18:03,429 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-08-31 04:18:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:03,798 INFO L93 Difference]: Finished difference Result 549 states and 768 transitions. [2021-08-31 04:18:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 04:18:03,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 768 transitions. [2021-08-31 04:18:03,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 530 [2021-08-31 04:18:03,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 768 transitions. [2021-08-31 04:18:03,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 549 [2021-08-31 04:18:03,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 549 [2021-08-31 04:18:03,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 768 transitions. [2021-08-31 04:18:03,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:03,808 INFO L681 BuchiCegarLoop]: Abstraction has 549 states and 768 transitions. [2021-08-31 04:18:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 768 transitions. [2021-08-31 04:18:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 327. [2021-08-31 04:18:03,814 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-08-31 04:18:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2021-08-31 04:18:03,815 INFO L704 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-08-31 04:18:03,815 INFO L587 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-08-31 04:18:03,815 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:18:03,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 460 transitions. [2021-08-31 04:18:03,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2021-08-31 04:18:03,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:03,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:03,818 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-08-31 04:18:03,818 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-08-31 04:18:03,818 INFO L791 eck$LassoCheckResult]: Stem: 2157#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; 2077#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; 2078#L488 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; 2111#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2098#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2099#L233-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; 2109#L109 assume !(1 == ~P_1_pc~0); 2151#L109-2 is_P_1_triggered_~__retres1~0 := 0; 2088#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2063#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2038#L375 assume !(0 != activate_threads_~tmp~1); 2039#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2079#L191 assume !(1 == ~C_1_pc~0); 2120#L191-2 assume !(2 == ~C_1_pc~0); 2121#L201-1 is_C_1_triggered_~__retres1~1 := 0; 2124#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2125#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2093#L383 assume !(0 != activate_threads_~tmp___1~1); 2094#L437-1 [2021-08-31 04:18:03,818 INFO L793 eck$LassoCheckResult]: Loop: 2094#L437-1 assume !false; 2265#L438 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; 2213#L296 assume !false; 2211#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2210#L246 assume !(0 == ~P_1_st~0); 2207#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2205#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2202#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2200#L276 assume !(0 != eval_~tmp___2~0); 2199#L312 start_simulation_~kernel_st~0 := 2; 2198#L221-1 start_simulation_~kernel_st~0 := 3; 2029#L323 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; 2023#L109-3 assume !(1 == ~P_1_pc~0); 2024#L109-5 is_P_1_triggered_~__retres1~0 := 0; 2034#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2089#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2147#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2085#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2061#L191-3 assume !(1 == ~C_1_pc~0); 2062#L191-5 assume !(2 == ~C_1_pc~0); 2128#L201-3 is_C_1_triggered_~__retres1~1 := 0; 2307#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2306#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2305#L383-3 assume !(0 != activate_threads_~tmp___1~1); 2304#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2302#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2300#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2298#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2297#L456 assume !(0 == start_simulation_~tmp~3); 2292#L456-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; 2290#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2289#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2285#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2282#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2277#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 2274#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2272#L469 assume !(0 != start_simulation_~tmp___0~2); 2094#L437-1 [2021-08-31 04:18:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2021-08-31 04:18:03,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461576001] [2021-08-31 04:18:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:03,827 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:03,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2021-08-31 04:18:03,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402170550] [2021-08-31 04:18:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:03,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402170550] [2021-08-31 04:18:03,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402170550] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:03,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910512797] [2021-08-31 04:18:03,902 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:03,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:03,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:18:03,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:18:03,903 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-08-31 04:18:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:04,409 INFO L93 Difference]: Finished difference Result 723 states and 1015 transitions. [2021-08-31 04:18:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 04:18:04,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 1015 transitions. [2021-08-31 04:18:04,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 704 [2021-08-31 04:18:04,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 723 states and 1015 transitions. [2021-08-31 04:18:04,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2021-08-31 04:18:04,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 723 [2021-08-31 04:18:04,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 723 states and 1015 transitions. [2021-08-31 04:18:04,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:04,421 INFO L681 BuchiCegarLoop]: Abstraction has 723 states and 1015 transitions. [2021-08-31 04:18:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states and 1015 transitions. [2021-08-31 04:18:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 339. [2021-08-31 04:18:04,427 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-08-31 04:18:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2021-08-31 04:18:04,428 INFO L704 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-08-31 04:18:04,428 INFO L587 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-08-31 04:18:04,429 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 04:18:04,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 467 transitions. [2021-08-31 04:18:04,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2021-08-31 04:18:04,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:04,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:04,431 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-08-31 04:18:04,431 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-08-31 04:18:04,432 INFO L791 eck$LassoCheckResult]: Stem: 3206#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; 3137#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; 3138#L488 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; 3168#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3157#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3158#L233-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; 3166#L109 assume !(1 == ~P_1_pc~0); 3202#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3148#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3126#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3103#L375 assume !(0 != activate_threads_~tmp~1); 3104#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3139#L191 assume !(1 == ~C_1_pc~0); 3175#L191-2 assume !(2 == ~C_1_pc~0); 3176#L201-1 is_C_1_triggered_~__retres1~1 := 0; 3179#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3180#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3153#L383 assume !(0 != activate_threads_~tmp___1~1); 3154#L437-1 [2021-08-31 04:18:04,432 INFO L793 eck$LassoCheckResult]: Loop: 3154#L437-1 assume !false; 3349#L438 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; 3347#L296 assume !false; 3346#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3345#L246 assume !(0 == ~P_1_st~0); 3342#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3340#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3335#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 3328#L276 assume !(0 != eval_~tmp___2~0); 3279#L312 start_simulation_~kernel_st~0 := 2; 3267#L221-1 start_simulation_~kernel_st~0 := 3; 3221#L323 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; 3222#L109-3 assume !(1 == ~P_1_pc~0); 3262#L109-5 is_P_1_triggered_~__retres1~0 := 0; 3260#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3258#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3256#L375-3 assume !(0 != activate_threads_~tmp~1); 3254#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3252#L191-3 assume !(1 == ~C_1_pc~0); 3250#L191-5 assume !(2 == ~C_1_pc~0); 3248#L201-3 is_C_1_triggered_~__retres1~1 := 0; 3246#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3245#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3244#L383-3 assume !(0 != activate_threads_~tmp___1~1); 3243#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3241#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3240#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3239#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3237#L456 assume !(0 == start_simulation_~tmp~3); 3238#L456-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; 3370#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3369#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3368#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 3367#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3366#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 3365#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 3364#L469 assume !(0 != start_simulation_~tmp___0~2); 3154#L437-1 [2021-08-31 04:18:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2021-08-31 04:18:04,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895981115] [2021-08-31 04:18:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,441 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 13170388, now seen corresponding path program 1 times [2021-08-31 04:18:04,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849001827] [2021-08-31 04:18:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:04,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:04,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849001827] [2021-08-31 04:18:04,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849001827] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:04,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:04,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:04,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842902113] [2021-08-31 04:18:04,475 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:04,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:04,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:04,477 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-08-31 04:18:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:04,674 INFO L93 Difference]: Finished difference Result 493 states and 667 transitions. [2021-08-31 04:18:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:04,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 667 transitions. [2021-08-31 04:18:04,679 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-08-31 04:18:04,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 493 states and 667 transitions. [2021-08-31 04:18:04,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2021-08-31 04:18:04,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2021-08-31 04:18:04,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 667 transitions. [2021-08-31 04:18:04,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:04,683 INFO L681 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-31 04:18:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 667 transitions. [2021-08-31 04:18:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-08-31 04:18:04,689 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-08-31 04:18:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2021-08-31 04:18:04,690 INFO L704 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-31 04:18:04,690 INFO L587 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-31 04:18:04,690 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 04:18:04,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 667 transitions. [2021-08-31 04:18:04,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-08-31 04:18:04,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:04,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:04,693 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-08-31 04:18:04,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:04,693 INFO L791 eck$LassoCheckResult]: Stem: 4051#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; 3974#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; 3975#L488 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; 4007#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3996#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3997#L233-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; 4005#L109 assume !(1 == ~P_1_pc~0); 4047#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3986#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3963#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3940#L375 assume !(0 != activate_threads_~tmp~1); 3941#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3976#L191 assume !(1 == ~C_1_pc~0); 4016#L191-2 assume !(2 == ~C_1_pc~0); 4017#L201-1 is_C_1_triggered_~__retres1~1 := 0; 4020#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4021#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3992#L383 assume !(0 != activate_threads_~tmp___1~1); 3993#L437-1 assume !false; 4371#L438 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; 4010#L296 [2021-08-31 04:18:04,694 INFO L793 eck$LassoCheckResult]: Loop: 4010#L296 assume !false; 4369#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4367#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4378#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 4377#L276 assume 0 != eval_~tmp___2~0; 4375#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4049#L285 assume !(0 != eval_~tmp~0); 4050#L281 assume !(0 == ~C_1_st~0); 4010#L296 [2021-08-31 04:18:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2021-08-31 04:18:04,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112757333] [2021-08-31 04:18:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,701 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,711 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2021-08-31 04:18:04,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202066890] [2021-08-31 04:18:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,715 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:04,718 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2021-08-31 04:18:04,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284677956] [2021-08-31 04:18:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:04,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:04,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284677956] [2021-08-31 04:18:04,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284677956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:04,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:04,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:04,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997023668] [2021-08-31 04:18:04,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:04,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:04,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:04,781 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-08-31 04:18:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:05,083 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2021-08-31 04:18:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:05,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 801 states and 1061 transitions. [2021-08-31 04:18:05,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-31 04:18:05,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 801 states to 801 states and 1061 transitions. [2021-08-31 04:18:05,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2021-08-31 04:18:05,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2021-08-31 04:18:05,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 801 states and 1061 transitions. [2021-08-31 04:18:05,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:05,097 INFO L681 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-31 04:18:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states and 1061 transitions. [2021-08-31 04:18:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2021-08-31 04:18:05,108 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-08-31 04:18:05,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1061 transitions. [2021-08-31 04:18:05,111 INFO L704 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-31 04:18:05,111 INFO L587 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-31 04:18:05,111 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 04:18:05,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1061 transitions. [2021-08-31 04:18:05,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-31 04:18:05,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:05,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:05,116 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-08-31 04:18:05,116 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,116 INFO L791 eck$LassoCheckResult]: Stem: 5364#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; 5277#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; 5278#L488 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; 5314#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5300#L228-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5301#L233-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; 5312#L109 assume !(1 == ~P_1_pc~0); 5366#L109-2 is_P_1_triggered_~__retres1~0 := 0; 5367#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5263#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5264#L375 assume !(0 != activate_threads_~tmp~1); 5596#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5593#L191 assume !(1 == ~C_1_pc~0); 5591#L191-2 assume !(2 == ~C_1_pc~0); 5580#L201-1 is_C_1_triggered_~__retres1~1 := 0; 5579#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5578#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5576#L383 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5295#L437-1 assume !false; 5745#L438 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; 5706#L296 [2021-08-31 04:18:05,116 INFO L793 eck$LassoCheckResult]: Loop: 5706#L296 assume !false; 5738#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5734#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5730#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5725#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 5721#L276 assume 0 != eval_~tmp___2~0; 5718#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5715#L285 assume !(0 != eval_~tmp~0); 5713#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 5504#L300 assume !(0 != eval_~tmp___1~0); 5706#L296 [2021-08-31 04:18:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,116 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2021-08-31 04:18:05,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196066622] [2021-08-31 04:18:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:18:05,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:05,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196066622] [2021-08-31 04:18:05,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196066622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:05,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:05,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:05,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333496753] [2021-08-31 04:18:05,145 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2021-08-31 04:18:05,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692995290] [2021-08-31 04:18:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,151 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,166 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:05,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:05,239 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-08-31 04:18:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:05,359 INFO L93 Difference]: Finished difference Result 785 states and 1041 transitions. [2021-08-31 04:18:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:05,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1041 transitions. [2021-08-31 04:18:05,364 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-31 04:18:05,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1041 transitions. [2021-08-31 04:18:05,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2021-08-31 04:18:05,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 785 [2021-08-31 04:18:05,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1041 transitions. [2021-08-31 04:18:05,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:05,372 INFO L681 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-31 04:18:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1041 transitions. [2021-08-31 04:18:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2021-08-31 04:18:05,382 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-08-31 04:18:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1041 transitions. [2021-08-31 04:18:05,403 INFO L704 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-31 04:18:05,403 INFO L587 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-31 04:18:05,403 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 04:18:05,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 785 states and 1041 transitions. [2021-08-31 04:18:05,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-31 04:18:05,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:05,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:05,408 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-08-31 04:18:05,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,408 INFO L791 eck$LassoCheckResult]: Stem: 6949#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; 6867#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; 6868#L488 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; 6903#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6890#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6891#L233-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; 6899#L109 assume !(1 == ~P_1_pc~0); 6942#L109-2 is_P_1_triggered_~__retres1~0 := 0; 6879#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6855#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6835#L375 assume !(0 != activate_threads_~tmp~1); 6836#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6874#L191 assume !(1 == ~C_1_pc~0); 6909#L191-2 assume !(2 == ~C_1_pc~0); 6910#L201-1 is_C_1_triggered_~__retres1~1 := 0; 6913#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6914#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6884#L383 assume !(0 != activate_threads_~tmp___1~1); 6885#L437-1 assume !false; 7179#L438 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; 7156#L296 [2021-08-31 04:18:05,408 INFO L793 eck$LassoCheckResult]: Loop: 7156#L296 assume !false; 7177#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7175#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7173#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7171#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 7169#L276 assume 0 != eval_~tmp___2~0; 7167#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 7164#L285 assume !(0 != eval_~tmp~0); 7161#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 7155#L300 assume !(0 != eval_~tmp___1~0); 7156#L296 [2021-08-31 04:18:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2021-08-31 04:18:05,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244487167] [2021-08-31 04:18:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,421 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2021-08-31 04:18:05,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032605068] [2021-08-31 04:18:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,454 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2021-08-31 04:18:05,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878957142] [2021-08-31 04:18:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,469 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:06,291 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:18:06,294 INFO L158 Benchmark]: Toolchain (without parser) took 5535.89ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 32.6MB in the beginning and 39.3MB in the end (delta: -6.7MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,295 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:18:06,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.71ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 35.9MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.43ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,296 INFO L158 Benchmark]: Boogie Preprocessor took 42.08ms. Allocated memory is still 54.5MB. Free memory was 33.5MB in the beginning and 31.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,296 INFO L158 Benchmark]: RCFGBuilder took 370.34ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 43.4MB in the end (delta: -11.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,297 INFO L158 Benchmark]: BuchiAutomizer took 4762.05ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 43.4MB in the beginning and 39.3MB in the end (delta: 4.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:06,299 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.14ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.71ms. Allocated memory is still 54.5MB. Free memory was 32.4MB in the beginning and 35.9MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.43ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 33.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.08ms. Allocated memory is still 54.5MB. Free memory was 33.5MB in the beginning and 31.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.34ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 43.4MB in the end (delta: -11.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 4762.05ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 43.4MB in the beginning and 39.3MB in the end (delta: 4.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:18:06,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...