./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:30:08,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:30:08,432 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-02 12:30:08,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:30:08,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:30:08,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:30:08,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:30:08,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:30:08,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:30:08,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:30:08,487 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:30:08,488 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:30:08,492 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:30:08,493 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:30:08,493 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:30:08,494 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:30:08,494 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:30:08,494 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:30:08,495 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:30:08,495 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:30:08,496 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:30:08,500 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:30:08,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:30:08,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 12:30:08,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:30:08,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:30:08,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:30:08,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:30:08,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 12:30:08,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:30:08,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 12:30:08,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:30:08,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:30:08,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 12:30:08,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:30:08,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:30:08,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:30:08,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:30:08,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:30:08,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:30:08,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:30:08,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 12:30:08,514 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:30:08,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:30:08,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:30:08,515 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:30:08,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:30:08,515 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/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_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2024-11-02 12:30:08,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:30:08,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:30:08,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:30:08,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:30:08,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:30:08,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-02 12:30:11,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:30:11,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:30:11,478 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2024-11-02 12:30:11,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/data/6eb694f5c/44ccaf46a6774f3fa3f731581b8616d5/FLAGfe29a6777 [2024-11-02 12:30:11,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/data/6eb694f5c/44ccaf46a6774f3fa3f731581b8616d5 [2024-11-02 12:30:11,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:30:11,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:30:11,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:11,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:30:11,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:30:11,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:11" (1/1) ... [2024-11-02 12:30:11,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7885e5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:11, skipping insertion in model container [2024-11-02 12:30:11,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:11" (1/1) ... [2024-11-02 12:30:11,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:30:12,106 WARN L251 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_16fe74ac-0583-45db-91a8-a6537396efbd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2024-11-02 12:30:12,170 WARN L251 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_16fe74ac-0583-45db-91a8-a6537396efbd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2024-11-02 12:30:12,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:12,228 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:30:12,244 WARN L251 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_16fe74ac-0583-45db-91a8-a6537396efbd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2024-11-02 12:30:12,290 WARN L251 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_16fe74ac-0583-45db-91a8-a6537396efbd/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2024-11-02 12:30:12,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:12,344 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:30:12,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12 WrapperNode [2024-11-02 12:30:12,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:12,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:12,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:30:12,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:30:12,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,430 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 429 [2024-11-02 12:30:12,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:12,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:30:12,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:30:12,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:30:12,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:30:12,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:30:12,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:30:12,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:30:12,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (1/1) ... [2024-11-02 12:30:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:30:12,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:12,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:30:12,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:30:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:30:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-02 12:30:12,581 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-02 12:30:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-02 12:30:12,581 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-02 12:30:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-02 12:30:12,581 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-02 12:30:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-02 12:30:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-02 12:30:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-02 12:30:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-02 12:30:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-02 12:30:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-02 12:30:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-02 12:30:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-02 12:30:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:30:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-02 12:30:12,583 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-02 12:30:12,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:30:12,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:30:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-02 12:30:12,584 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-02 12:30:12,584 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-02 12:30:12,584 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-02 12:30:12,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:30:12,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:30:13,316 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-02 12:30:13,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:30:13,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:30:13,598 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-02 12:30:13,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:13 BoogieIcfgContainer [2024-11-02 12:30:13,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:30:13,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:30:13,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:30:13,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:30:13,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:30:11" (1/3) ... [2024-11-02 12:30:13,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214cd5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:13, skipping insertion in model container [2024-11-02 12:30:13,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:12" (2/3) ... [2024-11-02 12:30:13,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214cd5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:13, skipping insertion in model container [2024-11-02 12:30:13,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:13" (3/3) ... [2024-11-02 12:30:13,609 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2024-11-02 12:30:13,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:30:13,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-02 12:30:13,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:30:13,713 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d9e153f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:30:13,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-02 12:30:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 97 states have internal predecessors, (137), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-02 12:30:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 12:30:13,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:13,727 INFO L215 NwaCegarLoop]: trace 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] [2024-11-02 12:30:13,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:13,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 527678932, now seen corresponding path program 1 times [2024-11-02 12:30:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904743973] [2024-11-02 12:30:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:14,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904743973] [2024-11-02 12:30:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904743973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286689998] [2024-11-02 12:30:14,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:14,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:14,166 INFO L87 Difference]: Start difference. First operand has 126 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 97 states have internal predecessors, (137), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:14,374 INFO L93 Difference]: Finished difference Result 284 states and 414 transitions. [2024-11-02 12:30:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-02 12:30:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:14,399 INFO L225 Difference]: With dead ends: 284 [2024-11-02 12:30:14,399 INFO L226 Difference]: Without dead ends: 158 [2024-11-02 12:30:14,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:14,407 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 148 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:14,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 209 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-02 12:30:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-02 12:30:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 120 states have internal predecessors, (164), 26 states have call successors, (26), 12 states have call predecessors, (26), 10 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-02 12:30:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 212 transitions. [2024-11-02 12:30:14,489 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 212 transitions. Word has length 28 [2024-11-02 12:30:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:14,490 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 212 transitions. [2024-11-02 12:30:14,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 212 transitions. [2024-11-02 12:30:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-02 12:30:14,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:14,493 INFO L215 NwaCegarLoop]: trace 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] [2024-11-02 12:30:14,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:30:14,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -44634428, now seen corresponding path program 1 times [2024-11-02 12:30:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947375722] [2024-11-02 12:30:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:14,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947375722] [2024-11-02 12:30:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947375722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817554482] [2024-11-02 12:30:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:14,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:14,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:14,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:14,628 INFO L87 Difference]: Start difference. First operand 154 states and 212 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:14,781 INFO L93 Difference]: Finished difference Result 310 states and 429 transitions. [2024-11-02 12:30:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:14,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-02 12:30:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:14,784 INFO L225 Difference]: With dead ends: 310 [2024-11-02 12:30:14,784 INFO L226 Difference]: Without dead ends: 229 [2024-11-02 12:30:14,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:14,786 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 146 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:14,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 193 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-02 12:30:14,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2024-11-02 12:30:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 180 states have internal predecessors, (245), 33 states have call successors, (33), 16 states have call predecessors, (33), 14 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-02 12:30:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2024-11-02 12:30:14,841 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 29 [2024-11-02 12:30:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:14,842 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2024-11-02 12:30:14,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2024-11-02 12:30:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-02 12:30:14,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:14,850 INFO L215 NwaCegarLoop]: trace 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] [2024-11-02 12:30:14,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:30:14,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1922786818, now seen corresponding path program 1 times [2024-11-02 12:30:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003999111] [2024-11-02 12:30:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:14,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003999111] [2024-11-02 12:30:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003999111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:14,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:14,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367968179] [2024-11-02 12:30:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:14,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:14,970 INFO L87 Difference]: Start difference. First operand 225 states and 307 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:15,096 INFO L93 Difference]: Finished difference Result 465 states and 635 transitions. [2024-11-02 12:30:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-02 12:30:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:15,100 INFO L225 Difference]: With dead ends: 465 [2024-11-02 12:30:15,100 INFO L226 Difference]: Without dead ends: 313 [2024-11-02 12:30:15,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:15,103 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:15,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 277 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-02 12:30:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2024-11-02 12:30:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 239 states have (on average 1.3807531380753137) internal successors, (330), 245 states have internal predecessors, (330), 39 states have call successors, (39), 21 states have call predecessors, (39), 19 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-02 12:30:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 404 transitions. [2024-11-02 12:30:15,171 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 404 transitions. Word has length 30 [2024-11-02 12:30:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 404 transitions. [2024-11-02 12:30:15,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:30:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 404 transitions. [2024-11-02 12:30:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-02 12:30:15,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:15,176 INFO L215 NwaCegarLoop]: trace 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] [2024-11-02 12:30:15,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:30:15,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -170614260, now seen corresponding path program 1 times [2024-11-02 12:30:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574927251] [2024-11-02 12:30:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:15,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574927251] [2024-11-02 12:30:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574927251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816763686] [2024-11-02 12:30:15,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:15,327 INFO L87 Difference]: Start difference. First operand 299 states and 404 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 12:30:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:15,612 INFO L93 Difference]: Finished difference Result 421 states and 577 transitions. [2024-11-02 12:30:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-11-02 12:30:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:15,619 INFO L225 Difference]: With dead ends: 421 [2024-11-02 12:30:15,619 INFO L226 Difference]: Without dead ends: 354 [2024-11-02 12:30:15,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:15,624 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 219 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:15,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 318 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-02 12:30:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2024-11-02 12:30:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 276 states have (on average 1.355072463768116) internal successors, (374), 283 states have internal predecessors, (374), 50 states have call successors, (50), 27 states have call predecessors, (50), 25 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-02 12:30:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 470 transitions. [2024-11-02 12:30:15,660 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 470 transitions. Word has length 35 [2024-11-02 12:30:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 470 transitions. [2024-11-02 12:30:15,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-02 12:30:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 470 transitions. [2024-11-02 12:30:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-02 12:30:15,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:15,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:15,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:30:15,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:15,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1426823612, now seen corresponding path program 1 times [2024-11-02 12:30:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:15,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066179523] [2024-11-02 12:30:15,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 12:30:15,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066179523] [2024-11-02 12:30:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066179523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936943998] [2024-11-02 12:30:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:15,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:15,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:15,780 INFO L87 Difference]: Start difference. First operand 353 states and 470 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:15,877 INFO L93 Difference]: Finished difference Result 516 states and 688 transitions. [2024-11-02 12:30:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2024-11-02 12:30:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:15,880 INFO L225 Difference]: With dead ends: 516 [2024-11-02 12:30:15,881 INFO L226 Difference]: Without dead ends: 358 [2024-11-02 12:30:15,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:15,882 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 32 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:15,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 309 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-02 12:30:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 347. [2024-11-02 12:30:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 270 states have (on average 1.3333333333333333) internal successors, (360), 277 states have internal predecessors, (360), 50 states have call successors, (50), 27 states have call predecessors, (50), 25 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-02 12:30:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 456 transitions. [2024-11-02 12:30:15,915 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 456 transitions. Word has length 43 [2024-11-02 12:30:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 456 transitions. [2024-11-02 12:30:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 456 transitions. [2024-11-02 12:30:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-02 12:30:15,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:15,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:15,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:30:15,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 190696410, now seen corresponding path program 1 times [2024-11-02 12:30:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272303127] [2024-11-02 12:30:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 12:30:15,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:15,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272303127] [2024-11-02 12:30:15,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272303127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:15,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111615301] [2024-11-02 12:30:15,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:15,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:15,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:15,996 INFO L87 Difference]: Start difference. First operand 347 states and 456 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 12:30:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:16,095 INFO L93 Difference]: Finished difference Result 596 states and 780 transitions. [2024-11-02 12:30:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-02 12:30:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:16,098 INFO L225 Difference]: With dead ends: 596 [2024-11-02 12:30:16,099 INFO L226 Difference]: Without dead ends: 393 [2024-11-02 12:30:16,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:16,101 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 131 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:16,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 191 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-02 12:30:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-02 12:30:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 309 states have (on average 1.3042071197411003) internal successors, (403), 316 states have internal predecessors, (403), 54 states have call successors, (54), 30 states have call predecessors, (54), 28 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-02 12:30:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2024-11-02 12:30:16,149 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 46 [2024-11-02 12:30:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:16,150 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2024-11-02 12:30:16,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-02 12:30:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2024-11-02 12:30:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-02 12:30:16,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:16,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:30:16,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -739536376, now seen corresponding path program 1 times [2024-11-02 12:30:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933084446] [2024-11-02 12:30:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:16,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 12:30:16,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:16,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933084446] [2024-11-02 12:30:16,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933084446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:16,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:16,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845718995] [2024-11-02 12:30:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:16,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:16,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:16,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:16,263 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:16,498 INFO L93 Difference]: Finished difference Result 433 states and 554 transitions. [2024-11-02 12:30:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2024-11-02 12:30:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:16,502 INFO L225 Difference]: With dead ends: 433 [2024-11-02 12:30:16,502 INFO L226 Difference]: Without dead ends: 430 [2024-11-02 12:30:16,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:16,505 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 246 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:16,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 190 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-02 12:30:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 392. [2024-11-02 12:30:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 309 states have (on average 1.2977346278317152) internal successors, (401), 315 states have internal predecessors, (401), 53 states have call successors, (53), 30 states have call predecessors, (53), 28 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-02 12:30:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2024-11-02 12:30:16,567 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 47 [2024-11-02 12:30:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:16,568 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2024-11-02 12:30:16,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-02 12:30:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2024-11-02 12:30:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-02 12:30:16,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:16,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:16,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:30:16,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:16,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1451406883, now seen corresponding path program 1 times [2024-11-02 12:30:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923086350] [2024-11-02 12:30:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 12:30:16,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923086350] [2024-11-02 12:30:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923086350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692040652] [2024-11-02 12:30:16,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:16,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:16,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:16,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:30:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:16,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-02 12:30:16,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:17,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:30:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 12:30:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692040652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:30:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1733469224] [2024-11-02 12:30:17,365 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2024-11-02 12:30:17,365 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:30:17,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:30:17,376 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:30:17,377 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:30:20,663 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 71 for LOIs [2024-11-02 12:30:20,680 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 96 for LOIs [2024-11-02 12:30:20,712 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 96 for LOIs [2024-11-02 12:30:21,148 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:30:28,576 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7531#(and (exists ((|v_ULTIMATE.start_eval1_~tmp___0~1#1_11| Int)) (and (not (= |v_ULTIMATE.start_eval1_~tmp___0~1#1_11| 0)) (<= 0 (+ |v_ULTIMATE.start_eval1_~tmp___0~1#1_11| 2147483648)) (<= |v_ULTIMATE.start_eval1_~tmp___0~1#1_11| 2147483647))) (<= 1 |#StackHeapBarrier|) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (not (= ~p_num_write~0 1)) (= ~p_last_write~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (= ~t1_i~0 0))' at error location [2024-11-02 12:30:28,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:30:28,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:30:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-11-02 12:30:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740509810] [2024-11-02 12:30:28,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:30:28,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:30:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:30:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2024-11-02 12:30:28,580 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-02 12:30:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:28,920 INFO L93 Difference]: Finished difference Result 835 states and 1072 transitions. [2024-11-02 12:30:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:30:28,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2024-11-02 12:30:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:28,930 INFO L225 Difference]: With dead ends: 835 [2024-11-02 12:30:28,933 INFO L226 Difference]: Without dead ends: 832 [2024-11-02 12:30:28,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2024-11-02 12:30:28,935 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 358 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:28,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 581 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:30:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-11-02 12:30:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 601. [2024-11-02 12:30:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 486 states have (on average 1.3045267489711934) internal successors, (634), 494 states have internal predecessors, (634), 72 states have call successors, (72), 43 states have call predecessors, (72), 41 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-02 12:30:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 775 transitions. [2024-11-02 12:30:28,999 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 775 transitions. Word has length 48 [2024-11-02 12:30:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:29,000 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 775 transitions. [2024-11-02 12:30:29,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-02 12:30:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 775 transitions. [2024-11-02 12:30:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-02 12:30:29,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:29,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:29,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-02 12:30:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:29,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1714809371, now seen corresponding path program 1 times [2024-11-02 12:30:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351117978] [2024-11-02 12:30:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-02 12:30:29,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351117978] [2024-11-02 12:30:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351117978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:29,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:30:29,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839177058] [2024-11-02 12:30:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:29,453 INFO L87 Difference]: Start difference. First operand 601 states and 775 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-02 12:30:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:29,886 INFO L93 Difference]: Finished difference Result 839 states and 1079 transitions. [2024-11-02 12:30:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-02 12:30:29,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2024-11-02 12:30:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:29,893 INFO L225 Difference]: With dead ends: 839 [2024-11-02 12:30:29,894 INFO L226 Difference]: Without dead ends: 719 [2024-11-02 12:30:29,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-02 12:30:29,896 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 257 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:29,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 324 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:30:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-02 12:30:29,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 705. [2024-11-02 12:30:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 558 states have (on average 1.2956989247311828) internal successors, (723), 567 states have internal predecessors, (723), 92 states have call successors, (92), 55 states have call predecessors, (92), 53 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2024-11-02 12:30:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 904 transitions. [2024-11-02 12:30:29,973 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 904 transitions. Word has length 61 [2024-11-02 12:30:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:29,974 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 904 transitions. [2024-11-02 12:30:29,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-02 12:30:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 904 transitions. [2024-11-02 12:30:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-02 12:30:29,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:29,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:29,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:30:29,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:29,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -613706848, now seen corresponding path program 1 times [2024-11-02 12:30:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:29,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172079281] [2024-11-02 12:30:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-02 12:30:30,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:30,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172079281] [2024-11-02 12:30:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172079281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:30,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:30,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:30,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710337162] [2024-11-02 12:30:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:30,066 INFO L87 Difference]: Start difference. First operand 705 states and 904 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-02 12:30:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:30,211 INFO L93 Difference]: Finished difference Result 881 states and 1128 transitions. [2024-11-02 12:30:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-02 12:30:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:30,217 INFO L225 Difference]: With dead ends: 881 [2024-11-02 12:30:30,218 INFO L226 Difference]: Without dead ends: 759 [2024-11-02 12:30:30,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:30,219 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 27 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:30,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 304 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-11-02 12:30:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 729. [2024-11-02 12:30:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 578 states have (on average 1.2958477508650519) internal successors, (749), 587 states have internal predecessors, (749), 94 states have call successors, (94), 57 states have call predecessors, (94), 55 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-02 12:30:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 934 transitions. [2024-11-02 12:30:30,297 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 934 transitions. Word has length 63 [2024-11-02 12:30:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:30,298 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 934 transitions. [2024-11-02 12:30:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-02 12:30:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 934 transitions. [2024-11-02 12:30:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-02 12:30:30,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:30,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:30,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:30:30,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:30,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -521216194, now seen corresponding path program 2 times [2024-11-02 12:30:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982689491] [2024-11-02 12:30:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-02 12:30:30,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982689491] [2024-11-02 12:30:30,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982689491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:30,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779614982] [2024-11-02 12:30:30,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:30,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:30,349 INFO L87 Difference]: Start difference. First operand 729 states and 934 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 12:30:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:30,486 INFO L93 Difference]: Finished difference Result 1059 states and 1367 transitions. [2024-11-02 12:30:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:30,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2024-11-02 12:30:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:30,492 INFO L225 Difference]: With dead ends: 1059 [2024-11-02 12:30:30,492 INFO L226 Difference]: Without dead ends: 671 [2024-11-02 12:30:30,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:30,494 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 144 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:30,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-02 12:30:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 662. [2024-11-02 12:30:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 521 states have (on average 1.2821497120921306) internal successors, (668), 531 states have internal predecessors, (668), 88 states have call successors, (88), 53 states have call predecessors, (88), 51 states have return successors, (85), 78 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-02 12:30:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 841 transitions. [2024-11-02 12:30:30,562 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 841 transitions. Word has length 61 [2024-11-02 12:30:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:30,562 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 841 transitions. [2024-11-02 12:30:30,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-02 12:30:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 841 transitions. [2024-11-02 12:30:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-02 12:30:30,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:30,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:30,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:30:30,565 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:30,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1871423013, now seen corresponding path program 1 times [2024-11-02 12:30:30,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:30,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783849110] [2024-11-02 12:30:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-02 12:30:30,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783849110] [2024-11-02 12:30:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783849110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848747492] [2024-11-02 12:30:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:30,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:30,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:30,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:30,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:30:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:30,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 12:30:30,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-02 12:30:30,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848747492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-02 12:30:30,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420016767] [2024-11-02 12:30:30,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:30,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:30,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:30,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:30,848 INFO L87 Difference]: Start difference. First operand 662 states and 841 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-02 12:30:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:30,964 INFO L93 Difference]: Finished difference Result 789 states and 1000 transitions. [2024-11-02 12:30:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:30,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2024-11-02 12:30:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:30,967 INFO L225 Difference]: With dead ends: 789 [2024-11-02 12:30:30,967 INFO L226 Difference]: Without dead ends: 255 [2024-11-02 12:30:30,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:30,969 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:30,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 280 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-02 12:30:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-11-02 12:30:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 182 states have internal predecessors, (226), 50 states have call successors, (50), 27 states have call predecessors, (50), 26 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-02 12:30:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 324 transitions. [2024-11-02 12:30:31,001 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 324 transitions. Word has length 73 [2024-11-02 12:30:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:31,002 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 324 transitions. [2024-11-02 12:30:31,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-02 12:30:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 324 transitions. [2024-11-02 12:30:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-02 12:30:31,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:31,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:31,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-02 12:30:31,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-02 12:30:31,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:31,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1441475379, now seen corresponding path program 1 times [2024-11-02 12:30:31,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:31,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229397589] [2024-11-02 12:30:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:31,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-02 12:30:31,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229397589] [2024-11-02 12:30:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229397589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533954058] [2024-11-02 12:30:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:31,255 INFO L87 Difference]: Start difference. First operand 255 states and 324 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-02 12:30:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:31,363 INFO L93 Difference]: Finished difference Result 629 states and 802 transitions. [2024-11-02 12:30:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:31,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-11-02 12:30:31,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:31,367 INFO L225 Difference]: With dead ends: 629 [2024-11-02 12:30:31,367 INFO L226 Difference]: Without dead ends: 380 [2024-11-02 12:30:31,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:31,369 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 65 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:31,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 187 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-02 12:30:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 373. [2024-11-02 12:30:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 262 states have (on average 1.248091603053435) internal successors, (327), 267 states have internal predecessors, (327), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-02 12:30:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 467 transitions. [2024-11-02 12:30:31,430 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 467 transitions. Word has length 79 [2024-11-02 12:30:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:31,431 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 467 transitions. [2024-11-02 12:30:31,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-02 12:30:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 467 transitions. [2024-11-02 12:30:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-02 12:30:31,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:31,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:31,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 12:30:31,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:31,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1678693788, now seen corresponding path program 1 times [2024-11-02 12:30:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611695799] [2024-11-02 12:30:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-02 12:30:31,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611695799] [2024-11-02 12:30:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611695799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:31,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473549135] [2024-11-02 12:30:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:31,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:31,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:31,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-02 12:30:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:31,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 12:30:31,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-02 12:30:31,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473549135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-02 12:30:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662414819] [2024-11-02 12:30:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:31,748 INFO L87 Difference]: Start difference. First operand 373 states and 467 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-02 12:30:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:31,852 INFO L93 Difference]: Finished difference Result 627 states and 803 transitions. [2024-11-02 12:30:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-11-02 12:30:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:31,855 INFO L225 Difference]: With dead ends: 627 [2024-11-02 12:30:31,856 INFO L226 Difference]: Without dead ends: 379 [2024-11-02 12:30:31,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:31,857 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:31,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 175 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-02 12:30:31,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2024-11-02 12:30:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 260 states have (on average 1.2115384615384615) internal successors, (315), 265 states have internal predecessors, (315), 71 states have call successors, (71), 40 states have call predecessors, (71), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-02 12:30:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 455 transitions. [2024-11-02 12:30:31,904 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 455 transitions. Word has length 91 [2024-11-02 12:30:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:31,904 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 455 transitions. [2024-11-02 12:30:31,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-02 12:30:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 455 transitions. [2024-11-02 12:30:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-02 12:30:31,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:31,906 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:31,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-02 12:30:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-02 12:30:32,107 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2017712132, now seen corresponding path program 1 times [2024-11-02 12:30:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175244260] [2024-11-02 12:30:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-02 12:30:32,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175244260] [2024-11-02 12:30:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175244260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004198716] [2024-11-02 12:30:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:32,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:32,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:32,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-02 12:30:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:32,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 12:30:32,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-02 12:30:32,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004198716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:32,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:32,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-02 12:30:32,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003541153] [2024-11-02 12:30:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:32,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:32,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:32,416 INFO L87 Difference]: Start difference. First operand 371 states and 455 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-02 12:30:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:32,505 INFO L93 Difference]: Finished difference Result 676 states and 828 transitions. [2024-11-02 12:30:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-02 12:30:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:32,509 INFO L225 Difference]: With dead ends: 676 [2024-11-02 12:30:32,510 INFO L226 Difference]: Without dead ends: 432 [2024-11-02 12:30:32,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:32,513 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 75 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:32,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-02 12:30:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-11-02 12:30:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 311 states have (on average 1.1864951768488745) internal successors, (369), 316 states have internal predecessors, (369), 73 states have call successors, (73), 48 states have call predecessors, (73), 47 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-02 12:30:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 513 transitions. [2024-11-02 12:30:32,580 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 513 transitions. Word has length 91 [2024-11-02 12:30:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:32,580 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 513 transitions. [2024-11-02 12:30:32,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-02 12:30:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 513 transitions. [2024-11-02 12:30:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-02 12:30:32,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:32,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:32,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-02 12:30:32,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-02 12:30:32,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:32,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1313024437, now seen corresponding path program 1 times [2024-11-02 12:30:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:32,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422367423] [2024-11-02 12:30:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-02 12:30:32,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422367423] [2024-11-02 12:30:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422367423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721355631] [2024-11-02 12:30:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:32,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:32,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:32,970 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:32,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-02 12:30:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:33,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 12:30:33,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-02 12:30:33,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721355631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-02 12:30:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889527329] [2024-11-02 12:30:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:33,117 INFO L87 Difference]: Start difference. First operand 432 states and 513 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-02 12:30:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:33,229 INFO L93 Difference]: Finished difference Result 1008 states and 1197 transitions. [2024-11-02 12:30:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-11-02 12:30:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:33,234 INFO L225 Difference]: With dead ends: 1008 [2024-11-02 12:30:33,234 INFO L226 Difference]: Without dead ends: 583 [2024-11-02 12:30:33,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:30:33,236 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:33,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 156 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-02 12:30:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 471. [2024-11-02 12:30:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 340 states have (on average 1.188235294117647) internal successors, (404), 346 states have internal predecessors, (404), 78 states have call successors, (78), 53 states have call predecessors, (78), 52 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-02 12:30:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 558 transitions. [2024-11-02 12:30:33,303 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 558 transitions. Word has length 92 [2024-11-02 12:30:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:33,303 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 558 transitions. [2024-11-02 12:30:33,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-02 12:30:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 558 transitions. [2024-11-02 12:30:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-02 12:30:33,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:33,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:33,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-02 12:30:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-02 12:30:33,506 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:33,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -606980140, now seen corresponding path program 1 times [2024-11-02 12:30:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396710559] [2024-11-02 12:30:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-02 12:30:33,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396710559] [2024-11-02 12:30:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396710559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942673667] [2024-11-02 12:30:33,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:33,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:33,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-02 12:30:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:33,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-02 12:30:33,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 12:30:33,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:30:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942673667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:30:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-02 12:30:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802437975] [2024-11-02 12:30:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:33,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:33,751 INFO L87 Difference]: Start difference. First operand 471 states and 558 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-02 12:30:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:33,894 INFO L93 Difference]: Finished difference Result 882 states and 1051 transitions. [2024-11-02 12:30:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:33,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-11-02 12:30:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:33,899 INFO L225 Difference]: With dead ends: 882 [2024-11-02 12:30:33,899 INFO L226 Difference]: Without dead ends: 576 [2024-11-02 12:30:33,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:33,901 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:33,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 192 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-02 12:30:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 507. [2024-11-02 12:30:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 368 states have (on average 1.1956521739130435) internal successors, (440), 374 states have internal predecessors, (440), 82 states have call successors, (82), 57 states have call predecessors, (82), 56 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-02 12:30:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 602 transitions. [2024-11-02 12:30:33,980 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 602 transitions. Word has length 92 [2024-11-02 12:30:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:33,981 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 602 transitions. [2024-11-02 12:30:33,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-02 12:30:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 602 transitions. [2024-11-02 12:30:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-02 12:30:33,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:33,984 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:34,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-02 12:30:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-02 12:30:34,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:34,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 153827518, now seen corresponding path program 1 times [2024-11-02 12:30:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:34,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556561894] [2024-11-02 12:30:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-02 12:30:34,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556561894] [2024-11-02 12:30:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556561894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105152384] [2024-11-02 12:30:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:34,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:34,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:34,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:34,348 INFO L87 Difference]: Start difference. First operand 507 states and 602 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-02 12:30:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:34,746 INFO L93 Difference]: Finished difference Result 1288 states and 1537 transitions. [2024-11-02 12:30:34,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:34,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-11-02 12:30:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:34,760 INFO L225 Difference]: With dead ends: 1288 [2024-11-02 12:30:34,760 INFO L226 Difference]: Without dead ends: 1025 [2024-11-02 12:30:34,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:34,766 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 139 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:34,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 222 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2024-11-02 12:30:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 820. [2024-11-02 12:30:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 595 states have (on average 1.1983193277310924) internal successors, (713), 600 states have internal predecessors, (713), 133 states have call successors, (133), 92 states have call predecessors, (133), 91 states have return successors, (131), 128 states have call predecessors, (131), 131 states have call successors, (131) [2024-11-02 12:30:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 977 transitions. [2024-11-02 12:30:34,921 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 977 transitions. Word has length 94 [2024-11-02 12:30:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:34,922 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 977 transitions. [2024-11-02 12:30:34,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-02 12:30:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 977 transitions. [2024-11-02 12:30:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-02 12:30:34,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:34,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-02 12:30:34,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 12:30:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1442250941, now seen corresponding path program 1 times [2024-11-02 12:30:34,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:34,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277894612] [2024-11-02 12:30:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:34,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:30:34,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 12:30:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:30:35,017 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 12:30:35,018 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 12:30:35,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-02 12:30:35,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-02 12:30:35,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-02 12:30:35,025 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:35,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 12:30:35,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:30:35 BoogieIcfgContainer [2024-11-02 12:30:35,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 12:30:35,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 12:30:35,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 12:30:35,165 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 12:30:35,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:13" (3/4) ... [2024-11-02 12:30:35,167 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 12:30:35,312 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 12:30:35,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 12:30:35,313 INFO L158 Benchmark]: Toolchain (without parser) took 23510.84ms. Allocated memory was 117.4MB in the beginning and 423.6MB in the end (delta: 306.2MB). Free memory was 60.1MB in the beginning and 328.0MB in the end (delta: -267.9MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,313 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:30:35,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.35ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 59.8MB in the beginning and 107.1MB in the end (delta: -47.3MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.08ms. Allocated memory is still 148.9MB. Free memory was 107.1MB in the beginning and 103.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,314 INFO L158 Benchmark]: Boogie Preprocessor took 59.20ms. Allocated memory is still 148.9MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,315 INFO L158 Benchmark]: RCFGBuilder took 1100.20ms. Allocated memory is still 148.9MB. Free memory was 101.6MB in the beginning and 98.2MB in the end (delta: 3.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,315 INFO L158 Benchmark]: TraceAbstraction took 21563.24ms. Allocated memory was 148.9MB in the beginning and 423.6MB in the end (delta: 274.7MB). Free memory was 98.2MB in the beginning and 341.6MB in the end (delta: -243.4MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,315 INFO L158 Benchmark]: Witness Printer took 147.72ms. Allocated memory is still 423.6MB. Free memory was 341.6MB in the beginning and 328.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-02 12:30:35,317 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.35ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 59.8MB in the beginning and 107.1MB in the end (delta: -47.3MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.08ms. Allocated memory is still 148.9MB. Free memory was 107.1MB in the beginning and 103.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.20ms. Allocated memory is still 148.9MB. Free memory was 103.7MB in the beginning and 101.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1100.20ms. Allocated memory is still 148.9MB. Free memory was 101.6MB in the beginning and 98.2MB in the end (delta: 3.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21563.24ms. Allocated memory was 148.9MB in the beginning and 423.6MB in the end (delta: 274.7MB). Free memory was 98.2MB in the beginning and 341.6MB in the end (delta: -243.4MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 147.72ms. Allocated memory is still 423.6MB. Free memory was 341.6MB in the beginning and 328.0MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] int local ; [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) [L646] COND FALSE !(T1_E == 0) [L651] COND FALSE !(E_M == 0) [L656] COND FALSE !(E_1 == 0) [L805] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) [L806] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) [L674] COND FALSE !(T1_E == 1) [L679] COND FALSE !(E_M == 1) [L684] COND FALSE !(E_1 == 1) [L807] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 [L622] RET transmit1() [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 [L723] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 [L489] token += 1 [L490] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) [L723] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 [L483] t1_pc = 1 [L484] t1_st = 2 [L622] RET transmit1() [L592] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 [L583] return (__retres1); [L595] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) [L444] COND TRUE tmp_var <= 5 [L445] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L453] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 126 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2220 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2207 mSDsluCounter, 4414 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1283 IncrementalHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 2553 mSDtfsCounter, 1283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=820occurred in iteration=18, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 757 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1687 NumberOfCodeBlocks, 1687 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 2796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 25 InterpolantComputations, 17 PerfectInterpolantSequences, 641/711 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-02 12:30:35,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16fe74ac-0583-45db-91a8-a6537396efbd/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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