./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:09:36,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:09:36,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:09:36,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:09:36,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:09:36,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:09:36,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:09:36,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:09:36,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:09:36,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:09:36,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:09:36,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:09:36,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:09:36,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:09:36,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:09:36,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:09:36,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:09:36,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:09:36,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:09:36,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:09:36,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:09:36,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:09:36,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:09:36,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:09:36,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:09:36,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:09:36,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:09:36,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:09:36,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:09:36,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:09:36,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:09:36,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:09:36,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:09:36,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:09:36,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:09:36,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:09:36,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:09:36,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:09:36,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:09:36,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:09:36,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:09:36,158 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-09 09:09:36,203 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:09:36,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:09:36,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:09:36,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:09:36,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:09:36,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:09:36,216 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:09:36,216 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-09 09:09:36,216 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-09 09:09:36,216 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-09 09:09:36,218 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-09 09:09:36,218 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-09 09:09:36,218 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-09 09:09:36,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:09:36,219 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:09:36,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 09:09:36,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:09:36,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:09:36,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:09:36,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-09 09:09:36,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-09 09:09:36,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-09 09:09:36,221 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:09:36,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:09:36,221 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-09 09:09:36,221 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:09:36,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-09 09:09:36,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:09:36,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:09:36,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:09:36,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:09:36,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:09:36,226 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-09 09:09:36,226 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 941010afb19994aa6e2e07f5c4b80f87a4c5e60b4e0ef3217e91339d9dc3aacb [2021-11-09 09:09:36,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:09:36,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:09:36,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:09:36,543 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:09:36,544 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:09:36,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/systemc/kundu.cil.c [2021-11-09 09:09:36,615 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/data/dcfbbba8a/4a4015273c674ac8acfb7cde44901657/FLAG5ab9bcea9 [2021-11-09 09:09:37,133 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:09:37,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/sv-benchmarks/c/systemc/kundu.cil.c [2021-11-09 09:09:37,144 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/data/dcfbbba8a/4a4015273c674ac8acfb7cde44901657/FLAG5ab9bcea9 [2021-11-09 09:09:37,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/data/dcfbbba8a/4a4015273c674ac8acfb7cde44901657 [2021-11-09 09:09:37,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:09:37,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:09:37,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:09:37,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:09:37,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:09:37,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:37,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f0618f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37, skipping insertion in model container [2021-11-09 09:09:37,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:37,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:09:37,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:09:37,718 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/sv-benchmarks/c/systemc/kundu.cil.c[635,648] [2021-11-09 09:09:37,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:09:37,797 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:09:37,812 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/sv-benchmarks/c/systemc/kundu.cil.c[635,648] [2021-11-09 09:09:37,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:09:37,889 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:09:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37 WrapperNode [2021-11-09 09:09:37,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:09:37,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:09:37,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:09:37,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:09:37,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:37,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:37,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:09:37,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:09:37,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:09:37,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:09:37,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:37,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:09:38,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:09:38,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:09:38,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:09:38,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (1/1) ... [2021-11-09 09:09:38,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-09 09:09:38,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:09:38,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-09 09:09:38,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-09 09:09:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:09:38,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:09:38,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:09:38,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:09:38,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:09:38,870 INFO L299 CfgBuilder]: Removed 95 assume(true) statements. [2021-11-09 09:09:38,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:38 BoogieIcfgContainer [2021-11-09 09:09:38,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:09:38,879 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-09 09:09:38,879 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-09 09:09:38,882 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-09 09:09:38,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:09:38,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 09:09:37" (1/3) ... [2021-11-09 09:09:38,886 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15334b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:09:38, skipping insertion in model container [2021-11-09 09:09:38,886 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:09:38,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:09:37" (2/3) ... [2021-11-09 09:09:38,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15334b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 09:09:38, skipping insertion in model container [2021-11-09 09:09:38,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-09 09:09:38,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:38" (3/3) ... [2021-11-09 09:09:38,890 INFO L389 chiAutomizerObserver]: Analyzing ICFG kundu.cil.c [2021-11-09 09:09:38,956 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-09 09:09:38,956 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-09 09:09:38,956 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-09 09:09:38,956 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-09 09:09:38,956 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-09 09:09:38,957 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-09 09:09:38,957 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-09 09:09:38,957 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-09 09:09:38,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 177 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 176 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2021-11-09 09:09:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:39,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:39,030 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-11-09 09:09:39,030 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:39,030 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-09 09:09:39,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 177 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 176 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:39,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2021-11-09 09:09:39,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:39,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:39,048 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-11-09 09:09:39,048 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:39,061 INFO L791 eck$LassoCheckResult]: Stem: 157#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 68#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;~clk~0 := 0;~max_loop~0 := 8;~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; 67#L613true 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; 54#L298true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 44#L305-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 103#L310-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 155#L315-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; 121#L118true assume !(1 == ~P_1_pc~0); 83#L118-2true is_P_1_triggered_~__retres1~0 := 0; 148#L129true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 86#L130true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 7#L491true assume !(0 != activate_threads_~tmp~1); 152#L491-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 93#L186true assume 1 == ~P_2_pc~0; 161#L187true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 98#L197true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 97#L198true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 70#L499true assume !(0 != activate_threads_~tmp___0~1); 76#L499-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 38#L268true assume 1 == ~C_1_pc~0; 90#L269true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 63#L289true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 171#L290true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 39#L507true assume !(0 != activate_threads_~tmp___1~1); 122#L561-1true [2021-11-09 09:09:39,062 INFO L793 eck$LassoCheckResult]: Loop: 122#L561-1true assume !false; 109#L562true 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; 164#L397true assume !true; 165#L413true start_simulation_~kernel_st~0 := 2; 73#L298-1true start_simulation_~kernel_st~0 := 3; 145#L424true 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#L118-6true assume !(1 == ~P_1_pc~0); 9#L118-8true is_P_1_triggered_~__retres1~0 := 0; 24#L129-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 84#L130-2true activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 129#L491-6true assume !(0 != activate_threads_~tmp~1); 48#L491-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 92#L186-6true assume 1 == ~P_2_pc~0; 110#L187-2true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 141#L197-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 102#L198-2true activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 55#L499-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 53#L499-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 21#L268-6true assume 1 == ~C_1_pc~0; 168#L269-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 28#L289-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 140#L290-2true activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 36#L507-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 117#L507-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 100#L328-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 107#L345-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 43#L346-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 4#L580true assume !(0 == start_simulation_~tmp~3); 162#L580-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; 96#L328-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 150#L345-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 25#L346-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 114#L535true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 13#L542true stop_simulation_#res := stop_simulation_~__retres2~0; 75#L543true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 101#L593true assume !(0 != start_simulation_~tmp___0~2); 122#L561-1true [2021-11-09 09:09:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2021-11-09 09:09:39,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150418026] [2021-11-09 09:09:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150418026] [2021-11-09 09:09:39,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150418026] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:39,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758495356] [2021-11-09 09:09:39,318 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 312588654, now seen corresponding path program 1 times [2021-11-09 09:09:39,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449894713] [2021-11-09 09:09:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449894713] [2021-11-09 09:09:39,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449894713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:09:39,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943458748] [2021-11-09 09:09:39,365 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:39,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:39,390 INFO L87 Difference]: Start difference. First operand has 177 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 176 states have internal predecessors, (272), 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-11-09 09:09:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:39,431 INFO L93 Difference]: Finished difference Result 176 states and 259 transitions. [2021-11-09 09:09:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:39,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 259 transitions. [2021-11-09 09:09:39,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-11-09 09:09:39,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 168 states and 251 transitions. [2021-11-09 09:09:39,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2021-11-09 09:09:39,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2021-11-09 09:09:39,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 251 transitions. [2021-11-09 09:09:39,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:39,452 INFO L681 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-11-09 09:09:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 251 transitions. [2021-11-09 09:09:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-09 09:09:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.494047619047619) internal successors, (251), 167 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-11-09 09:09:39,529 INFO L704 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-11-09 09:09:39,529 INFO L587 BuchiCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-11-09 09:09:39,530 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-09 09:09:39,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 251 transitions. [2021-11-09 09:09:39,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-11-09 09:09:39,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:39,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:39,537 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-11-09 09:09:39,538 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-11-09 09:09:39,538 INFO L791 eck$LassoCheckResult]: Stem: 527#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 474#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;~clk~0 := 0;~max_loop~0 := 8;~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; 473#L613 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; 459#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 440#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 441#L310-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 509#L315-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; 515#L118 assume !(1 == ~P_1_pc~0); 491#L118-2 is_P_1_triggered_~__retres1~0 := 0; 492#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 495#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 371#L491 assume !(0 != activate_threads_~tmp~1); 372#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 500#L186 assume 1 == ~P_2_pc~0; 501#L187 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 391#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 505#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 476#L499 assume !(0 != activate_threads_~tmp___0~1); 477#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 433#L268 assume 1 == ~C_1_pc~0; 435#L269 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 469#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 470#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 436#L507 assume !(0 != activate_threads_~tmp___1~1); 437#L561-1 [2021-11-09 09:09:39,539 INFO L793 eck$LassoCheckResult]: Loop: 437#L561-1 assume !false; 512#L562 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; 394#L397 assume !false; 411#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 412#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 453#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 479#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 480#L362 assume !(0 != eval_~tmp___2~0); 528#L413 start_simulation_~kernel_st~0 := 2; 481#L298-1 start_simulation_~kernel_st~0 := 3; 482#L424 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; 526#L118-6 assume !(1 == ~P_1_pc~0); 373#L118-8 is_P_1_triggered_~__retres1~0 := 0; 374#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 408#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 490#L491-6 assume !(0 != activate_threads_~tmp~1); 447#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 448#L186-6 assume !(1 == ~P_2_pc~0); 449#L186-8 is_P_2_triggered_~__retres1~1 := 0; 450#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 508#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 460#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 458#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 399#L268-6 assume 1 == ~C_1_pc~0; 401#L269-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 413#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 414#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 428#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 429#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 507#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 376#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 439#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 362#L580 assume !(0 == start_simulation_~tmp~3); 363#L580-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; 502#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 503#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 406#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 407#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 382#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 383#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 484#L593 assume !(0 != start_simulation_~tmp___0~2); 437#L561-1 [2021-11-09 09:09:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2021-11-09 09:09:39,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957676432] [2021-11-09 09:09:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957676432] [2021-11-09 09:09:39,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957676432] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:39,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054243402] [2021-11-09 09:09:39,651 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:39,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1244283687, now seen corresponding path program 1 times [2021-11-09 09:09:39,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892844426] [2021-11-09 09:09:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892844426] [2021-11-09 09:09:39,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892844426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:39,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849404054] [2021-11-09 09:09:39,726 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:39,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:39,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:39,728 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. cyclomatic complexity: 84 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-11-09 09:09:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:39,748 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2021-11-09 09:09:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:39,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 250 transitions. [2021-11-09 09:09:39,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-11-09 09:09:39,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 250 transitions. [2021-11-09 09:09:39,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2021-11-09 09:09:39,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2021-11-09 09:09:39,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 250 transitions. [2021-11-09 09:09:39,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:39,756 INFO L681 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-11-09 09:09:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 250 transitions. [2021-11-09 09:09:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-11-09 09:09:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.4880952380952381) internal successors, (250), 167 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-11-09 09:09:39,772 INFO L704 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-11-09 09:09:39,773 INFO L587 BuchiCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-11-09 09:09:39,773 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-09 09:09:39,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 250 transitions. [2021-11-09 09:09:39,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2021-11-09 09:09:39,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:39,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:39,779 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-11-09 09:09:39,781 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-11-09 09:09:39,782 INFO L791 eck$LassoCheckResult]: Stem: 872#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 819#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;~clk~0 := 0;~max_loop~0 := 8;~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; 818#L613 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; 804#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 785#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 786#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 854#L315-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; 860#L118 assume !(1 == ~P_1_pc~0); 835#L118-2 is_P_1_triggered_~__retres1~0 := 0; 836#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 840#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 714#L491 assume !(0 != activate_threads_~tmp~1); 715#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 845#L186 assume 1 == ~P_2_pc~0; 846#L187 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 736#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 850#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 821#L499 assume !(0 != activate_threads_~tmp___0~1); 822#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 777#L268 assume 1 == ~C_1_pc~0; 779#L269 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 814#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 815#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 780#L507 assume !(0 != activate_threads_~tmp___1~1); 781#L561-1 [2021-11-09 09:09:39,782 INFO L793 eck$LassoCheckResult]: Loop: 781#L561-1 assume !false; 857#L562 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; 739#L397 assume !false; 754#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 755#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 797#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 824#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 825#L362 assume !(0 != eval_~tmp___2~0); 873#L413 start_simulation_~kernel_st~0 := 2; 826#L298-1 start_simulation_~kernel_st~0 := 3; 827#L424 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; 871#L118-6 assume 1 == ~P_1_pc~0; 823#L119-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 719#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 751#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 837#L491-6 assume !(0 != activate_threads_~tmp~1); 792#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 793#L186-6 assume !(1 == ~P_2_pc~0); 794#L186-8 is_P_2_triggered_~__retres1~1 := 0; 795#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 853#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 805#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 803#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 744#L268-6 assume 1 == ~C_1_pc~0; 746#L269-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 758#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 759#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 773#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 774#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 852#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 721#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 784#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 707#L580 assume !(0 == start_simulation_~tmp~3); 708#L580-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; 847#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 848#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 752#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 753#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 727#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 728#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 829#L593 assume !(0 != start_simulation_~tmp___0~2); 781#L561-1 [2021-11-09 09:09:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2021-11-09 09:09:39,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898130299] [2021-11-09 09:09:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898130299] [2021-11-09 09:09:39,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898130299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:09:39,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784850456] [2021-11-09 09:09:39,894 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1301427912, now seen corresponding path program 1 times [2021-11-09 09:09:39,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:39,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486779867] [2021-11-09 09:09:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:39,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:39,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:39,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486779867] [2021-11-09 09:09:39,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486779867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:39,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:39,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:39,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209060604] [2021-11-09 09:09:39,942 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:39,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:09:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:09:39,944 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. cyclomatic complexity: 83 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-11-09 09:09:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:40,114 INFO L93 Difference]: Finished difference Result 435 states and 632 transitions. [2021-11-09 09:09:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:09:40,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 435 states and 632 transitions. [2021-11-09 09:09:40,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 377 [2021-11-09 09:09:40,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 435 states to 435 states and 632 transitions. [2021-11-09 09:09:40,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2021-11-09 09:09:40,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 435 [2021-11-09 09:09:40,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 435 states and 632 transitions. [2021-11-09 09:09:40,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:40,143 INFO L681 BuchiCegarLoop]: Abstraction has 435 states and 632 transitions. [2021-11-09 09:09:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states and 632 transitions. [2021-11-09 09:09:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 395. [2021-11-09 09:09:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 395 states have (on average 1.4632911392405064) internal successors, (578), 394 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 578 transitions. [2021-11-09 09:09:40,181 INFO L704 BuchiCegarLoop]: Abstraction has 395 states and 578 transitions. [2021-11-09 09:09:40,181 INFO L587 BuchiCegarLoop]: Abstraction has 395 states and 578 transitions. [2021-11-09 09:09:40,181 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-09 09:09:40,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 578 transitions. [2021-11-09 09:09:40,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 362 [2021-11-09 09:09:40,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:40,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:40,197 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-11-09 09:09:40,197 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-11-09 09:09:40,198 INFO L791 eck$LassoCheckResult]: Stem: 1499#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 1437#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;~clk~0 := 0;~max_loop~0 := 8;~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; 1436#L613 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; 1422#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1404#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1405#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1474#L315-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; 1484#L118 assume !(1 == ~P_1_pc~0); 1457#L118-2 is_P_1_triggered_~__retres1~0 := 0; 1458#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1461#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1332#L491 assume !(0 != activate_threads_~tmp~1); 1333#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1465#L186 assume !(1 == ~P_2_pc~0); 1353#L186-2 is_P_2_triggered_~__retres1~1 := 0; 1354#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1469#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1442#L499 assume !(0 != activate_threads_~tmp___0~1); 1443#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1396#L268 assume 1 == ~C_1_pc~0; 1398#L269 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1431#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1432#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1399#L507 assume !(0 != activate_threads_~tmp___1~1); 1400#L561-1 [2021-11-09 09:09:40,198 INFO L793 eck$LassoCheckResult]: Loop: 1400#L561-1 assume !false; 1658#L562 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; 1504#L397 assume !false; 1372#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1373#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1416#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1444#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1445#L362 assume !(0 != eval_~tmp___2~0); 1503#L413 start_simulation_~kernel_st~0 := 2; 1446#L298-1 start_simulation_~kernel_st~0 := 3; 1447#L424 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; 1497#L118-6 assume !(1 == ~P_1_pc~0); 1334#L118-8 is_P_1_triggered_~__retres1~0 := 0; 1335#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1367#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1456#L491-6 assume !(0 != activate_threads_~tmp~1); 1410#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1411#L186-6 assume !(1 == ~P_2_pc~0); 1412#L186-8 is_P_2_triggered_~__retres1~1 := 0; 1413#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1473#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 1423#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1421#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1360#L268-6 assume 1 == ~C_1_pc~0; 1362#L269-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1374#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1375#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 1391#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1392#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1471#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1337#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1402#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 1323#L580 assume !(0 == start_simulation_~tmp~3); 1324#L580-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; 1677#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1674#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1671#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1670#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1668#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 1666#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1665#L593 assume !(0 != start_simulation_~tmp___0~2); 1400#L561-1 [2021-11-09 09:09:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2021-11-09 09:09:40,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913154084] [2021-11-09 09:09:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:40,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:40,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913154084] [2021-11-09 09:09:40,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913154084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:40,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:40,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:09:40,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526831675] [2021-11-09 09:09:40,283 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:40,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1244283687, now seen corresponding path program 2 times [2021-11-09 09:09:40,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553732700] [2021-11-09 09:09:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:40,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:40,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553732700] [2021-11-09 09:09:40,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553732700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:40,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:40,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:40,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618677375] [2021-11-09 09:09:40,342 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:40,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:09:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:09:40,343 INFO L87 Difference]: Start difference. First operand 395 states and 578 transitions. cyclomatic complexity: 185 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-11-09 09:09:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:40,521 INFO L93 Difference]: Finished difference Result 1091 states and 1558 transitions. [2021-11-09 09:09:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:09:40,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1091 states and 1558 transitions. [2021-11-09 09:09:40,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2021-11-09 09:09:40,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1091 states to 1091 states and 1558 transitions. [2021-11-09 09:09:40,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1091 [2021-11-09 09:09:40,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1091 [2021-11-09 09:09:40,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1091 states and 1558 transitions. [2021-11-09 09:09:40,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:40,553 INFO L681 BuchiCegarLoop]: Abstraction has 1091 states and 1558 transitions. [2021-11-09 09:09:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states and 1558 transitions. [2021-11-09 09:09:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1032. [2021-11-09 09:09:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1032 states have (on average 1.439922480620155) internal successors, (1486), 1031 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1486 transitions. [2021-11-09 09:09:40,591 INFO L704 BuchiCegarLoop]: Abstraction has 1032 states and 1486 transitions. [2021-11-09 09:09:40,591 INFO L587 BuchiCegarLoop]: Abstraction has 1032 states and 1486 transitions. [2021-11-09 09:09:40,591 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-09 09:09:40,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1032 states and 1486 transitions. [2021-11-09 09:09:40,602 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 994 [2021-11-09 09:09:40,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:40,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:40,604 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-11-09 09:09:40,605 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-11-09 09:09:40,606 INFO L791 eck$LassoCheckResult]: Stem: 3021#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 2945#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;~clk~0 := 0;~max_loop~0 := 8;~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; 2944#L613 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; 2927#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2908#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2909#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2986#L315-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; 2997#L118 assume !(1 == ~P_1_pc~0); 2967#L118-2 is_P_1_triggered_~__retres1~0 := 0; 2968#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2971#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2831#L491 assume !(0 != activate_threads_~tmp~1); 2832#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2977#L186 assume !(1 == ~P_2_pc~0); 2855#L186-2 is_P_2_triggered_~__retres1~1 := 0; 2856#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2981#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 2950#L499 assume !(0 != activate_threads_~tmp___0~1); 2951#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2902#L268 assume !(1 == ~C_1_pc~0); 2903#L268-2 assume 2 == ~C_1_pc~0; 2961#L279 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~2 := 1; 2938#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2939#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 2904#L507 assume !(0 != activate_threads_~tmp___1~1); 2905#L561-1 [2021-11-09 09:09:40,608 INFO L793 eck$LassoCheckResult]: Loop: 2905#L561-1 assume !false; 2999#L562 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; 3029#L397 assume !false; 3030#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3006#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2921#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2952#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2953#L362 assume !(0 != eval_~tmp___2~0); 3724#L413 start_simulation_~kernel_st~0 := 2; 3793#L298-1 start_simulation_~kernel_st~0 := 3; 3792#L424 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; 3791#L118-6 assume !(1 == ~P_1_pc~0); 3790#L118-8 is_P_1_triggered_~__retres1~0 := 0; 3789#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3787#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3785#L491-6 assume !(0 != activate_threads_~tmp~1); 3783#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3781#L186-6 assume !(1 == ~P_2_pc~0); 3779#L186-8 is_P_2_triggered_~__retres1~1 := 0; 3777#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3775#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 3773#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3771#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3769#L268-6 assume !(1 == ~C_1_pc~0); 3767#L268-8 assume !(2 == ~C_1_pc~0); 3764#L278-5 is_C_1_triggered_~__retres1~2 := 0; 3762#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3760#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 3758#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3755#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3749#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3747#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3745#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 3742#L580 assume !(0 == start_simulation_~tmp~3); 3741#L580-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; 3739#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3737#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3736#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 3735#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3734#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 3732#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 3731#L593 assume !(0 != start_simulation_~tmp___0~2); 2905#L561-1 [2021-11-09 09:09:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1720008278, now seen corresponding path program 1 times [2021-11-09 09:09:40,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,609 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643105180] [2021-11-09 09:09:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:40,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:40,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643105180] [2021-11-09 09:09:40,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643105180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:40,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:40,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:40,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726933362] [2021-11-09 09:09:40,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -661509382, now seen corresponding path program 1 times [2021-11-09 09:09:40,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178901840] [2021-11-09 09:09:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:40,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:40,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178901840] [2021-11-09 09:09:40,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178901840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:40,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:40,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:40,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258440010] [2021-11-09 09:09:40,766 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:40,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:40,768 INFO L87 Difference]: Start difference. First operand 1032 states and 1486 transitions. cyclomatic complexity: 458 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-11-09 09:09:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:40,829 INFO L93 Difference]: Finished difference Result 1366 states and 1936 transitions. [2021-11-09 09:09:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:40,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1366 states and 1936 transitions. [2021-11-09 09:09:40,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1323 [2021-11-09 09:09:40,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1366 states to 1366 states and 1936 transitions. [2021-11-09 09:09:40,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1366 [2021-11-09 09:09:40,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1366 [2021-11-09 09:09:40,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1366 states and 1936 transitions. [2021-11-09 09:09:40,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:40,869 INFO L681 BuchiCegarLoop]: Abstraction has 1366 states and 1936 transitions. [2021-11-09 09:09:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states and 1936 transitions. [2021-11-09 09:09:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1342. [2021-11-09 09:09:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1342 states have (on average 1.42026825633383) internal successors, (1906), 1341 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1906 transitions. [2021-11-09 09:09:40,906 INFO L704 BuchiCegarLoop]: Abstraction has 1342 states and 1906 transitions. [2021-11-09 09:09:40,906 INFO L587 BuchiCegarLoop]: Abstraction has 1342 states and 1906 transitions. [2021-11-09 09:09:40,906 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-09 09:09:40,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1342 states and 1906 transitions. [2021-11-09 09:09:40,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1299 [2021-11-09 09:09:40,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:40,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:40,919 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-11-09 09:09:40,919 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-11-09 09:09:40,919 INFO L791 eck$LassoCheckResult]: Stem: 5423#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 5346#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;~clk~0 := 0;~max_loop~0 := 8;~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; 5345#L613 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; 5329#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5311#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 5312#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5388#L315-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; 5397#L118 assume !(1 == ~P_1_pc~0); 5370#L118-2 is_P_1_triggered_~__retres1~0 := 0; 5371#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5374#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5238#L491 assume !(0 != activate_threads_~tmp~1); 5239#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5378#L186 assume !(1 == ~P_2_pc~0); 5261#L186-2 is_P_2_triggered_~__retres1~1 := 0; 5262#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5382#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 5351#L499 assume !(0 != activate_threads_~tmp___0~1); 5352#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5305#L268 assume !(1 == ~C_1_pc~0); 5306#L268-2 assume !(2 == ~C_1_pc~0); 5405#L278-1 is_C_1_triggered_~__retres1~2 := 0; 5341#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5342#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 5307#L507 assume !(0 != activate_threads_~tmp___1~1); 5308#L561-1 [2021-11-09 09:09:40,921 INFO L793 eck$LassoCheckResult]: Loop: 5308#L561-1 assume !false; 6359#L562 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; 6356#L397 assume !false; 6354#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6345#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6342#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6340#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 6337#L362 assume !(0 != eval_~tmp___2~0); 6338#L413 start_simulation_~kernel_st~0 := 2; 6546#L298-1 start_simulation_~kernel_st~0 := 3; 6545#L424 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; 6544#L118-6 assume !(1 == ~P_1_pc~0); 6543#L118-8 is_P_1_triggered_~__retres1~0 := 0; 6542#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6541#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6540#L491-6 assume !(0 != activate_threads_~tmp~1); 6539#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6538#L186-6 assume !(1 == ~P_2_pc~0); 6537#L186-8 is_P_2_triggered_~__retres1~1 := 0; 6535#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6533#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 6532#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 6531#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6529#L268-6 assume !(1 == ~C_1_pc~0); 6527#L268-8 assume !(2 == ~C_1_pc~0); 6526#L278-5 is_C_1_triggered_~__retres1~2 := 0; 6525#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6523#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 6521#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 6519#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6515#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6513#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6511#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6422#L580 assume !(0 == start_simulation_~tmp~3); 6421#L580-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; 6418#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6415#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6414#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 6409#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6371#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 6369#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6367#L593 assume !(0 != start_simulation_~tmp___0~2); 5308#L561-1 [2021-11-09 09:09:40,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2021-11-09 09:09:40,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531807381] [2021-11-09 09:09:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:40,948 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:40,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -661509382, now seen corresponding path program 2 times [2021-11-09 09:09:40,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:40,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961434621] [2021-11-09 09:09:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:40,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:41,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:41,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:41,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961434621] [2021-11-09 09:09:41,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961434621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:41,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:41,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:41,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244340026] [2021-11-09 09:09:41,036 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:41,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:09:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:09:41,037 INFO L87 Difference]: Start difference. First operand 1342 states and 1906 transitions. cyclomatic complexity: 568 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-11-09 09:09:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:41,135 INFO L93 Difference]: Finished difference Result 2379 states and 3348 transitions. [2021-11-09 09:09:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:09:41,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2379 states and 3348 transitions. [2021-11-09 09:09:41,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2318 [2021-11-09 09:09:41,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2379 states to 2379 states and 3348 transitions. [2021-11-09 09:09:41,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2379 [2021-11-09 09:09:41,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2379 [2021-11-09 09:09:41,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2379 states and 3348 transitions. [2021-11-09 09:09:41,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:41,212 INFO L681 BuchiCegarLoop]: Abstraction has 2379 states and 3348 transitions. [2021-11-09 09:09:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states and 3348 transitions. [2021-11-09 09:09:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1378. [2021-11-09 09:09:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1378 states have (on average 1.409288824383164) internal successors, (1942), 1377 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1942 transitions. [2021-11-09 09:09:41,252 INFO L704 BuchiCegarLoop]: Abstraction has 1378 states and 1942 transitions. [2021-11-09 09:09:41,252 INFO L587 BuchiCegarLoop]: Abstraction has 1378 states and 1942 transitions. [2021-11-09 09:09:41,252 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-09 09:09:41,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1378 states and 1942 transitions. [2021-11-09 09:09:41,261 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1335 [2021-11-09 09:09:41,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:41,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:41,263 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-11-09 09:09:41,263 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-11-09 09:09:41,263 INFO L791 eck$LassoCheckResult]: Stem: 9168#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 9086#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;~clk~0 := 0;~max_loop~0 := 8;~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; 9085#L613 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; 9068#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 9047#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 9048#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 9128#L315-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; 9141#L118 assume !(1 == ~P_1_pc~0); 9108#L118-2 is_P_1_triggered_~__retres1~0 := 0; 9109#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 9113#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8973#L491 assume !(0 != activate_threads_~tmp~1); 8974#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 9119#L186 assume !(1 == ~P_2_pc~0); 8993#L186-2 is_P_2_triggered_~__retres1~1 := 0; 8994#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 9123#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 9088#L499 assume !(0 != activate_threads_~tmp___0~1); 9089#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 9039#L268 assume !(1 == ~C_1_pc~0); 9040#L268-2 assume !(2 == ~C_1_pc~0); 9148#L278-1 is_C_1_triggered_~__retres1~2 := 0; 9081#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9082#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9041#L507 assume !(0 != activate_threads_~tmp___1~1); 9042#L561-1 [2021-11-09 09:09:41,263 INFO L793 eck$LassoCheckResult]: Loop: 9042#L561-1 assume !false; 10281#L562 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; 10279#L397 assume !false; 10218#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 10210#L328 assume !(0 == ~P_1_st~0); 10211#L332 assume !(0 == ~P_2_st~0); 10212#L336 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 10213#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 9093#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 9094#L362 assume !(0 != eval_~tmp___2~0); 9177#L413 start_simulation_~kernel_st~0 := 2; 9096#L298-1 start_simulation_~kernel_st~0 := 3; 9097#L424 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; 9165#L118-6 assume !(1 == ~P_1_pc~0); 10309#L118-8 is_P_1_triggered_~__retres1~0 := 0; 9010#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 9011#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 9110#L491-6 assume !(0 != activate_threads_~tmp~1); 9150#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 9117#L186-6 assume !(1 == ~P_2_pc~0); 9118#L186-8 is_P_2_triggered_~__retres1~1 := 0; 9159#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 9160#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 10306#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 10305#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 9001#L268-6 assume !(1 == ~C_1_pc~0); 9002#L268-8 assume !(2 == ~C_1_pc~0); 9100#L278-5 is_C_1_triggered_~__retres1~2 := 0; 9101#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 9157#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 9158#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 9137#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 9138#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 10301#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10299#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 10295#L580 assume !(0 == start_simulation_~tmp~3); 10294#L580-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; 10292#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 10290#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 10289#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 10288#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 10287#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 10286#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 10285#L593 assume !(0 != start_simulation_~tmp___0~2); 9042#L561-1 [2021-11-09 09:09:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2021-11-09 09:09:41,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367899079] [2021-11-09 09:09:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,274 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1255144909, now seen corresponding path program 1 times [2021-11-09 09:09:41,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424696919] [2021-11-09 09:09:41,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:41,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:41,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424696919] [2021-11-09 09:09:41,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424696919] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:41,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:41,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:41,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116243741] [2021-11-09 09:09:41,338 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:41,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:41,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:41,340 INFO L87 Difference]: Start difference. First operand 1378 states and 1942 transitions. cyclomatic complexity: 568 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-11-09 09:09:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:41,391 INFO L93 Difference]: Finished difference Result 2437 states and 3357 transitions. [2021-11-09 09:09:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:41,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2437 states and 3357 transitions. [2021-11-09 09:09:41,413 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2376 [2021-11-09 09:09:41,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2437 states to 2437 states and 3357 transitions. [2021-11-09 09:09:41,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2437 [2021-11-09 09:09:41,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2437 [2021-11-09 09:09:41,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2437 states and 3357 transitions. [2021-11-09 09:09:41,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:41,444 INFO L681 BuchiCegarLoop]: Abstraction has 2437 states and 3357 transitions. [2021-11-09 09:09:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states and 3357 transitions. [2021-11-09 09:09:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2437. [2021-11-09 09:09:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2437 states have (on average 1.377513336068937) internal successors, (3357), 2436 states have internal predecessors, (3357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3357 transitions. [2021-11-09 09:09:41,500 INFO L704 BuchiCegarLoop]: Abstraction has 2437 states and 3357 transitions. [2021-11-09 09:09:41,500 INFO L587 BuchiCegarLoop]: Abstraction has 2437 states and 3357 transitions. [2021-11-09 09:09:41,501 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-09 09:09:41,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2437 states and 3357 transitions. [2021-11-09 09:09:41,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2376 [2021-11-09 09:09:41,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:41,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:41,517 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-11-09 09:09:41,517 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-11-09 09:09:41,518 INFO L791 eck$LassoCheckResult]: Stem: 12990#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 12904#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;~clk~0 := 0;~max_loop~0 := 8;~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; 12903#L613 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; 12885#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12867#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12868#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 12944#L315-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; 12960#L118 assume !(1 == ~P_1_pc~0); 12924#L118-2 is_P_1_triggered_~__retres1~0 := 0; 12925#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12930#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 12794#L491 assume !(0 != activate_threads_~tmp~1); 12795#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12936#L186 assume !(1 == ~P_2_pc~0); 12814#L186-2 is_P_2_triggered_~__retres1~1 := 0; 12815#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12939#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 12906#L499 assume !(0 != activate_threads_~tmp___0~1); 12907#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 12860#L268 assume !(1 == ~C_1_pc~0); 12861#L268-2 assume !(2 == ~C_1_pc~0); 12966#L278-1 is_C_1_triggered_~__retres1~2 := 0; 12899#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 12900#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 12862#L507 assume !(0 != activate_threads_~tmp___1~1); 12863#L561-1 [2021-11-09 09:09:41,518 INFO L793 eck$LassoCheckResult]: Loop: 12863#L561-1 assume !false; 15189#L562 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; 14265#L397 assume !false; 15186#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15183#L328 assume !(0 == ~P_1_st~0); 12877#L332 assume !(0 == ~P_2_st~0); 12879#L336 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 12945#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15051#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 15035#L362 assume !(0 != eval_~tmp___2~0); 12998#L413 start_simulation_~kernel_st~0 := 2; 12999#L298-1 start_simulation_~kernel_st~0 := 3; 12982#L424 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; 12983#L118-6 assume !(1 == ~P_1_pc~0); 12798#L118-8 is_P_1_triggered_~__retres1~0 := 0; 12799#L129-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12926#L130-2 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 12927#L491-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 12873#L491-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12874#L186-6 assume !(1 == ~P_2_pc~0); 12875#L186-8 is_P_2_triggered_~__retres1~1 := 0; 12876#L197-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12943#L198-2 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 12888#L499-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 12889#L499-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15218#L268-6 assume !(1 == ~C_1_pc~0); 15217#L268-8 assume !(2 == ~C_1_pc~0); 15216#L278-5 is_C_1_triggered_~__retres1~2 := 0; 15215#L289-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15214#L290-2 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 15213#L507-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 15212#L507-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15181#L328-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15180#L345-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12866#L346-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 12787#L580 assume !(0 == start_simulation_~tmp~3); 12788#L580-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; 12994#L328-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15174#L345-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15202#L346-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 15200#L535 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15198#L542 stop_simulation_#res := stop_simulation_~__retres2~0; 15196#L543 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 15194#L593 assume !(0 != start_simulation_~tmp___0~2); 12863#L561-1 [2021-11-09 09:09:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2021-11-09 09:09:41,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650284728] [2021-11-09 09:09:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,528 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1116594353, now seen corresponding path program 1 times [2021-11-09 09:09:41,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432010681] [2021-11-09 09:09:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:41,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:41,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432010681] [2021-11-09 09:09:41,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432010681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:41,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:41,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:09:41,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943914805] [2021-11-09 09:09:41,606 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-09 09:09:41,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:09:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:09:41,607 INFO L87 Difference]: Start difference. First operand 2437 states and 3357 transitions. cyclomatic complexity: 924 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-11-09 09:09:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:41,764 INFO L93 Difference]: Finished difference Result 3970 states and 5494 transitions. [2021-11-09 09:09:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:09:41,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3970 states and 5494 transitions. [2021-11-09 09:09:41,796 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3883 [2021-11-09 09:09:41,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3970 states to 3970 states and 5494 transitions. [2021-11-09 09:09:41,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3970 [2021-11-09 09:09:41,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3970 [2021-11-09 09:09:41,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3970 states and 5494 transitions. [2021-11-09 09:09:41,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:41,838 INFO L681 BuchiCegarLoop]: Abstraction has 3970 states and 5494 transitions. [2021-11-09 09:09:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states and 5494 transitions. [2021-11-09 09:09:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 2217. [2021-11-09 09:09:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2217 states have (on average 1.365809652683807) internal successors, (3028), 2216 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3028 transitions. [2021-11-09 09:09:41,903 INFO L704 BuchiCegarLoop]: Abstraction has 2217 states and 3028 transitions. [2021-11-09 09:09:41,903 INFO L587 BuchiCegarLoop]: Abstraction has 2217 states and 3028 transitions. [2021-11-09 09:09:41,903 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-09 09:09:41,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2217 states and 3028 transitions. [2021-11-09 09:09:41,918 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2130 [2021-11-09 09:09:41,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:41,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:41,919 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-11-09 09:09:41,919 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:41,920 INFO L791 eck$LassoCheckResult]: Stem: 19403#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 19324#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;~clk~0 := 0;~max_loop~0 := 8;~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; 19323#L613 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; 19305#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 19287#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 19288#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 19367#L315-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; 19377#L118 assume !(1 == ~P_1_pc~0); 19347#L118-2 is_P_1_triggered_~__retres1~0 := 0; 19348#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19351#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 19216#L491 assume !(0 != activate_threads_~tmp~1); 19217#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 19359#L186 assume !(1 == ~P_2_pc~0); 19239#L186-2 is_P_2_triggered_~__retres1~1 := 0; 19240#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 19362#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 19326#L499 assume !(0 != activate_threads_~tmp___0~1); 19327#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 19280#L268 assume !(1 == ~C_1_pc~0); 19281#L268-2 assume !(2 == ~C_1_pc~0); 19384#L278-1 is_C_1_triggered_~__retres1~2 := 0; 19319#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 19320#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 19282#L507 assume !(0 != activate_threads_~tmp___1~1); 19283#L561-1 assume !false; 19769#L562 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; 19603#L397 [2021-11-09 09:09:41,920 INFO L793 eck$LassoCheckResult]: Loop: 19603#L397 assume !false; 19768#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 20178#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 20179#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 20250#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 19749#L362 assume 0 != eval_~tmp___2~0; 19750#L362-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 20160#L371 assume !(0 != eval_~tmp~0); 19652#L367 assume !(0 == ~P_2_st~0); 19633#L382 assume !(0 == ~C_1_st~0); 19603#L397 [2021-11-09 09:09:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2021-11-09 09:09:41,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514410800] [2021-11-09 09:09:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,936 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,969 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2021-11-09 09:09:41,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668206466] [2021-11-09 09:09:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,974 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:41,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2021-11-09 09:09:41,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:41,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128506305] [2021-11-09 09:09:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:41,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:42,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:42,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128506305] [2021-11-09 09:09:42,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128506305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:42,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:42,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:42,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854294975] [2021-11-09 09:09:42,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:42,173 INFO L87 Difference]: Start difference. First operand 2217 states and 3028 transitions. cyclomatic complexity: 818 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:42,252 INFO L93 Difference]: Finished difference Result 3686 states and 4965 transitions. [2021-11-09 09:09:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:42,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3686 states and 4965 transitions. [2021-11-09 09:09:42,293 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3553 [2021-11-09 09:09:42,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3686 states to 3686 states and 4965 transitions. [2021-11-09 09:09:42,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3686 [2021-11-09 09:09:42,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3686 [2021-11-09 09:09:42,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3686 states and 4965 transitions. [2021-11-09 09:09:42,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:42,334 INFO L681 BuchiCegarLoop]: Abstraction has 3686 states and 4965 transitions. [2021-11-09 09:09:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states and 4965 transitions. [2021-11-09 09:09:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3610. [2021-11-09 09:09:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3610 states have (on average 1.3493074792243767) internal successors, (4871), 3609 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4871 transitions. [2021-11-09 09:09:42,420 INFO L704 BuchiCegarLoop]: Abstraction has 3610 states and 4871 transitions. [2021-11-09 09:09:42,420 INFO L587 BuchiCegarLoop]: Abstraction has 3610 states and 4871 transitions. [2021-11-09 09:09:42,420 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-09 09:09:42,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3610 states and 4871 transitions. [2021-11-09 09:09:42,436 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2021-11-09 09:09:42,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:42,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:42,439 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-11-09 09:09:42,439 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:42,440 INFO L791 eck$LassoCheckResult]: Stem: 25329#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 25236#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;~clk~0 := 0;~max_loop~0 := 8;~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; 25235#L613 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; 25213#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 25195#L305-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25196#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 25280#L315-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; 25301#L118 assume !(1 == ~P_1_pc~0); 25260#L118-2 is_P_1_triggered_~__retres1~0 := 0; 25261#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 25265#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 25125#L491 assume !(0 != activate_threads_~tmp~1); 25126#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 25272#L186 assume !(1 == ~P_2_pc~0); 25145#L186-2 is_P_2_triggered_~__retres1~1 := 0; 25146#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 25275#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 25239#L499 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 25240#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 26627#L268 assume !(1 == ~C_1_pc~0); 26626#L268-2 assume !(2 == ~C_1_pc~0); 25308#L278-1 is_C_1_triggered_~__retres1~2 := 0; 25228#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 25229#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 25347#L507 assume !(0 != activate_threads_~tmp___1~1); 26602#L561-1 assume !false; 26557#L562 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; 26558#L397 [2021-11-09 09:09:42,440 INFO L793 eck$LassoCheckResult]: Loop: 26558#L397 assume !false; 28287#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 28286#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 28285#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 28284#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 28281#L362 assume 0 != eval_~tmp___2~0; 28277#L362-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 28278#L371 assume !(0 != eval_~tmp~0); 28314#L367 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 28313#L386 assume !(0 != eval_~tmp___0~0); 28288#L382 assume !(0 == ~C_1_st~0); 26558#L397 [2021-11-09 09:09:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1311379569, now seen corresponding path program 1 times [2021-11-09 09:09:42,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:42,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861810786] [2021-11-09 09:09:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:42,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:42,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:42,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861810786] [2021-11-09 09:09:42,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861810786] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:42,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:42,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:09:42,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955308125] [2021-11-09 09:09:42,471 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-09 09:09:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2021-11-09 09:09:42,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:42,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114272708] [2021-11-09 09:09:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:42,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,478 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,488 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:42,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:42,621 INFO L87 Difference]: Start difference. First operand 3610 states and 4871 transitions. cyclomatic complexity: 1268 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-11-09 09:09:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:42,647 INFO L93 Difference]: Finished difference Result 3588 states and 4846 transitions. [2021-11-09 09:09:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:42,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3588 states and 4846 transitions. [2021-11-09 09:09:42,669 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2021-11-09 09:09:42,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3588 states to 3588 states and 4846 transitions. [2021-11-09 09:09:42,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3588 [2021-11-09 09:09:42,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3588 [2021-11-09 09:09:42,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3588 states and 4846 transitions. [2021-11-09 09:09:42,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:42,779 INFO L681 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2021-11-09 09:09:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states and 4846 transitions. [2021-11-09 09:09:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3588. [2021-11-09 09:09:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 3588 states have (on average 1.350613154960981) internal successors, (4846), 3587 states have internal predecessors, (4846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4846 transitions. [2021-11-09 09:09:42,877 INFO L704 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2021-11-09 09:09:42,878 INFO L587 BuchiCegarLoop]: Abstraction has 3588 states and 4846 transitions. [2021-11-09 09:09:42,878 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-09 09:09:42,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3588 states and 4846 transitions. [2021-11-09 09:09:42,896 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 3477 [2021-11-09 09:09:42,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:42,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:42,898 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-11-09 09:09:42,898 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:42,898 INFO L791 eck$LassoCheckResult]: Stem: 32531#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 32445#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;~clk~0 := 0;~max_loop~0 := 8;~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; 32444#L613 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; 32423#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 32405#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 32406#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 32490#L315-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; 32507#L118 assume !(1 == ~P_1_pc~0); 32467#L118-2 is_P_1_triggered_~__retres1~0 := 0; 32468#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 32472#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 32329#L491 assume !(0 != activate_threads_~tmp~1); 32330#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 32480#L186 assume !(1 == ~P_2_pc~0); 32349#L186-2 is_P_2_triggered_~__retres1~1 := 0; 32350#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 32483#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 32447#L499 assume !(0 != activate_threads_~tmp___0~1); 32448#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 32395#L268 assume !(1 == ~C_1_pc~0); 32396#L268-2 assume !(2 == ~C_1_pc~0); 32514#L278-1 is_C_1_triggered_~__retres1~2 := 0; 32438#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 32439#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 32397#L507 assume !(0 != activate_threads_~tmp___1~1); 32398#L561-1 assume !false; 33577#L562 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; 33578#L397 [2021-11-09 09:09:42,898 INFO L793 eck$LassoCheckResult]: Loop: 33578#L397 assume !false; 34571#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 34569#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 34566#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 34564#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 34562#L362 assume 0 != eval_~tmp___2~0; 34560#L362-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 34557#L371 assume !(0 != eval_~tmp~0); 34552#L367 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 34550#L386 assume !(0 != eval_~tmp___0~0); 34551#L382 assume !(0 == ~C_1_st~0); 33578#L397 [2021-11-09 09:09:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2021-11-09 09:09:42,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:42,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471700997] [2021-11-09 09:09:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:42,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,910 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,930 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:42,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 2 times [2021-11-09 09:09:42,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:42,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869333583] [2021-11-09 09:09:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:42,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,937 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:42,943 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2021-11-09 09:09:42,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:42,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268706521] [2021-11-09 09:09:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:42,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:09:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:09:42,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:09:42,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268706521] [2021-11-09 09:09:42,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268706521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:09:42,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:09:42,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:09:42,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27420929] [2021-11-09 09:09:43,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:09:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:09:43,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:09:43,121 INFO L87 Difference]: Start difference. First operand 3588 states and 4846 transitions. cyclomatic complexity: 1265 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-11-09 09:09:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:09:43,211 INFO L93 Difference]: Finished difference Result 6270 states and 8396 transitions. [2021-11-09 09:09:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:09:43,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6270 states and 8396 transitions. [2021-11-09 09:09:43,245 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6075 [2021-11-09 09:09:43,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6270 states to 6270 states and 8396 transitions. [2021-11-09 09:09:43,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6270 [2021-11-09 09:09:43,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6270 [2021-11-09 09:09:43,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6270 states and 8396 transitions. [2021-11-09 09:09:43,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:09:43,372 INFO L681 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2021-11-09 09:09:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6270 states and 8396 transitions. [2021-11-09 09:09:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6270 to 6270. [2021-11-09 09:09:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6270 states, 6270 states have (on average 1.3390749601275918) internal successors, (8396), 6269 states have internal predecessors, (8396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:09:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8396 transitions. [2021-11-09 09:09:43,500 INFO L704 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2021-11-09 09:09:43,500 INFO L587 BuchiCegarLoop]: Abstraction has 6270 states and 8396 transitions. [2021-11-09 09:09:43,500 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-09 09:09:43,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6270 states and 8396 transitions. [2021-11-09 09:09:43,525 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 6075 [2021-11-09 09:09:43,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-09 09:09:43,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-09 09:09:43,526 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-11-09 09:09:43,526 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:09:43,527 INFO L791 eck$LassoCheckResult]: Stem: 42398#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(12);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~clk~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; 42311#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;~clk~0 := 0;~max_loop~0 := 8;~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; 42310#L613 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; 42286#L298 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 42269#L305-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 42270#L310-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 42355#L315-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; 42377#L118 assume !(1 == ~P_1_pc~0); 42334#L118-2 is_P_1_triggered_~__retres1~0 := 0; 42335#L129 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 42339#L130 activate_threads_#t~ret12 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 42195#L491 assume !(0 != activate_threads_~tmp~1); 42196#L491-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 42345#L186 assume !(1 == ~P_2_pc~0); 42215#L186-2 is_P_2_triggered_~__retres1~1 := 0; 42216#L197 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 42348#L198 activate_threads_#t~ret13 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret13;havoc activate_threads_#t~ret13; 42313#L499 assume !(0 != activate_threads_~tmp___0~1); 42314#L499-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 42259#L268 assume !(1 == ~C_1_pc~0); 42260#L268-2 assume !(2 == ~C_1_pc~0); 42383#L278-1 is_C_1_triggered_~__retres1~2 := 0; 42302#L289 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 42303#L290 activate_threads_#t~ret14 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret14;havoc activate_threads_#t~ret14; 42261#L507 assume !(0 != activate_threads_~tmp___1~1); 42262#L561-1 assume !false; 43209#L562 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; 43199#L397 [2021-11-09 09:09:43,527 INFO L793 eck$LassoCheckResult]: Loop: 43199#L397 assume !false; 43200#L358 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 43183#L328 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 43176#L345 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 43174#L346 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 43168#L362 assume 0 != eval_~tmp___2~0; 43159#L362-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 43160#L371 assume !(0 != eval_~tmp~0); 43148#L367 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 43145#L386 assume !(0 != eval_~tmp___0~0); 43147#L382 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet11;havoc eval_#t~nondet11; 43210#L401 assume !(0 != eval_~tmp___1~0); 43199#L397 [2021-11-09 09:09:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2021-11-09 09:09:43,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:43,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450249577] [2021-11-09 09:09:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:43,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,539 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2021-11-09 09:09:43,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:43,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276570981] [2021-11-09 09:09:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:43,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,566 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:09:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2021-11-09 09:09:43,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:09:43,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485313223] [2021-11-09 09:09:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:09:43,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:09:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,633 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:09:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:09:43,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:09:45,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 09:09:45 BoogieIcfgContainer [2021-11-09 09:09:45,285 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-09 09:09:45,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:09:45,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:09:45,286 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:09:45,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:09:38" (3/4) ... [2021-11-09 09:09:45,289 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-09 09:09:45,359 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:09:45,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:09:45,361 INFO L168 Benchmark]: Toolchain (without parser) took 7878.89 ms. Allocated memory was 79.7 MB in the beginning and 314.6 MB in the end (delta: 234.9 MB). Free memory was 37.0 MB in the beginning and 258.9 MB in the end (delta: -221.9 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,361 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 79.7 MB. Free memory was 53.3 MB in the beginning and 53.3 MB in the end (delta: 64.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:09:45,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.74 ms. Allocated memory was 79.7 MB in the beginning and 107.0 MB in the end (delta: 27.3 MB). Free memory was 36.8 MB in the beginning and 75.1 MB in the end (delta: -38.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.45 ms. Allocated memory is still 107.0 MB. Free memory was 75.1 MB in the beginning and 72.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,364 INFO L168 Benchmark]: Boogie Preprocessor took 86.07 ms. Allocated memory is still 107.0 MB. Free memory was 72.1 MB in the beginning and 70.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,365 INFO L168 Benchmark]: RCFGBuilder took 807.32 ms. Allocated memory is still 107.0 MB. Free memory was 70.0 MB in the beginning and 65.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,365 INFO L168 Benchmark]: BuchiAutomizer took 6406.35 ms. Allocated memory was 107.0 MB in the beginning and 314.6 MB in the end (delta: 207.6 MB). Free memory was 65.4 MB in the beginning and 229.7 MB in the end (delta: -164.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,366 INFO L168 Benchmark]: Witness Printer took 73.60 ms. Allocated memory is still 314.6 MB. Free memory was 229.7 MB in the beginning and 258.9 MB in the end (delta: -29.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:09:45,368 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.30 ms. Allocated memory is still 79.7 MB. Free memory was 53.3 MB in the beginning and 53.3 MB in the end (delta: 64.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 407.74 ms. Allocated memory was 79.7 MB in the beginning and 107.0 MB in the end (delta: 27.3 MB). Free memory was 36.8 MB in the beginning and 75.1 MB in the end (delta: -38.2 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.45 ms. Allocated memory is still 107.0 MB. Free memory was 75.1 MB in the beginning and 72.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.07 ms. Allocated memory is still 107.0 MB. Free memory was 72.1 MB in the beginning and 70.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 807.32 ms. Allocated memory is still 107.0 MB. Free memory was 70.0 MB in the beginning and 65.4 MB in the end (delta: 4.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 6406.35 ms. Allocated memory was 107.0 MB in the beginning and 314.6 MB in the end (delta: 207.6 MB). Free memory was 65.4 MB in the beginning and 229.7 MB in the end (delta: -164.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. * Witness Printer took 73.60 ms. Allocated memory is still 314.6 MB. Free memory was 229.7 MB in the beginning and 258.9 MB in the end (delta: -29.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 6270 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2953 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 6270 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2719 SDtfs, 3791 SDslu, 3175 SDs, 0 SdLazy, 277 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 357]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=14622} State at position 1 is {count=0, NULL=0, \result=0, P_1_pc=0, NULL=14622, C_1_i=1, tmp=0, C_1_st=0, data_0=0, kernel_st=1, tmp___2=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20c1f14f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@517ee695=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, clk=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@374abec5=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2526847c=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14f48d32=0, NULL=14625, \result=0, __retres1=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=8, NULL=14623, NULL=0, tmp=0, NULL=14624, C_1_pr=0, P_1_st=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@142ac8f9=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3734fc03=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@276d95de=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@138d9555=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 357]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int max_loop ; [L26] int clk ; [L27] int num ; [L28] int i ; [L29] int e ; [L30] int timer ; [L31] char data_0 ; [L32] char data_1 ; [L75] int P_1_pc; [L76] int P_1_st ; [L77] int P_1_i ; [L78] int P_1_ev ; [L133] int P_2_pc ; [L134] int P_2_st ; [L135] int P_2_i ; [L136] int P_2_ev ; [L201] int C_1_pc ; [L202] int C_1_st ; [L203] int C_1_i ; [L204] int C_1_ev ; [L205] int C_1_pr ; [L617] int count ; [L618] int __retres2 ; [L622] num = 0 [L623] i = 0 [L624] clk = 0 [L625] max_loop = 8 [L627] timer = 0 [L628] P_1_pc = 0 [L629] P_2_pc = 0 [L630] C_1_pc = 0 [L632] count = 0 [L609] P_1_i = 1 [L610] P_2_i = 1 [L611] C_1_i = 1 [L547] int kernel_st ; [L548] int tmp ; [L549] int tmp___0 ; [L553] kernel_st = 0 [L305] COND TRUE (int )P_1_i == 1 [L306] P_1_st = 0 [L310] COND TRUE (int )P_2_i == 1 [L311] P_2_st = 0 [L315] COND TRUE (int )C_1_i == 1 [L316] C_1_st = 0 [L483] int tmp ; [L484] int tmp___0 ; [L485] int tmp___1 ; [L115] int __retres1 ; [L118] COND FALSE !((int )P_1_pc == 1) [L128] __retres1 = 0 [L130] return (__retres1); [L489] tmp = is_P_1_triggered() [L491] COND FALSE !(\read(tmp)) [L183] int __retres1 ; [L186] COND FALSE !((int )P_2_pc == 1) [L196] __retres1 = 0 [L198] return (__retres1); [L497] tmp___0 = is_P_2_triggered() [L499] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; [L268] COND FALSE !((int )C_1_pc == 1) [L278] COND FALSE !((int )C_1_pc == 2) [L288] __retres1 = 0 [L290] return (__retres1); [L505] tmp___1 = is_C_1_triggered() [L507] COND FALSE !(\read(tmp___1)) [L561] COND TRUE 1 [L564] kernel_st = 1 [L350] int tmp ; [L351] int tmp___0 ; [L352] int tmp___1 ; [L353] int tmp___2 ; Loop: [L357] COND TRUE 1 [L325] int __retres1 ; [L328] COND TRUE (int )P_1_st == 0 [L329] __retres1 = 1 [L346] return (__retres1); [L360] tmp___2 = exists_runnable_thread() [L362] COND TRUE \read(tmp___2) [L367] COND TRUE (int )P_1_st == 0 [L369] tmp = __VERIFIER_nondet_int() [L371] COND FALSE !(\read(tmp)) [L382] COND TRUE (int )P_2_st == 0 [L384] tmp___0 = __VERIFIER_nondet_int() [L386] COND FALSE !(\read(tmp___0)) [L397] COND TRUE (int )C_1_st == 0 [L399] tmp___1 = __VERIFIER_nondet_int() [L401] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-09 09:09:45,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55eef57e-211e-415a-a89b-d91fef91846f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)