./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:50:23,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:50:23,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:50:23,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:50:23,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:50:23,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:50:23,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:50:23,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:50:23,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:50:23,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:50:23,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:50:23,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:50:23,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:50:23,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:50:23,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:50:23,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:50:23,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:50:23,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:50:23,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:50:23,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:50:23,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:50:23,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:50:23,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:50:23,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:50:23,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:50:23,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:50:23,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:50:23,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:50:23,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:50:23,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:50:23,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:50:23,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:50:23,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:50:23,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:50:23,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:50:23,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:50:23,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:50:23,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:50:23,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:50:23,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:50:23,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:50:23,374 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-21 16:50:23,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:50:23,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:50:23,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:50:23,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:50:23,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:50:23,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:50:23,399 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:50:23,399 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 16:50:23,399 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 16:50:23,399 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 16:50:23,400 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 16:50:23,400 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 16:50:23,400 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 16:50:23,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:50:23,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:50:23,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:50:23,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:50:23,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:50:23,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:50:23,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 16:50:23,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 16:50:23,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 16:50:23,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:50:23,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:50:23,403 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 16:50:23,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:50:23,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 16:50:23,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:50:23,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:50:23,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:50:23,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:50:23,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 16:50:23,406 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_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/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_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-11-21 16:50:23,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:50:23,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:50:23,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:50:23,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:50:23,743 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:50:23,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-21 16:50:26,801 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:50:27,056 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:50:27,057 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-21 16:50:27,066 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/data/b0d78b446/279f386b62794306a1544fabe3ceb5a9/FLAGccb3f526a [2022-11-21 16:50:27,083 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/data/b0d78b446/279f386b62794306a1544fabe3ceb5a9 [2022-11-21 16:50:27,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:50:27,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:50:27,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:50:27,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:50:27,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:50:27,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3c5fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27, skipping insertion in model container [2022-11-21 16:50:27,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:50:27,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:50:27,420 WARN L237 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_cd84c259-2df1-47b8-a85a-382ed02488b7/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-21 16:50:27,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:50:27,529 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:50:27,545 WARN L237 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_cd84c259-2df1-47b8-a85a-382ed02488b7/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-21 16:50:27,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:50:27,598 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:50:27,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27 WrapperNode [2022-11-21 16:50:27,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:50:27,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:50:27,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:50:27,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:50:27,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,651 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 31, calls inlined = 34, statements flattened = 371 [2022-11-21 16:50:27,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:50:27,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:50:27,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:50:27,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:50:27,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:50:27,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:50:27,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:50:27,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:50:27,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (1/1) ... [2022-11-21 16:50:27,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:50:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:27,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:50:27,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 16:50:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:50:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:50:27,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:50:27,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:50:27,870 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:50:27,872 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:50:28,286 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:50:28,296 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:50:28,297 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 16:50:28,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:28 BoogieIcfgContainer [2022-11-21 16:50:28,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:50:28,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 16:50:28,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 16:50:28,305 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 16:50:28,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:28,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 04:50:27" (1/3) ... [2022-11-21 16:50:28,308 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72f044f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:50:28, skipping insertion in model container [2022-11-21 16:50:28,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:28,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:50:27" (2/3) ... [2022-11-21 16:50:28,309 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72f044f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:50:28, skipping insertion in model container [2022-11-21 16:50:28,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:50:28,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:28" (3/3) ... [2022-11-21 16:50:28,311 INFO L332 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2022-11-21 16:50:28,374 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 16:50:28,374 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 16:50:28,374 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 16:50:28,374 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 16:50:28,374 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 16:50:28,375 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 16:50:28,375 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 16:50:28,375 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 16:50:28,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 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) [2022-11-21 16:50:28,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-11-21 16:50:28,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:28,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:28,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:28,414 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:28,415 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 16:50:28,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 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) [2022-11-21 16:50:28,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-11-21 16:50:28,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:28,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:28,424 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:28,424 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:28,433 INFO L748 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 45#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 78#L496true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 122#L229true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 64#L236true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 63#L236-2true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 121#L241-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14#L331true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 7#L117true assume !(1 == ~P_1_pc~0); 25#L117-2true is_P_1_triggered_~__retres1~0#1 := 0; 57#L128true is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 107#L129true activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 55#L383true assume !(0 != activate_threads_~tmp~1#1); 26#L383-2true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 54#L199true assume 1 == ~C_1_pc~0; 98#L200true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1#1 := 1; 68#L220true is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 80#L221true activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 79#L391true assume !(0 != activate_threads_~tmp___1~1#1); 4#L391-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 119#L339true assume { :end_inline_reset_delta_events } true; 81#L445-2true [2022-11-21 16:50:28,434 INFO L750 eck$LassoCheckResult]: Loop: 81#L445-2true assume !false; 101#L446true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 93#L304true assume false; 77#L320true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 65#L229-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 30#L331-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 5#L117-3true assume !(1 == ~P_1_pc~0); 75#L117-5true is_P_1_triggered_~__retres1~0#1 := 0; 83#L128-1true is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 48#L129-1true activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 39#L383-3true assume 0 != activate_threads_~tmp~1#1;~P_1_st~0 := 0; 18#L383-5true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 118#L199-3true assume 1 == ~C_1_pc~0; 23#L200-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1#1 := 1; 104#L220-1true is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 60#L221-1true activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 126#L391-3true assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 41#L391-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 111#L339-1true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 13#L254-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 44#L267-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 71#L268-1true start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 102#L464true assume !(0 == start_simulation_~tmp~3#1); 27#L464-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 31#L254-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 84#L267-2true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 95#L268-2true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 6#L419true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 109#L426true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 86#L427true start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 32#L477true assume !(0 != start_simulation_~tmp___0~2#1); 81#L445-2true [2022-11-21 16:50:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1103808071, now seen corresponding path program 1 times [2022-11-21 16:50:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264967433] [2022-11-21 16:50:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:28,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264967433] [2022-11-21 16:50:28,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264967433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:28,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:28,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:50:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72480117] [2022-11-21 16:50:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:28,711 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:50:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash -436523117, now seen corresponding path program 1 times [2022-11-21 16:50:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:28,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026880671] [2022-11-21 16:50:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:28,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:28,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026880671] [2022-11-21 16:50:28,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026880671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:28,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:28,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:50:28,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486908671] [2022-11-21 16:50:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:28,758 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:50:28,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:50:28,800 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 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 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-11-21 16:50:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:28,865 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2022-11-21 16:50:28,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 172 transitions. [2022-11-21 16:50:28,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2022-11-21 16:50:28,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 115 states and 165 transitions. [2022-11-21 16:50:28,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-21 16:50:28,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-21 16:50:28,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 165 transitions. [2022-11-21 16:50:28,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:28,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 165 transitions. [2022-11-21 16:50:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 165 transitions. [2022-11-21 16:50:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-21 16:50:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.434782608695652) internal successors, (165), 114 states have internal predecessors, (165), 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) [2022-11-21 16:50:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2022-11-21 16:50:28,946 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 165 transitions. [2022-11-21 16:50:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:50:28,957 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 165 transitions. [2022-11-21 16:50:28,958 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 16:50:28,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 165 transitions. [2022-11-21 16:50:28,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2022-11-21 16:50:28,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:28,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:28,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:28,972 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:28,973 INFO L748 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 327#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 359#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 352#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 350#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 351#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 282#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 266#L117 assume !(1 == ~P_1_pc~0); 267#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 299#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 345#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 343#L383 assume !(0 != activate_threads_~tmp~1#1); 300#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 301#L199 assume 1 == ~C_1_pc~0; 341#L200 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1#1 := 1; 278#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 356#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 360#L391 assume !(0 != activate_threads_~tmp___1~1#1); 259#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 260#L339 assume { :end_inline_reset_delta_events } true; 310#L445-2 [2022-11-21 16:50:28,974 INFO L750 eck$LassoCheckResult]: Loop: 310#L445-2 assume !false; 361#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 284#L304 assume !false; 365#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 344#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 303#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 297#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 298#L284 assume !(0 != eval_~tmp___2~0#1); 355#L320 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 353#L229-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 306#L331-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 261#L117-3 assume 1 == ~P_1_pc~0; 262#L118-1 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0#1 := 1; 346#L128-1 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 331#L129-1 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 317#L383-3 assume 0 != activate_threads_~tmp~1#1;~P_1_st~0 := 0; 288#L383-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 289#L199-3 assume 1 == ~C_1_pc~0; 294#L200-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1#1 := 1; 296#L220-1 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 347#L221-1 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 348#L391-3 assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 319#L391-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 320#L339-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 279#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 280#L267-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 325#L268-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 357#L464 assume !(0 == start_simulation_~tmp~3#1); 275#L464-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 302#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 308#L267-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 362#L268-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 264#L419 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 265#L426 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 363#L427 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 309#L477 assume !(0 != start_simulation_~tmp___0~2#1); 310#L445-2 [2022-11-21 16:50:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 484539831, now seen corresponding path program 1 times [2022-11-21 16:50:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110548610] [2022-11-21 16:50:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110548610] [2022-11-21 16:50:29,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110548610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:29,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:29,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:50:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687163828] [2022-11-21 16:50:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:29,135 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:50:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -745860796, now seen corresponding path program 1 times [2022-11-21 16:50:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:29,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081773108] [2022-11-21 16:50:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:29,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081773108] [2022-11-21 16:50:29,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081773108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:29,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:29,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:50:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704726866] [2022-11-21 16:50:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:29,260 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:50:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:50:29,262 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. cyclomatic complexity: 51 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-11-21 16:50:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:29,462 INFO L93 Difference]: Finished difference Result 281 states and 389 transitions. [2022-11-21 16:50:29,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 389 transitions. [2022-11-21 16:50:29,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2022-11-21 16:50:29,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 281 states and 389 transitions. [2022-11-21 16:50:29,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2022-11-21 16:50:29,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2022-11-21 16:50:29,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 389 transitions. [2022-11-21 16:50:29,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:29,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 281 states and 389 transitions. [2022-11-21 16:50:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 389 transitions. [2022-11-21 16:50:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2022-11-21 16:50:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 262 states have (on average 1.3969465648854962) internal successors, (366), 261 states have internal predecessors, (366), 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) [2022-11-21 16:50:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 366 transitions. [2022-11-21 16:50:29,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 262 states and 366 transitions. [2022-11-21 16:50:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:50:29,482 INFO L428 stractBuchiCegarLoop]: Abstraction has 262 states and 366 transitions. [2022-11-21 16:50:29,483 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 16:50:29,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 366 transitions. [2022-11-21 16:50:29,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 239 [2022-11-21 16:50:29,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:29,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:29,485 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:29,486 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:29,486 INFO L748 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 734#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 735#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 778#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 769#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 765#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 766#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 689#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 674#L117 assume !(1 == ~P_1_pc~0); 675#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 706#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 758#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 753#L383 assume !(0 != activate_threads_~tmp~1#1); 709#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 710#L199 assume !(1 == ~C_1_pc~0); 752#L199-2 assume !(2 == ~C_1_pc~0); 687#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 688#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 774#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 779#L391 assume !(0 != activate_threads_~tmp___1~1#1); 670#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 671#L339 assume { :end_inline_reset_delta_events } true; 798#L445-2 [2022-11-21 16:50:29,486 INFO L750 eck$LassoCheckResult]: Loop: 798#L445-2 assume !false; 865#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 860#L304 assume !false; 859#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 857#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 854#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 852#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 849#L284 assume !(0 != eval_~tmp___2~0#1); 847#L320 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 844#L229-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 714#L331-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 668#L117-3 assume !(1 == ~P_1_pc~0); 669#L117-5 is_P_1_triggered_~__retres1~0#1 := 0; 776#L128-1 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 739#L129-1 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 726#L383-3 assume 0 != activate_threads_~tmp~1#1;~P_1_st~0 := 0; 695#L383-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 696#L199-3 assume !(1 == ~C_1_pc~0); 795#L199-5 assume 2 == ~C_1_pc~0; 720#L210-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1#1 := 1; 721#L220-1 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 762#L221-1 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 763#L391-3 assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 727#L391-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 728#L339-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 683#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 684#L267-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 733#L268-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 775#L464 assume !(0 == start_simulation_~tmp~3#1); 794#L464-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 880#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 877#L267-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 876#L268-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 875#L419 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 873#L426 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 871#L427 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 869#L477 assume !(0 != start_simulation_~tmp___0~2#1); 798#L445-2 [2022-11-21 16:50:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 1 times [2022-11-21 16:50:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944975038] [2022-11-21 16:50:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:29,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:29,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:29,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1174958789, now seen corresponding path program 1 times [2022-11-21 16:50:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511385037] [2022-11-21 16:50:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:29,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511385037] [2022-11-21 16:50:29,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511385037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:29,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:29,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:50:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682677790] [2022-11-21 16:50:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:29,593 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:29,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:50:29,594 INFO L87 Difference]: Start difference. First operand 262 states and 366 transitions. cyclomatic complexity: 106 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:50:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:29,680 INFO L93 Difference]: Finished difference Result 451 states and 622 transitions. [2022-11-21 16:50:29,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 622 transitions. [2022-11-21 16:50:29,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 428 [2022-11-21 16:50:29,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 451 states and 622 transitions. [2022-11-21 16:50:29,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 451 [2022-11-21 16:50:29,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 451 [2022-11-21 16:50:29,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 451 states and 622 transitions. [2022-11-21 16:50:29,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:29,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 451 states and 622 transitions. [2022-11-21 16:50:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 622 transitions. [2022-11-21 16:50:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 271. [2022-11-21 16:50:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 1.3837638376383763) internal successors, (375), 270 states have internal predecessors, (375), 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) [2022-11-21 16:50:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2022-11-21 16:50:29,705 INFO L240 hiAutomatonCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-11-21 16:50:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:50:29,706 INFO L428 stractBuchiCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-11-21 16:50:29,706 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 16:50:29,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 375 transitions. [2022-11-21 16:50:29,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 248 [2022-11-21 16:50:29,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:29,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:29,709 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:29,709 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:29,709 INFO L748 eck$LassoCheckResult]: Stem: 1535#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1469#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 1470#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1511#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1503#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1498#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1499#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1418#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 1403#L117 assume !(1 == ~P_1_pc~0); 1404#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 1435#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 1491#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 1486#L383 assume !(0 != activate_threads_~tmp~1#1); 1438#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 1439#L199 assume !(1 == ~C_1_pc~0); 1485#L199-2 assume !(2 == ~C_1_pc~0); 1416#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 1417#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 1506#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1512#L391 assume !(0 != activate_threads_~tmp___1~1#1); 1399#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1400#L339 assume { :end_inline_reset_delta_events } true; 1540#L445-2 [2022-11-21 16:50:29,710 INFO L750 eck$LassoCheckResult]: Loop: 1540#L445-2 assume !false; 1648#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 1420#L304 assume !false; 1597#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1594#L254 assume !(0 == ~P_1_st~0); 1591#L258 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 1590#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1589#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 1588#L284 assume !(0 != eval_~tmp___2~0#1); 1510#L320 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1500#L229-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1443#L331-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 1397#L117-3 assume !(1 == ~P_1_pc~0); 1398#L117-5 is_P_1_triggered_~__retres1~0#1 := 0; 1515#L128-1 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 1474#L129-1 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 1475#L383-3 assume 0 != activate_threads_~tmp~1#1;~P_1_st~0 := 0; 1424#L383-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 1425#L199-3 assume !(1 == ~C_1_pc~0); 1530#L199-5 assume 2 == ~C_1_pc~0; 1531#L210-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1#1 := 1; 1528#L220-1 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 1529#L221-1 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1542#L391-3 assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 1543#L391-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1619#L339-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1412#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1413#L267-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1468#L268-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 1507#L464 assume !(0 == start_simulation_~tmp~3#1); 1436#L464-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1437#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1657#L267-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1655#L268-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 1653#L419 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1652#L426 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1650#L427 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 1649#L477 assume !(0 != start_simulation_~tmp___0~2#1); 1540#L445-2 [2022-11-21 16:50:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:29,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 2 times [2022-11-21 16:50:29,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:29,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352069008] [2022-11-21 16:50:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:29,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:29,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1740811999, now seen corresponding path program 1 times [2022-11-21 16:50:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:29,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457168595] [2022-11-21 16:50:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:29,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:29,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457168595] [2022-11-21 16:50:29,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457168595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:29,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:29,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:50:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7899707] [2022-11-21 16:50:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:29,879 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:50:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:50:29,880 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. cyclomatic complexity: 106 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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) [2022-11-21 16:50:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:29,969 INFO L93 Difference]: Finished difference Result 577 states and 796 transitions. [2022-11-21 16:50:29,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 796 transitions. [2022-11-21 16:50:29,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 554 [2022-11-21 16:50:29,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 796 transitions. [2022-11-21 16:50:29,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2022-11-21 16:50:29,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2022-11-21 16:50:29,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 796 transitions. [2022-11-21 16:50:29,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:29,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 577 states and 796 transitions. [2022-11-21 16:50:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 796 transitions. [2022-11-21 16:50:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 283. [2022-11-21 16:50:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 283 states have (on average 1.3568904593639577) internal successors, (384), 282 states have internal predecessors, (384), 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) [2022-11-21 16:50:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 384 transitions. [2022-11-21 16:50:30,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 283 states and 384 transitions. [2022-11-21 16:50:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:50:30,015 INFO L428 stractBuchiCegarLoop]: Abstraction has 283 states and 384 transitions. [2022-11-21 16:50:30,017 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 16:50:30,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 283 states and 384 transitions. [2022-11-21 16:50:30,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 260 [2022-11-21 16:50:30,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:30,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:30,020 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:30,021 INFO L149 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:30,021 INFO L748 eck$LassoCheckResult]: Stem: 2381#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2325#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 2326#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2365#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2358#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2354#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2355#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2279#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 2264#L117 assume !(1 == ~P_1_pc~0); 2265#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 2296#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 2345#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 2343#L383 assume !(0 != activate_threads_~tmp~1#1); 2297#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 2298#L199 assume !(1 == ~C_1_pc~0); 2342#L199-2 assume !(2 == ~C_1_pc~0); 2274#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 2275#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 2359#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2366#L391 assume !(0 != activate_threads_~tmp___1~1#1); 2258#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2259#L339 assume { :end_inline_reset_delta_events } true; 2382#L445-2 [2022-11-21 16:50:30,022 INFO L750 eck$LassoCheckResult]: Loop: 2382#L445-2 assume !false; 2406#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 2401#L304 assume !false; 2400#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2399#L254 assume !(0 == ~P_1_st~0); 2397#L258 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 2396#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2395#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 2393#L284 assume !(0 != eval_~tmp___2~0#1); 2392#L320 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2391#L229-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2390#L331-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 2260#L117-3 assume !(1 == ~P_1_pc~0); 2261#L117-5 is_P_1_triggered_~__retres1~0#1 := 0; 2460#L128-1 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 2459#L129-1 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 2458#L383-3 assume !(0 != activate_threads_~tmp~1#1); 2456#L383-5 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 2454#L199-3 assume !(1 == ~C_1_pc~0); 2452#L199-5 assume 2 == ~C_1_pc~0; 2449#L210-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1#1 := 1; 2447#L220-1 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 2445#L221-1 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2442#L391-3 assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 2440#L391-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2438#L339-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2435#L254-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2433#L267-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2431#L268-1 start_simulation_#t~ret11#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 2429#L464 assume !(0 == start_simulation_~tmp~3#1); 2427#L464-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 2426#L254-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 2424#L267-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 2423#L268-2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 2422#L419 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 2421#L426 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 2419#L427 start_simulation_#t~ret12#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2#1 := start_simulation_#t~ret12#1;havoc start_simulation_#t~ret12#1; 2414#L477 assume !(0 != start_simulation_~tmp___0~2#1); 2382#L445-2 [2022-11-21 16:50:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1818999495, now seen corresponding path program 3 times [2022-11-21 16:50:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640740351] [2022-11-21 16:50:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1959666717, now seen corresponding path program 1 times [2022-11-21 16:50:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74497723] [2022-11-21 16:50:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:30,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74497723] [2022-11-21 16:50:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74497723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:30,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:30,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:50:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300162678] [2022-11-21 16:50:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:30,115 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:50:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:30,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:50:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:50:30,117 INFO L87 Difference]: Start difference. First operand 283 states and 384 transitions. cyclomatic complexity: 103 Second operand has 3 states, 3 states have (on average 12.666666666666666) 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) [2022-11-21 16:50:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:30,151 INFO L93 Difference]: Finished difference Result 427 states and 570 transitions. [2022-11-21 16:50:30,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 570 transitions. [2022-11-21 16:50:30,154 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 397 [2022-11-21 16:50:30,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 427 states and 570 transitions. [2022-11-21 16:50:30,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 427 [2022-11-21 16:50:30,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2022-11-21 16:50:30,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 427 states and 570 transitions. [2022-11-21 16:50:30,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:30,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 427 states and 570 transitions. [2022-11-21 16:50:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states and 570 transitions. [2022-11-21 16:50:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-11-21 16:50:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 427 states have (on average 1.334894613583138) internal successors, (570), 426 states have internal predecessors, (570), 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) [2022-11-21 16:50:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 570 transitions. [2022-11-21 16:50:30,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 427 states and 570 transitions. [2022-11-21 16:50:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:50:30,175 INFO L428 stractBuchiCegarLoop]: Abstraction has 427 states and 570 transitions. [2022-11-21 16:50:30,175 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-21 16:50:30,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 570 transitions. [2022-11-21 16:50:30,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 397 [2022-11-21 16:50:30,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:30,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:30,180 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:30,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:30,213 INFO L748 eck$LassoCheckResult]: Stem: 3103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3042#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 3043#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 3083#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3072#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3070#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3071#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2994#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 2980#L117 assume !(1 == ~P_1_pc~0); 2981#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 3013#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 3061#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 3059#L383 assume !(0 != activate_threads_~tmp~1#1); 3014#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 3015#L199 assume !(1 == ~C_1_pc~0); 3058#L199-2 assume !(2 == ~C_1_pc~0); 2990#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 2991#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 3075#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 3084#L391 assume !(0 != activate_threads_~tmp___1~1#1); 2974#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2975#L339 assume { :end_inline_reset_delta_events } true; 3105#L445-2 assume !false; 3397#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 2996#L304 [2022-11-21 16:50:30,213 INFO L750 eck$LassoCheckResult]: Loop: 2996#L304 assume !false; 3395#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 3394#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 3393#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 3392#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 3391#L284 assume 0 != eval_~tmp___2~0#1; 3390#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 3102#L293 assume !(0 != eval_~tmp~0#1); 3034#L289 assume !(0 == ~C_1_st~0); 2996#L304 [2022-11-21 16:50:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 6828137, now seen corresponding path program 1 times [2022-11-21 16:50:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402499782] [2022-11-21 16:50:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 602708997, now seen corresponding path program 1 times [2022-11-21 16:50:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069963271] [2022-11-21 16:50:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 462446749, now seen corresponding path program 1 times [2022-11-21 16:50:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891954371] [2022-11-21 16:50:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:30,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:30,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891954371] [2022-11-21 16:50:30,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891954371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:30,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:30,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:50:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292605773] [2022-11-21 16:50:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:50:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:50:30,419 INFO L87 Difference]: Start difference. First operand 427 states and 570 transitions. cyclomatic complexity: 146 Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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) [2022-11-21 16:50:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:30,460 INFO L93 Difference]: Finished difference Result 706 states and 924 transitions. [2022-11-21 16:50:30,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 706 states and 924 transitions. [2022-11-21 16:50:30,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 652 [2022-11-21 16:50:30,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 706 states to 706 states and 924 transitions. [2022-11-21 16:50:30,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2022-11-21 16:50:30,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2022-11-21 16:50:30,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 924 transitions. [2022-11-21 16:50:30,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:30,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 706 states and 924 transitions. [2022-11-21 16:50:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 924 transitions. [2022-11-21 16:50:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-11-21 16:50:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 706 states have (on average 1.3087818696883853) internal successors, (924), 705 states have internal predecessors, (924), 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) [2022-11-21 16:50:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 924 transitions. [2022-11-21 16:50:30,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 706 states and 924 transitions. [2022-11-21 16:50:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:50:30,499 INFO L428 stractBuchiCegarLoop]: Abstraction has 706 states and 924 transitions. [2022-11-21 16:50:30,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-21 16:50:30,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 706 states and 924 transitions. [2022-11-21 16:50:30,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 652 [2022-11-21 16:50:30,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:30,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:30,507 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:30,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:30,508 INFO L748 eck$LassoCheckResult]: Stem: 4245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 4180#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 4222#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4210#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 4207#L236-2 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 4208#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4546#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 4545#L117 assume !(1 == ~P_1_pc~0); 4544#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 4543#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 4542#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 4541#L383 assume !(0 != activate_threads_~tmp~1#1); 4540#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 4539#L199 assume !(1 == ~C_1_pc~0); 4538#L199-2 assume !(2 == ~C_1_pc~0); 4536#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 4535#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 4534#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4533#L391 assume 0 != activate_threads_~tmp___1~1#1;~C_1_st~0 := 0; 4115#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4116#L339 assume { :end_inline_reset_delta_events } true; 4246#L445-2 assume !false; 4563#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 4551#L304 [2022-11-21 16:50:30,508 INFO L750 eck$LassoCheckResult]: Loop: 4551#L304 assume !false; 4562#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 4560#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 4559#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 4558#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 4557#L284 assume 0 != eval_~tmp___2~0#1; 4555#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 4553#L293 assume !(0 != eval_~tmp~0#1); 4552#L289 assume 0 == ~C_1_st~0;eval_~tmp___1~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 4550#L308 assume !(0 != eval_~tmp___1~0#1); 4551#L304 [2022-11-21 16:50:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1683962647, now seen corresponding path program 1 times [2022-11-21 16:50:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247527295] [2022-11-21 16:50:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:50:30,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:30,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247527295] [2022-11-21 16:50:30,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247527295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:50:30,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:50:30,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:50:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404971992] [2022-11-21 16:50:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:50:30,560 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:50:30,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1504107565, now seen corresponding path program 1 times [2022-11-21 16:50:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052517350] [2022-11-21 16:50:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:30,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:50:30,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:50:30,662 INFO L87 Difference]: Start difference. First operand 706 states and 924 transitions. cyclomatic complexity: 221 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) [2022-11-21 16:50:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:30,671 INFO L93 Difference]: Finished difference Result 687 states and 901 transitions. [2022-11-21 16:50:30,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 901 transitions. [2022-11-21 16:50:30,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 652 [2022-11-21 16:50:30,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 687 states and 901 transitions. [2022-11-21 16:50:30,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2022-11-21 16:50:30,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2022-11-21 16:50:30,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 687 states and 901 transitions. [2022-11-21 16:50:30,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:50:30,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 687 states and 901 transitions. [2022-11-21 16:50:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states and 901 transitions. [2022-11-21 16:50:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-21 16:50:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 687 states have (on average 1.3114992721979621) internal successors, (901), 686 states have internal predecessors, (901), 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) [2022-11-21 16:50:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 901 transitions. [2022-11-21 16:50:30,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 687 states and 901 transitions. [2022-11-21 16:50:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:50:30,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 687 states and 901 transitions. [2022-11-21 16:50:30,695 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-21 16:50:30,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 901 transitions. [2022-11-21 16:50:30,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 652 [2022-11-21 16:50:30,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:50:30,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:50:30,700 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-21 16:50:30,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:30,701 INFO L748 eck$LassoCheckResult]: Stem: 5640#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~count~0#1, main_~__retres2~1#1;havoc main_~count~0#1;havoc main_~__retres2~1#1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0#1 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~C_1_i~0 := 1; 5581#L496 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_#t~ret12#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~2#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~2#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 5621#L229 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 5608#L236 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5605#L236-2 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 5606#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 5534#L331 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret8#1, activate_threads_#t~ret9#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~1#1, activate_threads_~tmp___1~1#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~1#1;havoc activate_threads_~tmp___1~1#1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res#1;havoc is_P_1_triggered_~__retres1~0#1;havoc is_P_1_triggered_~__retres1~0#1; 5520#L117 assume !(1 == ~P_1_pc~0); 5521#L117-2 is_P_1_triggered_~__retres1~0#1 := 0; 5552#L128 is_P_1_triggered_#res#1 := is_P_1_triggered_~__retres1~0#1; 5597#L129 activate_threads_#t~ret8#1 := is_P_1_triggered_#res#1;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret8#1;havoc activate_threads_#t~ret8#1; 5595#L383 assume !(0 != activate_threads_~tmp~1#1); 5554#L383-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res#1;havoc is_C_1_triggered_~__retres1~1#1;havoc is_C_1_triggered_~__retres1~1#1; 5555#L199 assume !(1 == ~C_1_pc~0); 5594#L199-2 assume !(2 == ~C_1_pc~0); 5532#L209-1 is_C_1_triggered_~__retres1~1#1 := 0; 5533#L220 is_C_1_triggered_#res#1 := is_C_1_triggered_~__retres1~1#1; 5611#L221 activate_threads_#t~ret9#1 := is_C_1_triggered_#res#1;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 5622#L391 assume !(0 != activate_threads_~tmp___1~1#1); 5514#L391-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 5515#L339 assume { :end_inline_reset_delta_events } true; 5642#L445-2 assume !false; 5940#L446 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1; 5923#L304 [2022-11-21 16:50:30,702 INFO L750 eck$LassoCheckResult]: Loop: 5923#L304 assume !false; 5939#L280 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 5937#L254 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 5935#L267 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 5934#L268 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 5932#L284 assume 0 != eval_~tmp___2~0#1; 5930#L284-1 assume 0 == ~P_1_st~0;eval_~tmp~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 5927#L293 assume !(0 != eval_~tmp~0#1); 5925#L289 assume 0 == ~C_1_st~0;eval_~tmp___1~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 5791#L308 assume !(0 != eval_~tmp___1~0#1); 5923#L304 [2022-11-21 16:50:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 6828137, now seen corresponding path program 2 times [2022-11-21 16:50:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678065951] [2022-11-21 16:50:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1504107565, now seen corresponding path program 2 times [2022-11-21 16:50:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133711599] [2022-11-21 16:50:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1450945173, now seen corresponding path program 1 times [2022-11-21 16:50:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125097796] [2022-11-21 16:50:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:30,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:50:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:31,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:50:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:50:31,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 04:50:31 BoogieIcfgContainer [2022-11-21 16:50:31,722 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-21 16:50:31,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:50:31,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:50:31,727 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:50:31,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:50:28" (3/4) ... [2022-11-21 16:50:31,731 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-21 16:50:31,800 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:50:31,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:50:31,801 INFO L158 Benchmark]: Toolchain (without parser) took 4706.26ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 108.3MB in the beginning and 115.6MB in the end (delta: -7.3MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,802 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 114.1MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:50:31,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.21ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 111.4MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.96ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 108.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,803 INFO L158 Benchmark]: Boogie Preprocessor took 36.16ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 107.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,803 INFO L158 Benchmark]: RCFGBuilder took 608.30ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 87.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,804 INFO L158 Benchmark]: BuchiAutomizer took 3425.59ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 86.8MB in the beginning and 118.8MB in the end (delta: -32.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,804 INFO L158 Benchmark]: Witness Printer took 73.82ms. Allocated memory is still 178.3MB. Free memory was 118.8MB in the beginning and 115.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 16:50:31,807 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.33ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 114.1MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.21ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 111.4MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.96ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 108.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.16ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 107.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 608.30ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 87.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 3425.59ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 86.8MB in the beginning and 118.8MB in the end (delta: -32.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 73.82ms. Allocated memory is still 178.3MB. Free memory was 118.8MB in the beginning and 115.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 687 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 493 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1602 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1602 mSDsluCounter, 2755 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1615 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 1140 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 279]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 [L438] FCALL update_channels() [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() [L441] CALL activate_threads() [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() [L442] FCALL reset_delta_events() [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] Loop: [L279] COND TRUE 1 [L282] CALL, EXPR exists_runnable_thread() [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND FALSE !(\read(tmp___1)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 279]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 [L438] FCALL update_channels() [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() [L441] CALL activate_threads() [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L127] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L129] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L219] __retres1 = 0 VAL [__retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L221] return (__retres1); VAL [\result=0, __retres1=0, C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0, tmp=0, tmp___1=0] [L441] RET activate_threads() [L442] FCALL reset_delta_events() [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] Loop: [L279] COND TRUE 1 [L282] CALL, EXPR exists_runnable_thread() [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:50:31,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd84c259-2df1-47b8-a85a-382ed02488b7/bin/uautomizer-vX5HgA9Q3a/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)