./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/kundu2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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/kundu2.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 bcaab56def91d08648015d5637379998052b8de3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:17:59,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:18:00,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:18:00,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:18:00,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:18:00,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:18:00,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:18:00,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:18:00,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:18:00,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:18:00,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:18:00,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:18:00,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:18:00,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:18:00,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:18:00,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:18:00,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:18:00,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:18:00,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:18:00,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:18:00,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:18:00,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:18:00,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:18:00,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:18:00,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:18:00,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:18:00,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:18:00,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:18:00,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:18:00,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:18:00,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:18:00,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:18:00,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:18:00,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:18:00,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:18:00,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:18:00,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:18:00,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:18:00,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:18:00,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:18:00,063 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:18:00,083 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:18:00,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:18:00,084 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:18:00,084 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:18:00,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:18:00,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:18:00,085 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:18:00,086 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:18:00,086 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:18:00,086 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:18:00,086 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:18:00,086 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:18:00,086 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:18:00,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:18:00,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:18:00,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:18:00,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:18:00,088 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:18:00,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:18:00,088 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:18:00,091 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:18:00,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:18:00,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:18:00,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:18:00,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:18:00,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:18:00,092 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:18:00,093 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:18:00,093 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 -> bcaab56def91d08648015d5637379998052b8de3 [2021-08-31 04:18:00,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:18:00,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:18:00,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:18:00,461 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:18:00,465 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:18:00,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu2.cil.c [2021-08-31 04:18:00,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49dd60927/736b44bbca974f2d894e343b939aadb7/FLAGb8e6090c8 [2021-08-31 04:18:00,900 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:18:00,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu2.cil.c [2021-08-31 04:18:00,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49dd60927/736b44bbca974f2d894e343b939aadb7/FLAGb8e6090c8 [2021-08-31 04:18:01,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49dd60927/736b44bbca974f2d894e343b939aadb7 [2021-08-31 04:18:01,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:18:01,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:18:01,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:01,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:18:01,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:18:01,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674a6184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:18:01, skipping insertion in model container [2021-08-31 04:18:01,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:18:01" (1/1) ... [2021-08-31 04:18:01,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:18:01,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:18:01,454 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/kundu2.cil.c[331,344] [2021-08-31 04:18:01,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:01,518 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:18:01,537 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/kundu2.cil.c[331,344] [2021-08-31 04:18:01,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:18:01,644 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:18:01,644 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,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:18:01,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:01,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:18:01,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:18:01,652 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,659 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,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:18:01,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:18:01,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:18:01,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:18:01,694 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,695 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,697 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,697 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,704 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,726 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,740 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,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:18:01,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:18:01,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:18:01,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:18:01,745 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,755 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:18:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:18:01,782 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,808 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,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:18:01,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:18:01,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:18:01,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:18:02,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:18:02,188 INFO L299 CfgBuilder]: Removed 95 assume(true) statements. [2021-08-31 04:18:02,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:02 BoogieIcfgContainer [2021-08-31 04:18:02,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:18:02,192 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:18:02,192 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:18:02,194 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:18:02,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:02,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:18:01" (1/3) ... [2021-08-31 04:18:02,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4cce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:02, skipping insertion in model container [2021-08-31 04:18:02,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:02,196 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:02,197 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b4cce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:18:02, skipping insertion in model container [2021-08-31 04:18:02,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:18:02,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:18:02" (3/3) ... [2021-08-31 04:18:02,198 INFO L389 chiAutomizerObserver]: Analyzing ICFG kundu2.cil.c [2021-08-31 04:18:02,248 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:18:02,248 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:18:02,248 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:18:02,249 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:18:02,249 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:18:02,249 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:18:02,249 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:18:02,249 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:18:02,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 176 states, 175 states have (on average 1.542857142857143) internal successors, (270), 175 states have internal predecessors, (270), 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,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2021-08-31 04:18:02,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:02,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:02,328 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, 1, 1, 1, 1] [2021-08-31 04:18:02,329 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:02,329 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:18:02,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 176 states, 175 states have (on average 1.542857142857143) internal successors, (270), 175 states have internal predecessors, (270), 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,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2021-08-31 04:18:02,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:02,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:02,349 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, 1, 1, 1, 1] [2021-08-31 04:18:02,349 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:02,359 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 53#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 150#L591true havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 46#L289true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 87#L296-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 129#L301-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 156#L306-1true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 149#L109true assume !(1 == ~P_1_pc~0); 169#L109-2true is_P_1_triggered_~__retres1~0 := 0; 61#L120true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 41#L121true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 19#L469true assume !(0 != activate_threads_~tmp~1); 48#L469-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 72#L177true assume 1 == ~P_2_pc~0; 43#L178true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 30#L188true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 111#L189true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 42#L477true assume !(0 != activate_threads_~tmp___0~1); 107#L477-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 85#L259true assume 1 == ~C_1_pc~0; 81#L260true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 123#L280true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 24#L281true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 124#L485true assume !(0 != activate_threads_~tmp___1~1); 70#L539-1true [2021-08-31 04:18:02,360 INFO L793 eck$LassoCheckResult]: Loop: 70#L539-1true assume !false; 39#L540true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 33#L388true assume !true; 154#L404true start_simulation_~kernel_st~0 := 2; 5#L289-1true start_simulation_~kernel_st~0 := 3; 148#L415true havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 151#L109-6true assume 1 == ~P_1_pc~0; 56#L110-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 44#L120-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13#L121-2true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 59#L469-6true assume !(0 != activate_threads_~tmp~1); 113#L469-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 60#L177-6true assume !(1 == ~P_2_pc~0); 120#L177-8true is_P_2_triggered_~__retres1~1 := 0; 12#L188-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 66#L189-2true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 38#L477-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 77#L477-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 79#L259-6true assume 1 == ~C_1_pc~0; 121#L260-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 142#L280-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 98#L281-2true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 67#L485-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 168#L485-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 138#L319-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8#L336-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 177#L337-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 175#L558true assume !(0 == start_simulation_~tmp~3); 143#L558-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27#L319-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 103#L336-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 165#L337-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 131#L513true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 55#L520true stop_simulation_#res := stop_simulation_~__retres2~0; 119#L521true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 163#L571true assume !(0 != start_simulation_~tmp___0~2); 70#L539-1true [2021-08-31 04:18:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2021-08-31 04:18:02,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49091032] [2021-08-31 04:18:02,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,580 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,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49091032] [2021-08-31 04:18:02,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49091032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:02,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993630552] [2021-08-31 04:18:02,598 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2021-08-31 04:18:02,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:02,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533318813] [2021-08-31 04:18:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:02,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:02,628 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,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:02,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533318813] [2021-08-31 04:18:02,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533318813] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:02,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:02,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:02,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953016525] [2021-08-31 04:18:02,632 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:02,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:02,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:02,664 INFO L87 Difference]: Start difference. First operand has 176 states, 175 states have (on average 1.542857142857143) internal successors, (270), 175 states have internal predecessors, (270), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:03,046 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2021-08-31 04:18:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:03,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2021-08-31 04:18:03,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2021-08-31 04:18:03,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2021-08-31 04:18:03,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2021-08-31 04:18:03,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2021-08-31 04:18:03,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2021-08-31 04:18:03,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:03,076 INFO L681 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2021-08-31 04:18:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2021-08-31 04:18:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-08-31 04:18:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 166 states have internal predecessors, (249), 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,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2021-08-31 04:18:03,105 INFO L704 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2021-08-31 04:18:03,105 INFO L587 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2021-08-31 04:18:03,105 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:18:03,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2021-08-31 04:18:03,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2021-08-31 04:18:03,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:03,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:03,108 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, 1, 1, 1, 1] [2021-08-31 04:18:03,108 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, 1, 1, 1, 1] [2021-08-31 04:18:03,109 INFO L791 eck$LassoCheckResult]: Stem: 523#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 447#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 448#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 438#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 439#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 485#L301-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 515#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 522#L109 assume !(1 == ~P_1_pc~0); 483#L109-2 is_P_1_triggered_~__retres1~0 := 0; 459#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 430#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 393#L469 assume !(0 != activate_threads_~tmp~1); 394#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 442#L177 assume 1 == ~P_2_pc~0; 433#L178 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 414#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 415#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 431#L477 assume !(0 != activate_threads_~tmp___0~1); 432#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 484#L259 assume 1 == ~C_1_pc~0; 478#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 384#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 402#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 403#L485 assume !(0 != activate_threads_~tmp___1~1); 471#L539-1 [2021-08-31 04:18:03,109 INFO L793 eck$LassoCheckResult]: Loop: 471#L539-1 assume !false; 429#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 416#L388 assume !false; 417#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 504#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 368#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 493#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 494#L353 assume !(0 != eval_~tmp___2~0); 513#L404 start_simulation_~kernel_st~0 := 2; 363#L289-1 start_simulation_~kernel_st~0 := 3; 364#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 521#L109-6 assume 1 == ~P_1_pc~0; 452#L110-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 437#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 381#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 382#L469-6 assume !(0 != activate_threads_~tmp~1); 456#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 457#L177-6 assume 1 == ~P_2_pc~0; 387#L178-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 377#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 378#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 425#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 426#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 475#L259-6 assume 1 == ~C_1_pc~0; 477#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 476#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 495#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 467#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 468#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 518#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 370#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 371#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 526#L558 assume !(0 == start_simulation_~tmp~3); 492#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 406#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 407#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 501#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 514#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 449#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 450#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 511#L571 assume !(0 != start_simulation_~tmp___0~2); 471#L539-1 [2021-08-31 04:18:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2021-08-31 04:18:03,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509469549] [2021-08-31 04:18:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,141 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,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509469549] [2021-08-31 04:18:03,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509469549] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:03,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648611999] [2021-08-31 04:18:03,143 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2021-08-31 04:18:03,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588313303] [2021-08-31 04:18:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,184 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,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588313303] [2021-08-31 04:18:03,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588313303] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:03,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238109206] [2021-08-31 04:18:03,190 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:03,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:03,191 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:03,460 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2021-08-31 04:18:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:03,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2021-08-31 04:18:03,464 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2021-08-31 04:18:03,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2021-08-31 04:18:03,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2021-08-31 04:18:03,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2021-08-31 04:18:03,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2021-08-31 04:18:03,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:03,474 INFO L681 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2021-08-31 04:18:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2021-08-31 04:18:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-08-31 04:18:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 166 states have internal predecessors, (248), 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2021-08-31 04:18:03,488 INFO L704 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2021-08-31 04:18:03,488 INFO L587 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2021-08-31 04:18:03,488 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:18:03,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2021-08-31 04:18:03,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2021-08-31 04:18:03,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:03,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:03,490 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, 1, 1, 1, 1] [2021-08-31 04:18:03,490 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, 1, 1, 1, 1] [2021-08-31 04:18:03,490 INFO L791 eck$LassoCheckResult]: Stem: 866#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 790#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 791#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 781#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 782#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 828#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 857#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 865#L109 assume !(1 == ~P_1_pc~0); 824#L109-2 is_P_1_triggered_~__retres1~0 := 0; 801#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 773#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 736#L469 assume !(0 != activate_threads_~tmp~1); 737#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 784#L177 assume 1 == ~P_2_pc~0; 776#L178 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 757#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 758#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 774#L477 assume !(0 != activate_threads_~tmp___0~1); 775#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 825#L259 assume 1 == ~C_1_pc~0; 821#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 727#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 745#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 746#L485 assume !(0 != activate_threads_~tmp___1~1); 814#L539-1 [2021-08-31 04:18:03,491 INFO L793 eck$LassoCheckResult]: Loop: 814#L539-1 assume !false; 770#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 759#L388 assume !false; 760#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 847#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 711#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 834#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 835#L353 assume !(0 != eval_~tmp___2~0); 856#L404 start_simulation_~kernel_st~0 := 2; 706#L289-1 start_simulation_~kernel_st~0 := 3; 707#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 864#L109-6 assume 1 == ~P_1_pc~0; 795#L110-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 778#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 724#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 725#L469-6 assume !(0 != activate_threads_~tmp~1); 799#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 800#L177-6 assume 1 == ~P_2_pc~0; 730#L178-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 722#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 723#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 768#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 769#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 818#L259-6 assume 1 == ~C_1_pc~0; 820#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 819#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 838#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 810#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 811#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 861#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 713#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 714#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 869#L558 assume !(0 == start_simulation_~tmp~3); 837#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 750#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 751#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 844#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 858#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 793#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 794#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 854#L571 assume !(0 != start_simulation_~tmp___0~2); 814#L539-1 [2021-08-31 04:18:03,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2021-08-31 04:18:03,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779872838] [2021-08-31 04:18:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,570 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,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779872838] [2021-08-31 04:18:03,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779872838] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:18:03,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164323038] [2021-08-31 04:18:03,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2021-08-31 04:18:03,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:03,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391211125] [2021-08-31 04:18:03,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:03,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:03,615 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,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:03,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391211125] [2021-08-31 04:18:03,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391211125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:03,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:03,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:03,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322050588] [2021-08-31 04:18:03,619 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:03,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:18:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:18:03,620 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:04,292 INFO L93 Difference]: Finished difference Result 432 states and 626 transitions. [2021-08-31 04:18:04,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 04:18:04,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 626 transitions. [2021-08-31 04:18:04,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 374 [2021-08-31 04:18:04,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 432 states and 626 transitions. [2021-08-31 04:18:04,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2021-08-31 04:18:04,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2021-08-31 04:18:04,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 626 transitions. [2021-08-31 04:18:04,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:04,310 INFO L681 BuchiCegarLoop]: Abstraction has 432 states and 626 transitions. [2021-08-31 04:18:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 626 transitions. [2021-08-31 04:18:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 392. [2021-08-31 04:18:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 392 states have (on average 1.4591836734693877) internal successors, (572), 391 states have internal predecessors, (572), 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,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2021-08-31 04:18:04,331 INFO L704 BuchiCegarLoop]: Abstraction has 392 states and 572 transitions. [2021-08-31 04:18:04,331 INFO L587 BuchiCegarLoop]: Abstraction has 392 states and 572 transitions. [2021-08-31 04:18:04,331 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:18:04,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 392 states and 572 transitions. [2021-08-31 04:18:04,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 359 [2021-08-31 04:18:04,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:04,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:04,336 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, 1, 1, 1, 1] [2021-08-31 04:18:04,336 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, 1, 1, 1, 1] [2021-08-31 04:18:04,337 INFO L791 eck$LassoCheckResult]: Stem: 1498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1403#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1404#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1394#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1395#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1443#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1486#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1495#L109 assume !(1 == ~P_1_pc~0); 1496#L109-2 is_P_1_triggered_~__retres1~0 := 0; 1417#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1388#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1348#L469 assume !(0 != activate_threads_~tmp~1); 1349#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1398#L177 assume !(1 == ~P_2_pc~0); 1430#L177-2 is_P_2_triggered_~__retres1~1 := 0; 1371#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1372#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1389#L477 assume !(0 != activate_threads_~tmp___0~1); 1390#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1442#L259 assume 1 == ~C_1_pc~0; 1438#L260 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1338#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1358#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1359#L485 assume !(0 != activate_threads_~tmp___1~1); 1429#L539-1 [2021-08-31 04:18:04,337 INFO L793 eck$LassoCheckResult]: Loop: 1429#L539-1 assume !false; 1387#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1374#L388 assume !false; 1375#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1472#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1322#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1455#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1456#L353 assume !(0 != eval_~tmp___2~0); 1481#L404 start_simulation_~kernel_st~0 := 2; 1317#L289-1 start_simulation_~kernel_st~0 := 3; 1318#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1494#L109-6 assume !(1 == ~P_1_pc~0); 1446#L109-8 is_P_1_triggered_~__retres1~0 := 0; 1391#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1335#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1336#L469-6 assume !(0 != activate_threads_~tmp~1); 1413#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1414#L177-6 assume !(1 == ~P_2_pc~0); 1415#L177-8 is_P_2_triggered_~__retres1~1 := 0; 1333#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1334#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1383#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1384#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1436#L259-6 assume 1 == ~C_1_pc~0; 1437#L260-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1435#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1457#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1425#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1426#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1489#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1324#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1325#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1506#L558 assume !(0 == start_simulation_~tmp~3); 1491#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1364#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1365#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1462#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1502#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1697#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 1692#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1691#L571 assume !(0 != start_simulation_~tmp___0~2); 1429#L539-1 [2021-08-31 04:18:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2021-08-31 04:18:04,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664402988] [2021-08-31 04:18:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:04,396 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,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:04,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664402988] [2021-08-31 04:18:04,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664402988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:04,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:04,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 04:18:04,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301341934] [2021-08-31 04:18:04,399 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash 424592929, now seen corresponding path program 1 times [2021-08-31 04:18:04,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:04,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660388979] [2021-08-31 04:18:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:04,400 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:04,457 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,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:04,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660388979] [2021-08-31 04:18:04,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660388979] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:04,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:04,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:04,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255111534] [2021-08-31 04:18:04,459 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:04,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 04:18:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-31 04:18:04,460 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. cyclomatic complexity: 182 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:05,050 INFO L93 Difference]: Finished difference Result 1082 states and 1540 transitions. [2021-08-31 04:18:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 04:18:05,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1540 transitions. [2021-08-31 04:18:05,056 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1006 [2021-08-31 04:18:05,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1082 states and 1540 transitions. [2021-08-31 04:18:05,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1082 [2021-08-31 04:18:05,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1082 [2021-08-31 04:18:05,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1082 states and 1540 transitions. [2021-08-31 04:18:05,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:05,065 INFO L681 BuchiCegarLoop]: Abstraction has 1082 states and 1540 transitions. [2021-08-31 04:18:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states and 1540 transitions. [2021-08-31 04:18:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1023. [2021-08-31 04:18:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1023 states have (on average 1.4349951124144673) internal successors, (1468), 1022 states have internal predecessors, (1468), 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,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1468 transitions. [2021-08-31 04:18:05,085 INFO L704 BuchiCegarLoop]: Abstraction has 1023 states and 1468 transitions. [2021-08-31 04:18:05,085 INFO L587 BuchiCegarLoop]: Abstraction has 1023 states and 1468 transitions. [2021-08-31 04:18:05,085 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:18:05,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1023 states and 1468 transitions. [2021-08-31 04:18:05,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 985 [2021-08-31 04:18:05,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:05,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:05,090 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,091 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,091 INFO L791 eck$LassoCheckResult]: Stem: 2995#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2893#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2894#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2883#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2884#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2933#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2979#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2989#L109 assume !(1 == ~P_1_pc~0); 2990#L109-2 is_P_1_triggered_~__retres1~0 := 0; 2908#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2876#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2835#L469 assume !(0 != activate_threads_~tmp~1); 2836#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2887#L177 assume !(1 == ~P_2_pc~0); 2921#L177-2 is_P_2_triggered_~__retres1~1 := 0; 2857#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2858#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2877#L477 assume !(0 != activate_threads_~tmp___0~1); 2878#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2931#L259 assume !(1 == ~C_1_pc~0); 2932#L259-2 assume 2 == ~C_1_pc~0; 2824#L270 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 2825#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2844#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2845#L485 assume !(0 != activate_threads_~tmp___1~1); 2920#L539-1 [2021-08-31 04:18:05,091 INFO L793 eck$LassoCheckResult]: Loop: 2920#L539-1 assume !false; 2875#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2860#L388 assume !false; 2861#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3005#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2809#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2943#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2944#L353 assume !(0 != eval_~tmp___2~0); 2992#L404 start_simulation_~kernel_st~0 := 2; 2804#L289-1 start_simulation_~kernel_st~0 := 3; 2805#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2988#L109-6 assume !(1 == ~P_1_pc~0); 2936#L109-8 is_P_1_triggered_~__retres1~0 := 0; 2879#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2822#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2823#L469-6 assume !(0 != activate_threads_~tmp~1); 2904#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2905#L177-6 assume !(1 == ~P_2_pc~0); 2906#L177-8 is_P_2_triggered_~__retres1~1 := 0; 2820#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2821#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2871#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2872#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2927#L259-6 assume !(1 == ~C_1_pc~0); 2913#L259-8 assume 2 == ~C_1_pc~0; 2914#L270-2 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 2928#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2948#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2916#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2917#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2982#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2811#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2812#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3002#L558 assume !(0 == start_simulation_~tmp~3); 2947#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2850#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2851#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2951#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 2978#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2897#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 2898#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 2970#L571 assume !(0 != start_simulation_~tmp___0~2); 2920#L539-1 [2021-08-31 04:18:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1720008278, now seen corresponding path program 1 times [2021-08-31 04:18:05,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595522888] [2021-08-31 04:18:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:05,125 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,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:05,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595522888] [2021-08-31 04:18:05,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595522888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:05,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:05,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:05,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831140835] [2021-08-31 04:18:05,127 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1673415445, now seen corresponding path program 1 times [2021-08-31 04:18:05,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341472645] [2021-08-31 04:18:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:05,154 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,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:05,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341472645] [2021-08-31 04:18:05,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341472645] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:05,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:05,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:05,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839764640] [2021-08-31 04:18:05,156 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:05,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:05,160 INFO L87 Difference]: Start difference. First operand 1023 states and 1468 transitions. cyclomatic complexity: 449 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:05,510 INFO L93 Difference]: Finished difference Result 1354 states and 1912 transitions. [2021-08-31 04:18:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:05,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1354 states and 1912 transitions. [2021-08-31 04:18:05,520 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1311 [2021-08-31 04:18:05,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1354 states to 1354 states and 1912 transitions. [2021-08-31 04:18:05,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1354 [2021-08-31 04:18:05,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1354 [2021-08-31 04:18:05,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1354 states and 1912 transitions. [2021-08-31 04:18:05,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:05,532 INFO L681 BuchiCegarLoop]: Abstraction has 1354 states and 1912 transitions. [2021-08-31 04:18:05,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states and 1912 transitions. [2021-08-31 04:18:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1330. [2021-08-31 04:18:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.4150375939849624) internal successors, (1882), 1329 states have internal predecessors, (1882), 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,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1882 transitions. [2021-08-31 04:18:05,551 INFO L704 BuchiCegarLoop]: Abstraction has 1330 states and 1882 transitions. [2021-08-31 04:18:05,552 INFO L587 BuchiCegarLoop]: Abstraction has 1330 states and 1882 transitions. [2021-08-31 04:18:05,552 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 04:18:05,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1882 transitions. [2021-08-31 04:18:05,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1287 [2021-08-31 04:18:05,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:05,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:05,559 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,559 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:05,560 INFO L791 eck$LassoCheckResult]: Stem: 5397#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5279#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 5280#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5269#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5270#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5325#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5377#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5389#L109 assume !(1 == ~P_1_pc~0); 5390#L109-2 is_P_1_triggered_~__retres1~0 := 0; 5294#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5262#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5219#L469 assume !(0 != activate_threads_~tmp~1); 5220#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5273#L177 assume !(1 == ~P_2_pc~0); 5311#L177-2 is_P_2_triggered_~__retres1~1 := 0; 5245#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5246#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5263#L477 assume !(0 != activate_threads_~tmp___0~1); 5264#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5323#L259 assume !(1 == ~C_1_pc~0); 5324#L259-2 assume !(2 == ~C_1_pc~0); 5378#L269-1 is_C_1_triggered_~__retres1~2 := 0; 5369#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5231#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5232#L485 assume !(0 != activate_threads_~tmp___1~1); 5370#L539-1 [2021-08-31 04:18:05,560 INFO L793 eck$LassoCheckResult]: Loop: 5370#L539-1 assume !false; 6314#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 6309#L388 assume !false; 6308#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6306#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6304#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6303#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 6301#L353 assume !(0 != eval_~tmp___2~0); 6302#L404 start_simulation_~kernel_st~0 := 2; 6511#L289-1 start_simulation_~kernel_st~0 := 3; 6510#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6509#L109-6 assume !(1 == ~P_1_pc~0); 6508#L109-8 is_P_1_triggered_~__retres1~0 := 0; 5265#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5209#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5210#L469-6 assume !(0 != activate_threads_~tmp~1); 5290#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5291#L177-6 assume !(1 == ~P_2_pc~0); 5292#L177-8 is_P_2_triggered_~__retres1~1 := 0; 5207#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5208#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 6467#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 6381#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6380#L259-6 assume !(1 == ~C_1_pc~0); 6379#L259-8 assume !(2 == ~C_1_pc~0); 6378#L269-5 is_C_1_triggered_~__retres1~2 := 0; 6377#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6376#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 6371#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 6368#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6365#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6364#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6348#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6343#L558 assume !(0 == start_simulation_~tmp~3); 6339#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6335#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6333#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6330#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 6327#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6324#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 6322#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6318#L571 assume !(0 != start_simulation_~tmp___0~2); 5370#L539-1 [2021-08-31 04:18:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2021-08-31 04:18:05,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612802860] [2021-08-31 04:18:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,576 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:05,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1481200140, now seen corresponding path program 1 times [2021-08-31 04:18:05,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:05,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534811077] [2021-08-31 04:18:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:05,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:05,677 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,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:05,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534811077] [2021-08-31 04:18:05,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534811077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:05,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:05,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:05,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364940078] [2021-08-31 04:18:05,679 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:05,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:05,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:18:05,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:18:05,679 INFO L87 Difference]: Start difference. First operand 1330 states and 1882 transitions. cyclomatic complexity: 556 Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:06,200 INFO L93 Difference]: Finished difference Result 2355 states and 3300 transitions. [2021-08-31 04:18:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 04:18:06,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2355 states and 3300 transitions. [2021-08-31 04:18:06,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2294 [2021-08-31 04:18:06,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2355 states to 2355 states and 3300 transitions. [2021-08-31 04:18:06,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2355 [2021-08-31 04:18:06,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2355 [2021-08-31 04:18:06,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2355 states and 3300 transitions. [2021-08-31 04:18:06,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:06,253 INFO L681 BuchiCegarLoop]: Abstraction has 2355 states and 3300 transitions. [2021-08-31 04:18:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states and 3300 transitions. [2021-08-31 04:18:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1366. [2021-08-31 04:18:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1366 states have (on average 1.404099560761347) internal successors, (1918), 1365 states have internal predecessors, (1918), 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:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1918 transitions. [2021-08-31 04:18:06,277 INFO L704 BuchiCegarLoop]: Abstraction has 1366 states and 1918 transitions. [2021-08-31 04:18:06,277 INFO L587 BuchiCegarLoop]: Abstraction has 1366 states and 1918 transitions. [2021-08-31 04:18:06,277 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 04:18:06,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1366 states and 1918 transitions. [2021-08-31 04:18:06,283 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1323 [2021-08-31 04:18:06,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:06,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:06,285 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:06,285 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:06,285 INFO L791 eck$LassoCheckResult]: Stem: 9093#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 8980#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 8981#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 8970#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 8971#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 9025#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 9075#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 9088#L109 assume !(1 == ~P_1_pc~0); 9089#L109-2 is_P_1_triggered_~__retres1~0 := 0; 8995#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8963#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8919#L469 assume !(0 != activate_threads_~tmp~1); 8920#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8973#L177 assume !(1 == ~P_2_pc~0); 9011#L177-2 is_P_2_triggered_~__retres1~1 := 0; 8944#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8945#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 8964#L477 assume !(0 != activate_threads_~tmp___0~1); 8965#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 9021#L259 assume !(1 == ~C_1_pc~0); 9022#L259-2 assume !(2 == ~C_1_pc~0); 9076#L269-1 is_C_1_triggered_~__retres1~2 := 0; 9067#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8931#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 8932#L485 assume !(0 != activate_threads_~tmp___1~1); 9068#L539-1 [2021-08-31 04:18:06,285 INFO L793 eck$LassoCheckResult]: Loop: 9068#L539-1 assume !false; 10143#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 10141#L388 assume !false; 9053#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9054#L319 assume !(0 == ~P_1_st~0); 8895#L323 assume !(0 == ~P_2_st~0); 8897#L327 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 8947#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 9039#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 10126#L353 assume !(0 != eval_~tmp___2~0); 9090#L404 start_simulation_~kernel_st~0 := 2; 8891#L289-1 start_simulation_~kernel_st~0 := 3; 8892#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 9087#L109-6 assume !(1 == ~P_1_pc~0); 9028#L109-8 is_P_1_triggered_~__retres1~0 := 0; 8969#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8909#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8910#L469-6 assume !(0 != activate_threads_~tmp~1); 10248#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 10247#L177-6 assume !(1 == ~P_2_pc~0); 10246#L177-8 is_P_2_triggered_~__retres1~1 := 0; 10245#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 10244#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 10243#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 10242#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10241#L259-6 assume !(1 == ~C_1_pc~0); 9002#L259-8 assume !(2 == ~C_1_pc~0); 9003#L269-5 is_C_1_triggered_~__retres1~2 := 0; 10240#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 10239#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 10238#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 9095#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9078#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 9059#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10172#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 10167#L558 assume !(0 == start_simulation_~tmp~3); 10162#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 10159#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 10157#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10155#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 10153#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 10151#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 10147#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 10145#L571 assume !(0 != start_simulation_~tmp___0~2); 9068#L539-1 [2021-08-31 04:18:06,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2021-08-31 04:18:06,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:06,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095664983] [2021-08-31 04:18:06,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:06,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:06,293 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:06,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:06,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2074835667, now seen corresponding path program 1 times [2021-08-31 04:18:06,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:06,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826444998] [2021-08-31 04:18:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:06,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:06,322 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:06,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:06,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826444998] [2021-08-31 04:18:06,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826444998] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:06,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:06,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:06,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685194967] [2021-08-31 04:18:06,323 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:06,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:06,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:06,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:06,324 INFO L87 Difference]: Start difference. First operand 1366 states and 1918 transitions. cyclomatic complexity: 556 Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:06,660 INFO L93 Difference]: Finished difference Result 2413 states and 3309 transitions. [2021-08-31 04:18:06,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:06,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2413 states and 3309 transitions. [2021-08-31 04:18:06,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2352 [2021-08-31 04:18:06,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2413 states to 2413 states and 3309 transitions. [2021-08-31 04:18:06,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2413 [2021-08-31 04:18:06,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2413 [2021-08-31 04:18:06,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2413 states and 3309 transitions. [2021-08-31 04:18:06,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:06,689 INFO L681 BuchiCegarLoop]: Abstraction has 2413 states and 3309 transitions. [2021-08-31 04:18:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states and 3309 transitions. [2021-08-31 04:18:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2413. [2021-08-31 04:18:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2413 states, 2413 states have (on average 1.3713220058019064) internal successors, (3309), 2412 states have internal predecessors, (3309), 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:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3309 transitions. [2021-08-31 04:18:06,724 INFO L704 BuchiCegarLoop]: Abstraction has 2413 states and 3309 transitions. [2021-08-31 04:18:06,724 INFO L587 BuchiCegarLoop]: Abstraction has 2413 states and 3309 transitions. [2021-08-31 04:18:06,725 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 04:18:06,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2413 states and 3309 transitions. [2021-08-31 04:18:06,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2352 [2021-08-31 04:18:06,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:06,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:06,735 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, 1, 1, 1, 1, 1] [2021-08-31 04:18:06,735 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:06,736 INFO L791 eck$LassoCheckResult]: Stem: 12881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 12768#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 12769#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 12757#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12758#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12814#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 12863#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 12875#L109 assume !(1 == ~P_1_pc~0); 12876#L109-2 is_P_1_triggered_~__retres1~0 := 0; 12783#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12750#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 12704#L469 assume !(0 != activate_threads_~tmp~1); 12705#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12761#L177 assume !(1 == ~P_2_pc~0); 12799#L177-2 is_P_2_triggered_~__retres1~1 := 0; 12728#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12729#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 12751#L477 assume !(0 != activate_threads_~tmp___0~1); 12752#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 12810#L259 assume !(1 == ~C_1_pc~0); 12811#L259-2 assume !(2 == ~C_1_pc~0); 12864#L269-1 is_C_1_triggered_~__retres1~2 := 0; 12855#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 12715#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 12716#L485 assume !(0 != activate_threads_~tmp___1~1); 12856#L539-1 [2021-08-31 04:18:06,736 INFO L793 eck$LassoCheckResult]: Loop: 12856#L539-1 assume !false; 14553#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 14551#L388 assume !false; 14550#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 14534#L319 assume !(0 == ~P_1_st~0); 14535#L323 assume !(0 == ~P_2_st~0); 14764#L327 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 14761#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 14759#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 14756#L353 assume !(0 != eval_~tmp___2~0); 14754#L404 start_simulation_~kernel_st~0 := 2; 14752#L289-1 start_simulation_~kernel_st~0 := 3; 14750#L415 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14749#L109-6 assume !(1 == ~P_1_pc~0); 14748#L109-8 is_P_1_triggered_~__retres1~0 := 0; 14746#L120-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 14744#L121-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 14741#L469-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 14739#L469-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14735#L177-6 assume !(1 == ~P_2_pc~0); 14733#L177-8 is_P_2_triggered_~__retres1~1 := 0; 14731#L188-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14729#L189-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 14727#L477-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 14725#L477-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 14723#L259-6 assume !(1 == ~C_1_pc~0); 14721#L259-8 assume !(2 == ~C_1_pc~0); 14719#L269-5 is_C_1_triggered_~__retres1~2 := 0; 14717#L280-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14715#L281-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 14713#L485-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 14711#L485-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 14708#L319-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 14706#L336-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 14704#L337-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 14702#L558 assume !(0 == start_simulation_~tmp~3); 14700#L558-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 14698#L319-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 14697#L336-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 14694#L337-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 14693#L513 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14692#L520 stop_simulation_#res := stop_simulation_~__retres2~0; 14691#L521 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 14690#L571 assume !(0 != start_simulation_~tmp___0~2); 12856#L539-1 [2021-08-31 04:18:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2021-08-31 04:18:06,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:06,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64559315] [2021-08-31 04:18:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:06,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:06,743 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:06,754 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 296903595, now seen corresponding path program 1 times [2021-08-31 04:18:06,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:06,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942951073] [2021-08-31 04:18:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:06,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:06,819 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:06,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:06,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942951073] [2021-08-31 04:18:06,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942951073] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:06,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:06,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:18:06,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153434104] [2021-08-31 04:18:06,821 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:18:06,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:18:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:18:06,822 INFO L87 Difference]: Start difference. First operand 2413 states and 3309 transitions. cyclomatic complexity: 900 Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:07,565 INFO L93 Difference]: Finished difference Result 3940 states and 5434 transitions. [2021-08-31 04:18:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 04:18:07,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3940 states and 5434 transitions. [2021-08-31 04:18:07,588 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3853 [2021-08-31 04:18:07,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3940 states to 3940 states and 5434 transitions. [2021-08-31 04:18:07,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3940 [2021-08-31 04:18:07,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3940 [2021-08-31 04:18:07,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3940 states and 5434 transitions. [2021-08-31 04:18:07,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:07,616 INFO L681 BuchiCegarLoop]: Abstraction has 3940 states and 5434 transitions. [2021-08-31 04:18:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states and 5434 transitions. [2021-08-31 04:18:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 2199. [2021-08-31 04:18:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 2199 states have (on average 1.360618462937699) internal successors, (2992), 2198 states have internal predecessors, (2992), 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:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2992 transitions. [2021-08-31 04:18:07,662 INFO L704 BuchiCegarLoop]: Abstraction has 2199 states and 2992 transitions. [2021-08-31 04:18:07,662 INFO L587 BuchiCegarLoop]: Abstraction has 2199 states and 2992 transitions. [2021-08-31 04:18:07,662 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 04:18:07,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2199 states and 2992 transitions. [2021-08-31 04:18:07,669 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2112 [2021-08-31 04:18:07,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:07,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:07,670 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:07,670 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:07,671 INFO L791 eck$LassoCheckResult]: Stem: 19241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 19131#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 19132#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 19121#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 19122#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 19174#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 19218#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 19233#L109 assume !(1 == ~P_1_pc~0); 19234#L109-2 is_P_1_triggered_~__retres1~0 := 0; 19147#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19113#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 19071#L469 assume !(0 != activate_threads_~tmp~1); 19072#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 19126#L177 assume !(1 == ~P_2_pc~0); 19159#L177-2 is_P_2_triggered_~__retres1~1 := 0; 19093#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 19094#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 19114#L477 assume !(0 != activate_threads_~tmp___0~1); 19115#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 19172#L259 assume !(1 == ~C_1_pc~0); 19173#L259-2 assume !(2 == ~C_1_pc~0); 19219#L269-1 is_C_1_triggered_~__retres1~2 := 0; 19213#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 19081#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 19082#L485 assume !(0 != activate_threads_~tmp___1~1); 19214#L539-1 assume !false; 19589#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 19477#L388 [2021-08-31 04:18:07,671 INFO L793 eck$LassoCheckResult]: Loop: 19477#L388 assume !false; 19588#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 19586#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 19585#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 19584#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 19583#L353 assume 0 != eval_~tmp___2~0; 19580#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 19578#L362 assume !(0 != eval_~tmp~0); 19493#L358 assume !(0 == ~P_2_st~0); 19486#L373 assume !(0 == ~C_1_st~0); 19477#L388 [2021-08-31 04:18:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2021-08-31 04:18:07,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:07,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652160916] [2021-08-31 04:18:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:07,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:07,678 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:07,688 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2021-08-31 04:18:07,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:07,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328578892] [2021-08-31 04:18:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:07,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:07,693 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:07,703 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2021-08-31 04:18:07,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:07,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035478983] [2021-08-31 04:18:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:07,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:07,723 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:07,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:07,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035478983] [2021-08-31 04:18:07,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035478983] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:07,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:07,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:07,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713759789] [2021-08-31 04:18:07,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:07,793 INFO L87 Difference]: Start difference. First operand 2199 states and 2992 transitions. cyclomatic complexity: 800 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:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:08,153 INFO L93 Difference]: Finished difference Result 3650 states and 4893 transitions. [2021-08-31 04:18:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:08,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 4893 transitions. [2021-08-31 04:18:08,171 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3517 [2021-08-31 04:18:08,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 4893 transitions. [2021-08-31 04:18:08,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650 [2021-08-31 04:18:08,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650 [2021-08-31 04:18:08,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 4893 transitions. [2021-08-31 04:18:08,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:08,219 INFO L681 BuchiCegarLoop]: Abstraction has 3650 states and 4893 transitions. [2021-08-31 04:18:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 4893 transitions. [2021-08-31 04:18:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3574. [2021-08-31 04:18:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3574 states, 3574 states have (on average 1.342753217683268) internal successors, (4799), 3573 states have internal predecessors, (4799), 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:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4799 transitions. [2021-08-31 04:18:08,276 INFO L704 BuchiCegarLoop]: Abstraction has 3574 states and 4799 transitions. [2021-08-31 04:18:08,277 INFO L587 BuchiCegarLoop]: Abstraction has 3574 states and 4799 transitions. [2021-08-31 04:18:08,277 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 04:18:08,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3574 states and 4799 transitions. [2021-08-31 04:18:08,288 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2021-08-31 04:18:08,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:08,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:08,291 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:08,291 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:08,291 INFO L791 eck$LassoCheckResult]: Stem: 25119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 24993#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 24994#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 24981#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 24982#L296-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25037#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 25113#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 25114#L109 assume !(1 == ~P_1_pc~0); 25125#L109-2 is_P_1_triggered_~__retres1~0 := 0; 25126#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 24973#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 24974#L469 assume !(0 != activate_threads_~tmp~1); 24985#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 24986#L177 assume !(1 == ~P_2_pc~0); 25120#L177-2 is_P_2_triggered_~__retres1~1 := 0; 25121#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 25069#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 25070#L477 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 24976#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 25033#L259 assume !(1 == ~C_1_pc~0); 25034#L259-2 assume !(2 == ~C_1_pc~0); 25089#L269-1 is_C_1_triggered_~__retres1~2 := 0; 25090#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 24938#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 24939#L485 assume !(0 != activate_threads_~tmp___1~1); 27623#L539-1 assume !false; 27621#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 27617#L388 [2021-08-31 04:18:08,291 INFO L793 eck$LassoCheckResult]: Loop: 27617#L388 assume !false; 27614#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27611#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 27607#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27604#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 27601#L353 assume 0 != eval_~tmp___2~0; 27593#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 27589#L362 assume !(0 != eval_~tmp~0); 26849#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 26831#L377 assume !(0 != eval_~tmp___0~0); 27585#L373 assume !(0 == ~C_1_st~0); 27617#L388 [2021-08-31 04:18:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1311379569, now seen corresponding path program 1 times [2021-08-31 04:18:08,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:08,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53136506] [2021-08-31 04:18:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:08,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:08,330 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:08,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:08,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53136506] [2021-08-31 04:18:08,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53136506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:08,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:08,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:18:08,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578041820] [2021-08-31 04:18:08,332 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:18:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2021-08-31 04:18:08,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:08,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448004279] [2021-08-31 04:18:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:08,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,337 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,346 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:08,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:08,423 INFO L87 Difference]: Start difference. First operand 3574 states and 4799 transitions. cyclomatic complexity: 1232 Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:08,653 INFO L93 Difference]: Finished difference Result 3552 states and 4774 transitions. [2021-08-31 04:18:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:08,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3552 states and 4774 transitions. [2021-08-31 04:18:08,670 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2021-08-31 04:18:08,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3552 states to 3552 states and 4774 transitions. [2021-08-31 04:18:08,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3552 [2021-08-31 04:18:08,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3552 [2021-08-31 04:18:08,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3552 states and 4774 transitions. [2021-08-31 04:18:08,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:08,701 INFO L681 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2021-08-31 04:18:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states and 4774 transitions. [2021-08-31 04:18:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3552. [2021-08-31 04:18:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3552 states, 3552 states have (on average 1.3440315315315314) internal successors, (4774), 3551 states have internal predecessors, (4774), 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:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4774 transitions. [2021-08-31 04:18:08,758 INFO L704 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2021-08-31 04:18:08,759 INFO L587 BuchiCegarLoop]: Abstraction has 3552 states and 4774 transitions. [2021-08-31 04:18:08,759 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 04:18:08,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3552 states and 4774 transitions. [2021-08-31 04:18:08,773 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3441 [2021-08-31 04:18:08,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:08,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:08,774 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:08,774 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:08,775 INFO L791 eck$LassoCheckResult]: Stem: 32240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 32124#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 32125#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 32113#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 32114#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 32169#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 32219#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 32234#L109 assume !(1 == ~P_1_pc~0); 32235#L109-2 is_P_1_triggered_~__retres1~0 := 0; 32137#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 32106#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 32058#L469 assume !(0 != activate_threads_~tmp~1); 32059#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 32117#L177 assume !(1 == ~P_2_pc~0); 32153#L177-2 is_P_2_triggered_~__retres1~1 := 0; 32082#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 32083#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 32107#L477 assume !(0 != activate_threads_~tmp___0~1); 32108#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 32165#L259 assume !(1 == ~C_1_pc~0); 32166#L259-2 assume !(2 == ~C_1_pc~0); 32220#L269-1 is_C_1_triggered_~__retres1~2 := 0; 32212#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 32069#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 32070#L485 assume !(0 != activate_threads_~tmp___1~1); 32213#L539-1 assume !false; 34874#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 33335#L388 [2021-08-31 04:18:08,775 INFO L793 eck$LassoCheckResult]: Loop: 33335#L388 assume !false; 34871#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 34869#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 34867#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 34865#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 34863#L353 assume 0 != eval_~tmp___2~0; 34861#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 32244#L362 assume !(0 != eval_~tmp~0); 32246#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 33407#L377 assume !(0 != eval_~tmp___0~0); 33401#L373 assume !(0 == ~C_1_st~0); 33335#L388 [2021-08-31 04:18:08,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2021-08-31 04:18:08,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:08,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947578312] [2021-08-31 04:18:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:08,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,783 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 2 times [2021-08-31 04:18:08,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:08,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027949635] [2021-08-31 04:18:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:08,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,819 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:08,824 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2021-08-31 04:18:08,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:08,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858449370] [2021-08-31 04:18:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:08,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:18:08,854 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:08,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:18:08,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858449370] [2021-08-31 04:18:08,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858449370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:18:08,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:18:08,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-31 04:18:08,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666436180] [2021-08-31 04:18:08,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:18:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:18:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:18:08,911 INFO L87 Difference]: Start difference. First operand 3552 states and 4774 transitions. cyclomatic complexity: 1229 Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:18:09,225 INFO L93 Difference]: Finished difference Result 6198 states and 8252 transitions. [2021-08-31 04:18:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:18:09,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6198 states and 8252 transitions. [2021-08-31 04:18:09,275 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6003 [2021-08-31 04:18:09,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6198 states to 6198 states and 8252 transitions. [2021-08-31 04:18:09,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6198 [2021-08-31 04:18:09,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6198 [2021-08-31 04:18:09,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6198 states and 8252 transitions. [2021-08-31 04:18:09,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:18:09,308 INFO L681 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2021-08-31 04:18:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6198 states and 8252 transitions. [2021-08-31 04:18:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6198 to 6198. [2021-08-31 04:18:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6198 states, 6198 states have (on average 1.3313972249112618) internal successors, (8252), 6197 states have internal predecessors, (8252), 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:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6198 states to 6198 states and 8252 transitions. [2021-08-31 04:18:09,425 INFO L704 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2021-08-31 04:18:09,426 INFO L587 BuchiCegarLoop]: Abstraction has 6198 states and 8252 transitions. [2021-08-31 04:18:09,426 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 04:18:09,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6198 states and 8252 transitions. [2021-08-31 04:18:09,453 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6003 [2021-08-31 04:18:09,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:18:09,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:18:09,454 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:09,454 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:18:09,454 INFO L791 eck$LassoCheckResult]: Stem: 42002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 41881#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 41882#L591 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 41870#L289 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 41871#L296-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 41928#L301-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 41975#L306-1 havoc activate_threads_#t~ret12, activate_threads_#t~ret13, activate_threads_#t~ret14, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 41994#L109 assume !(1 == ~P_1_pc~0); 41995#L109-2 is_P_1_triggered_~__retres1~0 := 0; 41895#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 41863#L121 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 41816#L469 assume !(0 != activate_threads_~tmp~1); 41817#L469-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 41874#L177 assume !(1 == ~P_2_pc~0); 41912#L177-2 is_P_2_triggered_~__retres1~1 := 0; 41840#L188 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 41841#L189 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 41864#L477 assume !(0 != activate_threads_~tmp___0~1); 41865#L477-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 41924#L259 assume !(1 == ~C_1_pc~0); 41925#L259-2 assume !(2 == ~C_1_pc~0); 41976#L269-1 is_C_1_triggered_~__retres1~2 := 0; 41970#L280 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 41827#L281 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 41828#L485 assume !(0 != activate_threads_~tmp___1~1); 41971#L539-1 assume !false; 43539#L540 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 43537#L388 [2021-08-31 04:18:09,454 INFO L793 eck$LassoCheckResult]: Loop: 43537#L388 assume !false; 43535#L349 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 43532#L319 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 43529#L336 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 43527#L337 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 43525#L353 assume 0 != eval_~tmp___2~0; 43523#L353-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 43520#L362 assume !(0 != eval_~tmp~0); 42684#L358 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 42685#L377 assume !(0 != eval_~tmp___0~0); 43236#L373 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 43237#L392 assume !(0 != eval_~tmp___1~0); 43537#L388 [2021-08-31 04:18:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2021-08-31 04:18:09,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:09,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380648195] [2021-08-31 04:18:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:09,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,461 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2021-08-31 04:18:09,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:09,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453643239] [2021-08-31 04:18:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:09,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,474 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:18:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2021-08-31 04:18:09,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:18:09,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456946140] [2021-08-31 04:18:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:18:09,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:18:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,484 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:18:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:18:09,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:18:10,672 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:10,675 INFO L158 Benchmark]: Toolchain (without parser) took 9371.07ms. Allocated memory was 60.8MB in the beginning and 232.8MB in the end (delta: 172.0MB). Free memory was 40.9MB in the beginning and 164.6MB in the end (delta: -123.7MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,676 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:18:10,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.20ms. Allocated memory is still 60.8MB. Free memory was 40.7MB in the beginning and 42.1MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.06ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 39.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,676 INFO L158 Benchmark]: Boogie Preprocessor took 56.48ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 37.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,677 INFO L158 Benchmark]: RCFGBuilder took 446.27ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 36.9MB in the beginning and 54.0MB in the end (delta: -17.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,677 INFO L158 Benchmark]: BuchiAutomizer took 8482.72ms. Allocated memory was 75.5MB in the beginning and 232.8MB in the end (delta: 157.3MB). Free memory was 54.0MB in the beginning and 164.6MB in the end (delta: -110.6MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2021-08-31 04:18:10,679 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.67ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.20ms. Allocated memory is still 60.8MB. Free memory was 40.7MB in the beginning and 42.1MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.06ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 39.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.48ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 37.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.27ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 36.9MB in the beginning and 54.0MB in the end (delta: -17.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 8482.72ms. Allocated memory was 75.5MB in the beginning and 232.8MB in the end (delta: 157.3MB). Free memory was 54.0MB in the beginning and 164.6MB in the end (delta: -110.6MB). Peak memory consumption was 110.3MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 6198 locations. * 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:10,719 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...