./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje --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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:29:40,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:29:41,000 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:29:41,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:29:41,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:29:41,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:29:41,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:29:41,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:29:41,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:29:41,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:29:41,051 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:29:41,051 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:29:41,052 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:29:41,052 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:29:41,052 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:29:41,053 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:29:41,053 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:29:41,054 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:29:41,054 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:29:41,054 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:29:41,055 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:29:41,055 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:29:41,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:29:41,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:29:41,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:29:41,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:29:41,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:29:41,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:29:41,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:29:41,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:29:41,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:29:41,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:29:41,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:29:41,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:29:41,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:29:41,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:29:41,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:29:41,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:29:41,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:29:41,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:29:41,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:29:41,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:29:41,067 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:29:41,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:29:41,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:29:41,068 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:29:41,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:29:41,068 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_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/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_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2024-11-09 06:29:41,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:29:41,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:29:41,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:29:41,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:29:41,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:29:41,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-09 06:29:43,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:29:43,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:29:43,713 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-09 06:29:43,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/data/a54385e10/9f60583e86274f79a42e8eb4226fe78d/FLAG67ef2b5c5 [2024-11-09 06:29:43,748 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/data/a54385e10/9f60583e86274f79a42e8eb4226fe78d [2024-11-09 06:29:43,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:29:43,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:29:43,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:29:43,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:29:43,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:29:43,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:29:43" (1/1) ... [2024-11-09 06:29:43,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5e1bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:43, skipping insertion in model container [2024-11-09 06:29:43,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:29:43" (1/1) ... [2024-11-09 06:29:43,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:29:44,106 WARN L250 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_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-09 06:29:44,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:29:44,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:29:44,267 WARN L250 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_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-09 06:29:44,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:29:44,305 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:29:44,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44 WrapperNode [2024-11-09 06:29:44,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:29:44,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:29:44,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:29:44,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:29:44,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,386 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 506 [2024-11-09 06:29:44,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:29:44,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:29:44,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:29:44,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:29:44,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:29:44,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:29:44,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:29:44,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:29:44,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (1/1) ... [2024-11-09 06:29:44,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:29:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:29:44,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:29:44,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:29:44,560 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-09 06:29:44,560 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-09 06:29:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:29:44,561 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-09 06:29:44,561 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-09 06:29:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-09 06:29:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-09 06:29:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-09 06:29:44,562 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-09 06:29:44,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:29:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:29:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:29:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-09 06:29:44,563 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-09 06:29:44,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:29:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:29:44,564 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-09 06:29:44,564 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-09 06:29:44,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:29:44,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:29:45,717 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-09 06:29:45,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:29:46,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:29:46,058 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:29:46,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:46 BoogieIcfgContainer [2024-11-09 06:29:46,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:29:46,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:29:46,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:29:46,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:29:46,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:29:43" (1/3) ... [2024-11-09 06:29:46,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288145cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:29:46, skipping insertion in model container [2024-11-09 06:29:46,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:29:44" (2/3) ... [2024-11-09 06:29:46,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288145cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:29:46, skipping insertion in model container [2024-11-09 06:29:46,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:46" (3/3) ... [2024-11-09 06:29:46,072 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-09 06:29:46,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:29:46,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:29:46,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:29:46,181 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;@270de54f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:29:46,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:29:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 06:29:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:29:46,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:46,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:46,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:46,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:46,206 INFO L85 PathProgramCache]: Analyzing trace with hash -921747100, now seen corresponding path program 1 times [2024-11-09 06:29:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27145790] [2024-11-09 06:29:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:46,905 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-09 06:29:46,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27145790] [2024-11-09 06:29:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27145790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:46,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759108618] [2024-11-09 06:29:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:46,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:46,954 INFO L87 Difference]: Start difference. First operand has 149 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 111 states have internal predecessors, (168), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:29:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:47,174 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2024-11-09 06:29:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:47,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 06:29:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:47,191 INFO L225 Difference]: With dead ends: 298 [2024-11-09 06:29:47,191 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 06:29:47,196 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-09 06:29:47,200 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:47,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 06:29:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-09 06:29:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 113 states have internal predecessors, (169), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 06:29:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2024-11-09 06:29:47,288 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2024-11-09 06:29:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:47,289 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2024-11-09 06:29:47,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:29:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2024-11-09 06:29:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 06:29:47,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:47,294 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:29:47,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:29:47,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:47,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1021669553, now seen corresponding path program 1 times [2024-11-09 06:29:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:47,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681783162] [2024-11-09 06:29:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:47,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681783162] [2024-11-09 06:29:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681783162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:47,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:29:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861152623] [2024-11-09 06:29:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:47,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:29:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:47,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:29:47,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:29:47,622 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:29:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:47,901 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2024-11-09 06:29:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:29:47,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-11-09 06:29:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:47,906 INFO L225 Difference]: With dead ends: 337 [2024-11-09 06:29:47,906 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 06:29:47,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:29:47,913 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 324 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:47,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 572 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:29:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 06:29:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-09 06:29:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 141 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2024-11-09 06:29:47,953 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2024-11-09 06:29:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:47,954 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2024-11-09 06:29:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:29:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2024-11-09 06:29:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:29:47,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:47,957 INFO L215 NwaCegarLoop]: trace histogram [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-09 06:29:47,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:29:47,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -328840025, now seen corresponding path program 1 times [2024-11-09 06:29:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:47,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957356650] [2024-11-09 06:29:47,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:47,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:48,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957356650] [2024-11-09 06:29:48,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957356650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:48,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:29:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461462570] [2024-11-09 06:29:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:29:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:48,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:29:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:29:48,154 INFO L87 Difference]: Start difference. First operand 186 states and 281 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:29:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:48,397 INFO L93 Difference]: Finished difference Result 336 states and 509 transitions. [2024-11-09 06:29:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:29:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-09 06:29:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:48,400 INFO L225 Difference]: With dead ends: 336 [2024-11-09 06:29:48,401 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 06:29:48,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:29:48,403 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 319 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:48,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 575 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:29:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 06:29:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-09 06:29:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.50354609929078) internal successors, (212), 141 states have internal predecessors, (212), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2024-11-09 06:29:48,423 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2024-11-09 06:29:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:48,424 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2024-11-09 06:29:48,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:29:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2024-11-09 06:29:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:29:48,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:48,426 INFO L215 NwaCegarLoop]: trace histogram [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-09 06:29:48,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:29:48,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1598475538, now seen corresponding path program 1 times [2024-11-09 06:29:48,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408408615] [2024-11-09 06:29:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:48,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:48,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408408615] [2024-11-09 06:29:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408408615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873422203] [2024-11-09 06:29:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:48,695 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:29:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:48,790 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2024-11-09 06:29:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-09 06:29:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:48,792 INFO L225 Difference]: With dead ends: 340 [2024-11-09 06:29:48,793 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 06:29:48,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 06:29:48,795 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:48,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 06:29:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-09 06:29:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.4896551724137932) internal successors, (216), 145 states have internal predecessors, (216), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2024-11-09 06:29:48,833 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2024-11-09 06:29:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:48,834 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2024-11-09 06:29:48,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:29:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2024-11-09 06:29:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:29:48,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:48,839 INFO L215 NwaCegarLoop]: trace histogram [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-09 06:29:48,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:29:48,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:48,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -244681224, now seen corresponding path program 1 times [2024-11-09 06:29:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:48,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576271719] [2024-11-09 06:29:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:49,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:49,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576271719] [2024-11-09 06:29:49,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576271719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122441965] [2024-11-09 06:29:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:49,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:49,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:49,152 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:29:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:49,251 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2024-11-09 06:29:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:49,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-09 06:29:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:49,254 INFO L225 Difference]: With dead ends: 350 [2024-11-09 06:29:49,257 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 06:29:49,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 06:29:49,259 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 4 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:49,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 06:29:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 06:29:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2024-11-09 06:29:49,290 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2024-11-09 06:29:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:49,292 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2024-11-09 06:29:49,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:29:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2024-11-09 06:29:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 06:29:49,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:49,295 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-11-09 06:29:49,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:29:49,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1779556478, now seen corresponding path program 1 times [2024-11-09 06:29:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440048401] [2024-11-09 06:29:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:49,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:49,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440048401] [2024-11-09 06:29:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440048401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993392852] [2024-11-09 06:29:49,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:49,587 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:29:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:49,678 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2024-11-09 06:29:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2024-11-09 06:29:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:49,681 INFO L225 Difference]: With dead ends: 359 [2024-11-09 06:29:49,682 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 06:29:49,682 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-09 06:29:49,683 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:49,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 643 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 06:29:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-09 06:29:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-11-09 06:29:49,709 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2024-11-09 06:29:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:49,710 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-11-09 06:29:49,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:29:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-11-09 06:29:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 06:29:49,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:49,712 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:29:49,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 616902825, now seen corresponding path program 1 times [2024-11-09 06:29:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:49,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549758447] [2024-11-09 06:29:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:29:49,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549758447] [2024-11-09 06:29:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549758447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873551506] [2024-11-09 06:29:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:49,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:49,989 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:29:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:50,095 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2024-11-09 06:29:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2024-11-09 06:29:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:50,098 INFO L225 Difference]: With dead ends: 368 [2024-11-09 06:29:50,098 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 06:29:50,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 06:29:50,101 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 4 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:50,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 06:29:50,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 06:29:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2024-11-09 06:29:50,122 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2024-11-09 06:29:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:50,124 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2024-11-09 06:29:50,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:29:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2024-11-09 06:29:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 06:29:50,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:50,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:29:50,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 681298057, now seen corresponding path program 1 times [2024-11-09 06:29:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011906023] [2024-11-09 06:29:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:50,430 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-09 06:29:50,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011906023] [2024-11-09 06:29:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011906023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:50,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:29:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:29:50,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831655524] [2024-11-09 06:29:50,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:50,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:29:50,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:50,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:29:50,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:29:50,432 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 06:29:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:50,522 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2024-11-09 06:29:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:29:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2024-11-09 06:29:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:50,525 INFO L225 Difference]: With dead ends: 379 [2024-11-09 06:29:50,525 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 06:29:50,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 06:29:50,528 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 5 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:50,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 645 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:29:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 06:29:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-09 06:29:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 161 states have (on average 1.4409937888198758) internal successors, (232), 161 states have internal predecessors, (232), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:29:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-11-09 06:29:50,550 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2024-11-09 06:29:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:50,550 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-11-09 06:29:50,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 06:29:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-11-09 06:29:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 06:29:50,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:50,561 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:29:50,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:50,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2083388927, now seen corresponding path program 1 times [2024-11-09 06:29:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731181495] [2024-11-09 06:29:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:29:51,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731181495] [2024-11-09 06:29:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731181495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:29:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012650205] [2024-11-09 06:29:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:51,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:29:51,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:29:51,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:29:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:51,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:29:51,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:29:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:29:51,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:29:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012650205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:29:51,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:29:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-09 06:29:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239340644] [2024-11-09 06:29:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:29:51,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:29:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:29:51,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:29:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:29:51,877 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:29:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:52,192 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2024-11-09 06:29:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:29:52,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2024-11-09 06:29:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:52,196 INFO L225 Difference]: With dead ends: 598 [2024-11-09 06:29:52,196 INFO L226 Difference]: Without dead ends: 398 [2024-11-09 06:29:52,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:29:52,198 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 216 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:52,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1011 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:29:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-09 06:29:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-09 06:29:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 300 states have internal predecessors, (425), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 06:29:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2024-11-09 06:29:52,232 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2024-11-09 06:29:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:52,232 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2024-11-09 06:29:52,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 6 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:29:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2024-11-09 06:29:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 06:29:52,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:52,239 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:52,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:29:52,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:52,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:29:52,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:52,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2038727964, now seen corresponding path program 1 times [2024-11-09 06:29:52,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:29:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557471903] [2024-11-09 06:29:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:29:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:29:53,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:29:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557471903] [2024-11-09 06:29:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557471903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:29:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96982658] [2024-11-09 06:29:53,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:53,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:29:53,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:29:53,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:29:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:53,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:29:53,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:29:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:29:54,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:29:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:29:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96982658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:29:54,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148203385] [2024-11-09 06:29:54,431 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2024-11-09 06:29:54,431 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:29:54,435 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:29:54,441 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:29:54,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:30:12,361 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:30:12,367 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:30:12,369 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 80 for LOIs [2024-11-09 06:30:12,627 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 131 for LOIs [2024-11-09 06:30:14,138 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 106 for LOIs [2024-11-09 06:30:14,867 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:30:15,050 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:30:48,146 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7732#(and (<= 0 ~side2Failed_History_0~0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_#t~ret16#1_15| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_14| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_15| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_15| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_14| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret15#1_15| 0)) (<= |v_ULTIMATE.start_check_#t~ret15#1_15| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_15|) (exists ((|v_ULTIMATE.start_check_~tmp___0~0#1_15| Int)) (and (<= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 127) (or (and (= ~s1p_new~0 ~nomsg~0) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0))) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___0~0#1_15|)) (not (= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 0)))) (= |v_ULTIMATE.start_check_~tmp___7~0#1_14| 1) (not (= (mod ~side1Failed_History_1~0 256) 0)))) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_14| 0))) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:30:48,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:30:48,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:30:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 06:30:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315472114] [2024-11-09 06:30:48,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:30:48,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:30:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:30:48,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=3442, Unknown=4, NotChecked=0, Total=3782 [2024-11-09 06:30:48,151 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-09 06:30:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:49,084 INFO L93 Difference]: Finished difference Result 1011 states and 1402 transitions. [2024-11-09 06:30:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:30:49,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) Word has length 62 [2024-11-09 06:30:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:49,095 INFO L225 Difference]: With dead ends: 1011 [2024-11-09 06:30:49,099 INFO L226 Difference]: Without dead ends: 676 [2024-11-09 06:30:49,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=398, Invalid=4710, Unknown=4, NotChecked=0, Total=5112 [2024-11-09 06:30:49,103 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 262 mSDsluCounter, 3152 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:49,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 3439 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:30:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-09 06:30:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 514. [2024-11-09 06:30:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 384 states have (on average 1.4140625) internal successors, (543), 387 states have internal predecessors, (543), 88 states have call successors, (88), 41 states have call predecessors, (88), 41 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 06:30:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 719 transitions. [2024-11-09 06:30:49,163 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 719 transitions. Word has length 62 [2024-11-09 06:30:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 719 transitions. [2024-11-09 06:30:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 6.769230769230769) internal successors, (88), 16 states have internal predecessors, (88), 6 states have call successors, (20), 3 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 6 states have call successors, (19) [2024-11-09 06:30:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 719 transitions. [2024-11-09 06:30:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:30:49,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:49,165 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:49,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:30:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:49,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1789814189, now seen corresponding path program 1 times [2024-11-09 06:30:49,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:49,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225790524] [2024-11-09 06:30:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:49,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:30:49,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225790524] [2024-11-09 06:30:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225790524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:30:49,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300745183] [2024-11-09 06:30:49,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:49,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:30:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:49,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:30:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:30:49,630 INFO L87 Difference]: Start difference. First operand 514 states and 719 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 06:30:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:49,745 INFO L93 Difference]: Finished difference Result 969 states and 1355 transitions. [2024-11-09 06:30:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:30:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2024-11-09 06:30:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:49,750 INFO L225 Difference]: With dead ends: 969 [2024-11-09 06:30:49,750 INFO L226 Difference]: Without dead ends: 526 [2024-11-09 06:30:49,752 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-09 06:30:49,753 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:49,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 643 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-09 06:30:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-11-09 06:30:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 393 states have (on average 1.4045801526717556) internal successors, (552), 396 states have internal predecessors, (552), 88 states have call successors, (88), 44 states have call predecessors, (88), 44 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-09 06:30:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 728 transitions. [2024-11-09 06:30:49,796 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 728 transitions. Word has length 66 [2024-11-09 06:30:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:49,797 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 728 transitions. [2024-11-09 06:30:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 06:30:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 728 transitions. [2024-11-09 06:30:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 06:30:49,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:49,799 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:49,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:30:49,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:49,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1876933434, now seen corresponding path program 1 times [2024-11-09 06:30:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:49,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19831183] [2024-11-09 06:30:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:49,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:30:50,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19831183] [2024-11-09 06:30:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19831183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:30:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996468555] [2024-11-09 06:30:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:50,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:50,654 INFO L87 Difference]: Start difference. First operand 526 states and 728 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:30:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:51,290 INFO L93 Difference]: Finished difference Result 1117 states and 1518 transitions. [2024-11-09 06:30:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:30:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2024-11-09 06:30:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:51,296 INFO L225 Difference]: With dead ends: 1117 [2024-11-09 06:30:51,296 INFO L226 Difference]: Without dead ends: 658 [2024-11-09 06:30:51,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:30:51,298 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 388 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:51,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:30:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-09 06:30:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 647. [2024-11-09 06:30:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 479 states have (on average 1.3632567849686847) internal successors, (653), 482 states have internal predecessors, (653), 109 states have call successors, (109), 58 states have call predecessors, (109), 58 states have return successors, (109), 106 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-09 06:30:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 871 transitions. [2024-11-09 06:30:51,374 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 871 transitions. Word has length 71 [2024-11-09 06:30:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:51,375 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 871 transitions. [2024-11-09 06:30:51,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:30:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 871 transitions. [2024-11-09 06:30:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 06:30:51,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:51,377 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:30:51,377 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -72943450, now seen corresponding path program 1 times [2024-11-09 06:30:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347779964] [2024-11-09 06:30:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:30:51,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347779964] [2024-11-09 06:30:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347779964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:30:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378672747] [2024-11-09 06:30:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:51,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:30:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:30:51,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:30:51,510 INFO L87 Difference]: Start difference. First operand 647 states and 871 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 06:30:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:51,753 INFO L93 Difference]: Finished difference Result 1576 states and 2122 transitions. [2024-11-09 06:30:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:30:51,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 71 [2024-11-09 06:30:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:51,763 INFO L225 Difference]: With dead ends: 1576 [2024-11-09 06:30:51,763 INFO L226 Difference]: Without dead ends: 1140 [2024-11-09 06:30:51,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 06:30:51,766 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 187 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:51,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 953 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-09 06:30:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1055. [2024-11-09 06:30:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 780 states have (on average 1.3525641025641026) internal successors, (1055), 786 states have internal predecessors, (1055), 178 states have call successors, (178), 96 states have call predecessors, (178), 96 states have return successors, (178), 172 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-09 06:30:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1411 transitions. [2024-11-09 06:30:51,896 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1411 transitions. Word has length 71 [2024-11-09 06:30:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:51,897 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1411 transitions. [2024-11-09 06:30:51,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 06:30:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1411 transitions. [2024-11-09 06:30:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 06:30:51,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:51,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:30:51,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1226714359, now seen corresponding path program 1 times [2024-11-09 06:30:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465088461] [2024-11-09 06:30:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 06:30:52,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465088461] [2024-11-09 06:30:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465088461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584365898] [2024-11-09 06:30:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:52,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:52,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:30:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:52,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:30:52,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 06:30:53,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:30:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584365898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:30:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2024-11-09 06:30:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641490] [2024-11-09 06:30:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:53,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:30:53,069 INFO L87 Difference]: Start difference. First operand 1055 states and 1411 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 06:30:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:53,475 INFO L93 Difference]: Finished difference Result 2186 states and 3010 transitions. [2024-11-09 06:30:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:30:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-09 06:30:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:53,486 INFO L225 Difference]: With dead ends: 2186 [2024-11-09 06:30:53,487 INFO L226 Difference]: Without dead ends: 1403 [2024-11-09 06:30:53,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:30:53,490 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 126 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:53,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2486 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-09 06:30:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1062. [2024-11-09 06:30:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 783 states have (on average 1.342273307790549) internal successors, (1051), 791 states have internal predecessors, (1051), 180 states have call successors, (180), 98 states have call predecessors, (180), 98 states have return successors, (180), 172 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-09 06:30:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1411 transitions. [2024-11-09 06:30:53,630 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1411 transitions. Word has length 73 [2024-11-09 06:30:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:53,630 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1411 transitions. [2024-11-09 06:30:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 06:30:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1411 transitions. [2024-11-09 06:30:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 06:30:53,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:53,633 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:53,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:30:53,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:53,837 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:53,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash -729638853, now seen corresponding path program 1 times [2024-11-09 06:30:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685110128] [2024-11-09 06:30:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:30:54,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685110128] [2024-11-09 06:30:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685110128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:54,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:54,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:30:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248044696] [2024-11-09 06:30:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:54,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:30:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:30:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:30:54,529 INFO L87 Difference]: Start difference. First operand 1062 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 06:30:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:55,477 INFO L93 Difference]: Finished difference Result 2496 states and 3305 transitions. [2024-11-09 06:30:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:30:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2024-11-09 06:30:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:55,489 INFO L225 Difference]: With dead ends: 2496 [2024-11-09 06:30:55,489 INFO L226 Difference]: Without dead ends: 1696 [2024-11-09 06:30:55,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:30:55,493 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 522 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:55,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1700 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:30:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-11-09 06:30:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1648. [2024-11-09 06:30:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1204 states have (on average 1.3264119601328903) internal successors, (1597), 1217 states have internal predecessors, (1597), 288 states have call successors, (288), 155 states have call predecessors, (288), 155 states have return successors, (288), 275 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-09 06:30:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2173 transitions. [2024-11-09 06:30:55,745 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2173 transitions. Word has length 73 [2024-11-09 06:30:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:55,746 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2173 transitions. [2024-11-09 06:30:55,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 06:30:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2173 transitions. [2024-11-09 06:30:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 06:30:55,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:55,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:30:55,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:30:55,750 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:55,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2106091589, now seen corresponding path program 1 times [2024-11-09 06:30:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688361864] [2024-11-09 06:30:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:30:56,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:56,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688361864] [2024-11-09 06:30:56,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688361864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:56,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179616335] [2024-11-09 06:30:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:56,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:56,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:56,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:30:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:56,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:30:56,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:30:56,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:30:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179616335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:30:56,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-09 06:30:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986852406] [2024-11-09 06:30:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:56,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:30:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:30:56,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:30:56,541 INFO L87 Difference]: Start difference. First operand 1648 states and 2173 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 06:30:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:56,967 INFO L93 Difference]: Finished difference Result 2874 states and 3799 transitions. [2024-11-09 06:30:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:30:56,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-09 06:30:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:56,978 INFO L225 Difference]: With dead ends: 2874 [2024-11-09 06:30:56,979 INFO L226 Difference]: Without dead ends: 1626 [2024-11-09 06:30:56,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:30:56,983 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 8 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:56,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1018 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:30:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-09 06:30:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626. [2024-11-09 06:30:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1193 states have (on average 1.3017602682313496) internal successors, (1553), 1206 states have internal predecessors, (1553), 277 states have call successors, (277), 155 states have call predecessors, (277), 155 states have return successors, (277), 264 states have call predecessors, (277), 277 states have call successors, (277) [2024-11-09 06:30:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2107 transitions. [2024-11-09 06:30:57,264 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2107 transitions. Word has length 76 [2024-11-09 06:30:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2107 transitions. [2024-11-09 06:30:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 06:30:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2107 transitions. [2024-11-09 06:30:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:30:57,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:57,267 INFO L215 NwaCegarLoop]: trace histogram [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, 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-09 06:30:57,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:30:57,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:30:57,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:57,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash -79576832, now seen corresponding path program 1 times [2024-11-09 06:30:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:57,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846992998] [2024-11-09 06:30:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:30:57,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846992998] [2024-11-09 06:30:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846992998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:30:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360313120] [2024-11-09 06:30:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:30:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:30:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:30:57,641 INFO L87 Difference]: Start difference. First operand 1626 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 06:30:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:58,100 INFO L93 Difference]: Finished difference Result 3712 states and 4830 transitions. [2024-11-09 06:30:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:30:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 75 [2024-11-09 06:30:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:58,120 INFO L225 Difference]: With dead ends: 3712 [2024-11-09 06:30:58,120 INFO L226 Difference]: Without dead ends: 2627 [2024-11-09 06:30:58,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 06:30:58,125 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 187 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:58,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 721 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-11-09 06:30:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2344. [2024-11-09 06:30:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1717 states have (on average 1.2941176470588236) internal successors, (2222), 1735 states have internal predecessors, (2222), 404 states have call successors, (404), 222 states have call predecessors, (404), 222 states have return successors, (404), 386 states have call predecessors, (404), 404 states have call successors, (404) [2024-11-09 06:30:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3030 transitions. [2024-11-09 06:30:58,505 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3030 transitions. Word has length 75 [2024-11-09 06:30:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:58,505 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3030 transitions. [2024-11-09 06:30:58,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 06:30:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3030 transitions. [2024-11-09 06:30:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:30:58,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:58,509 INFO L215 NwaCegarLoop]: trace histogram [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, 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-09 06:30:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:30:58,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1329285914, now seen corresponding path program 1 times [2024-11-09 06:30:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479106427] [2024-11-09 06:30:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:30:58,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:58,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479106427] [2024-11-09 06:30:58,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479106427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:58,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:58,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:30:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901362823] [2024-11-09 06:30:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:58,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:30:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:30:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:30:58,667 INFO L87 Difference]: Start difference. First operand 2344 states and 3030 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 06:30:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:30:59,244 INFO L93 Difference]: Finished difference Result 5034 states and 6532 transitions. [2024-11-09 06:30:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:30:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 75 [2024-11-09 06:30:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:30:59,268 INFO L225 Difference]: With dead ends: 5034 [2024-11-09 06:30:59,268 INFO L226 Difference]: Without dead ends: 3257 [2024-11-09 06:30:59,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 06:30:59,275 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 181 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:30:59,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1012 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:30:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2024-11-09 06:30:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3233. [2024-11-09 06:30:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 2365 states have (on average 1.2862579281183932) internal successors, (3042), 2390 states have internal predecessors, (3042), 561 states have call successors, (561), 306 states have call predecessors, (561), 306 states have return successors, (561), 536 states have call predecessors, (561), 561 states have call successors, (561) [2024-11-09 06:30:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4164 transitions. [2024-11-09 06:30:59,823 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4164 transitions. Word has length 75 [2024-11-09 06:30:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:30:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4164 transitions. [2024-11-09 06:30:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 06:30:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4164 transitions. [2024-11-09 06:30:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 06:30:59,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:30:59,831 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 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-09 06:30:59,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:30:59,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:30:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:30:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1552653658, now seen corresponding path program 1 times [2024-11-09 06:30:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:30:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542549902] [2024-11-09 06:30:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:30:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:30:59,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:30:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542549902] [2024-11-09 06:30:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542549902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:30:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:30:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:30:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900429286] [2024-11-09 06:30:59,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:30:59,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:30:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:30:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:30:59,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:30:59,912 INFO L87 Difference]: Start difference. First operand 3233 states and 4164 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 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-09 06:31:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:00,466 INFO L93 Difference]: Finished difference Result 5842 states and 7559 transitions. [2024-11-09 06:31:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:31:00,466 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), 2 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 76 [2024-11-09 06:31:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:00,491 INFO L225 Difference]: With dead ends: 5842 [2024-11-09 06:31:00,491 INFO L226 Difference]: Without dead ends: 3258 [2024-11-09 06:31:00,499 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-09 06:31:00,500 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:00,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 402 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2024-11-09 06:31:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 3238. [2024-11-09 06:31:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 2370 states have (on average 1.2856540084388186) internal successors, (3047), 2395 states have internal predecessors, (3047), 561 states have call successors, (561), 306 states have call predecessors, (561), 306 states have return successors, (561), 536 states have call predecessors, (561), 561 states have call successors, (561) [2024-11-09 06:31:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4169 transitions. [2024-11-09 06:31:01,007 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4169 transitions. Word has length 76 [2024-11-09 06:31:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:01,008 INFO L471 AbstractCegarLoop]: Abstraction has 3238 states and 4169 transitions. [2024-11-09 06:31:01,008 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), 2 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-09 06:31:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4169 transitions. [2024-11-09 06:31:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:31:01,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:01,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:31:01,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:31:01,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:01,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 943381522, now seen corresponding path program 1 times [2024-11-09 06:31:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155048109] [2024-11-09 06:31:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 06:31:01,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:01,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155048109] [2024-11-09 06:31:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155048109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:01,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440430177] [2024-11-09 06:31:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:01,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:01,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:01,879 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:01,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:31:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:02,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:31:02,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:31:02,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 06:31:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440430177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241510384] [2024-11-09 06:31:03,277 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2024-11-09 06:31:03,277 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:31:03,277 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:31:03,278 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:31:03,278 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:31:10,078 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:31:10,084 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:31:10,086 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 18 for LOIs [2024-11-09 06:31:10,099 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 72 for LOIs [2024-11-09 06:31:10,194 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 39 for LOIs [2024-11-09 06:31:10,225 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:31:10,476 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:31:23,306 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '66909#(and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (not (= ~active_side_History_0~0 1)) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_17| Int) (|v_ULTIMATE.start_check_#t~ret20#1_18| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret11#1_17| Int) (|v_ULTIMATE.start_check_~tmp___1~0#1_16| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret11#1_17|) (not (= |v_ULTIMATE.start_check_#t~ret11#1_17| 0)) (<= |v_ULTIMATE.start_check_#t~ret11#1_17| 1) (= |v_ULTIMATE.start_check_~tmp___1~0#1_16| 1))) (<= |v_ULTIMATE.start_check_#t~ret20#1_18| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_18|) (not (= |v_ULTIMATE.start_check_#t~ret20#1_18| 0)) (= |v_ULTIMATE.start_check_~tmp___12~0#1_17| 1) (= (mod ~side1Failed_History_1~0 256) 0) (not (= ~side2Failed_History_1~0 0)))) (= ~side2_written~0 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:31:23,306 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:31:23,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:31:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 27 [2024-11-09 06:31:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019372623] [2024-11-09 06:31:23,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:31:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 06:31:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 06:31:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=5330, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 06:31:23,311 INFO L87 Difference]: Start difference. First operand 3238 states and 4169 transitions. Second operand has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-09 06:31:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:27,706 INFO L93 Difference]: Finished difference Result 7545 states and 9644 transitions. [2024-11-09 06:31:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-09 06:31:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) Word has length 78 [2024-11-09 06:31:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:27,740 INFO L225 Difference]: With dead ends: 7545 [2024-11-09 06:31:27,740 INFO L226 Difference]: Without dead ends: 4734 [2024-11-09 06:31:27,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=742, Invalid=11690, Unknown=0, NotChecked=0, Total=12432 [2024-11-09 06:31:27,752 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 884 mSDsluCounter, 6680 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 7216 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:27,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 7216 Invalid, 2317 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [242 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 06:31:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4734 states. [2024-11-09 06:31:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4734 to 4131. [2024-11-09 06:31:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4131 states, 3014 states have (on average 1.2793629727936298) internal successors, (3856), 3048 states have internal predecessors, (3856), 717 states have call successors, (717), 399 states have call predecessors, (717), 399 states have return successors, (717), 683 states have call predecessors, (717), 717 states have call successors, (717) [2024-11-09 06:31:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 5290 transitions. [2024-11-09 06:31:28,428 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 5290 transitions. Word has length 78 [2024-11-09 06:31:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 4131 states and 5290 transitions. [2024-11-09 06:31:28,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 7 states have call successors, (27), 4 states have call predecessors, (27), 9 states have return successors, (26), 10 states have call predecessors, (26), 7 states have call successors, (26) [2024-11-09 06:31:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 5290 transitions. [2024-11-09 06:31:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 06:31:28,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:28,440 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 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-09 06:31:28,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:31:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:28,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:28,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 204085633, now seen corresponding path program 1 times [2024-11-09 06:31:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469369066] [2024-11-09 06:31:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:31:28,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469369066] [2024-11-09 06:31:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469369066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:31:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751912500] [2024-11-09 06:31:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:28,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:31:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:31:28,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:31:28,832 INFO L87 Difference]: Start difference. First operand 4131 states and 5290 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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-09 06:31:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:29,242 INFO L93 Difference]: Finished difference Result 7589 states and 9740 transitions. [2024-11-09 06:31:29,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:31:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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 77 [2024-11-09 06:31:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:29,269 INFO L225 Difference]: With dead ends: 7589 [2024-11-09 06:31:29,270 INFO L226 Difference]: Without dead ends: 3598 [2024-11-09 06:31:29,279 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-09 06:31:29,280 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 57 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:29,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 623 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2024-11-09 06:31:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3598. [2024-11-09 06:31:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 2622 states have (on average 1.284134248665141) internal successors, (3367), 2652 states have internal predecessors, (3367), 626 states have call successors, (626), 349 states have call predecessors, (626), 349 states have return successors, (626), 596 states have call predecessors, (626), 626 states have call successors, (626) [2024-11-09 06:31:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 4619 transitions. [2024-11-09 06:31:29,840 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 4619 transitions. Word has length 77 [2024-11-09 06:31:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 3598 states and 4619 transitions. [2024-11-09 06:31:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 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-09 06:31:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 4619 transitions. [2024-11-09 06:31:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:31:29,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:29,842 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-09 06:31:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:31:29,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1314590680, now seen corresponding path program 1 times [2024-11-09 06:31:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538478371] [2024-11-09 06:31:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:31:29,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538478371] [2024-11-09 06:31:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538478371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:31:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135971521] [2024-11-09 06:31:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:31:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:29,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:31:29,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:31:29,914 INFO L87 Difference]: Start difference. First operand 3598 states and 4619 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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-09 06:31:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:30,467 INFO L93 Difference]: Finished difference Result 7002 states and 9008 transitions. [2024-11-09 06:31:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:31:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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 78 [2024-11-09 06:31:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:30,509 INFO L225 Difference]: With dead ends: 7002 [2024-11-09 06:31:30,509 INFO L226 Difference]: Without dead ends: 3604 [2024-11-09 06:31:30,526 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-09 06:31:30,527 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:30,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2024-11-09 06:31:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3604. [2024-11-09 06:31:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2628 states have (on average 1.2834855403348555) internal successors, (3373), 2658 states have internal predecessors, (3373), 626 states have call successors, (626), 349 states have call predecessors, (626), 349 states have return successors, (626), 596 states have call predecessors, (626), 626 states have call successors, (626) [2024-11-09 06:31:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 4625 transitions. [2024-11-09 06:31:31,136 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 4625 transitions. Word has length 78 [2024-11-09 06:31:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 4625 transitions. [2024-11-09 06:31:31,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 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-09 06:31:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 4625 transitions. [2024-11-09 06:31:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:31:31,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:31,141 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-09 06:31:31,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:31:31,141 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:31,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -658768435, now seen corresponding path program 1 times [2024-11-09 06:31:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052544831] [2024-11-09 06:31:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:31,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:31:31,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052544831] [2024-11-09 06:31:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052544831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:31:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:31:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243533956] [2024-11-09 06:31:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:31:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:31:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:31:31,320 INFO L87 Difference]: Start difference. First operand 3604 states and 4625 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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-09 06:31:31,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:31,787 INFO L93 Difference]: Finished difference Result 6924 states and 8895 transitions. [2024-11-09 06:31:31,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:31:31,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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 78 [2024-11-09 06:31:31,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:31,812 INFO L225 Difference]: With dead ends: 6924 [2024-11-09 06:31:31,812 INFO L226 Difference]: Without dead ends: 3464 [2024-11-09 06:31:31,822 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-09 06:31:31,823 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 39 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 613 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-09 06:31:31,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 613 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2024-11-09 06:31:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3074. [2024-11-09 06:31:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 2238 states have (on average 1.2797140303842716) internal successors, (2864), 2261 states have internal predecessors, (2864), 536 states have call successors, (536), 299 states have call predecessors, (536), 299 states have return successors, (536), 513 states have call predecessors, (536), 536 states have call successors, (536) [2024-11-09 06:31:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3936 transitions. [2024-11-09 06:31:32,295 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3936 transitions. Word has length 78 [2024-11-09 06:31:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:32,295 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 3936 transitions. [2024-11-09 06:31:32,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 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-09 06:31:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3936 transitions. [2024-11-09 06:31:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 06:31:32,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:32,298 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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, 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-09 06:31:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:31:32,298 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash 889575653, now seen corresponding path program 1 times [2024-11-09 06:31:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696610179] [2024-11-09 06:31:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 06:31:32,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696610179] [2024-11-09 06:31:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696610179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:32,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465081788] [2024-11-09 06:31:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:32,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:32,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:32,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:31:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:33,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:31:33,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 06:31:33,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465081788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:33,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-09 06:31:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316554040] [2024-11-09 06:31:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:33,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:33,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:31:33,123 INFO L87 Difference]: Start difference. First operand 3074 states and 3936 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 06:31:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:33,672 INFO L93 Difference]: Finished difference Result 5866 states and 7548 transitions. [2024-11-09 06:31:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:31:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2024-11-09 06:31:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:33,693 INFO L225 Difference]: With dead ends: 5866 [2024-11-09 06:31:33,694 INFO L226 Difference]: Without dead ends: 3028 [2024-11-09 06:31:33,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:33,703 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 8 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:33,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 992 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2024-11-09 06:31:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 3028. [2024-11-09 06:31:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2215 states have (on average 1.2514672686230248) internal successors, (2772), 2238 states have internal predecessors, (2772), 513 states have call successors, (513), 299 states have call predecessors, (513), 299 states have return successors, (513), 490 states have call predecessors, (513), 513 states have call successors, (513) [2024-11-09 06:31:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 3798 transitions. [2024-11-09 06:31:34,143 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 3798 transitions. Word has length 92 [2024-11-09 06:31:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:34,144 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 3798 transitions. [2024-11-09 06:31:34,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 06:31:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3798 transitions. [2024-11-09 06:31:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 06:31:34,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:34,147 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:31:34,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:31:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 06:31:34,348 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 333262592, now seen corresponding path program 1 times [2024-11-09 06:31:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268604340] [2024-11-09 06:31:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 06:31:34,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268604340] [2024-11-09 06:31:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268604340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127499863] [2024-11-09 06:31:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:34,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:34,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:31:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:35,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:31:35,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 06:31:35,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:31:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127499863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:31:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:31:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2024-11-09 06:31:35,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549360014] [2024-11-09 06:31:35,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:31:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:35,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:31:35,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:31:35,205 INFO L87 Difference]: Start difference. First operand 3028 states and 3798 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 06:31:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:35,746 INFO L93 Difference]: Finished difference Result 5726 states and 7221 transitions. [2024-11-09 06:31:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:31:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-09 06:31:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:35,767 INFO L225 Difference]: With dead ends: 5726 [2024-11-09 06:31:35,767 INFO L226 Difference]: Without dead ends: 2982 [2024-11-09 06:31:35,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:35,776 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:35,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 972 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2024-11-09 06:31:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2907. [2024-11-09 06:31:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2138 states have (on average 1.2212347988774557) internal successors, (2611), 2161 states have internal predecessors, (2611), 478 states have call successors, (478), 290 states have call predecessors, (478), 290 states have return successors, (478), 455 states have call predecessors, (478), 478 states have call successors, (478) [2024-11-09 06:31:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3567 transitions. [2024-11-09 06:31:36,358 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3567 transitions. Word has length 108 [2024-11-09 06:31:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:36,359 INFO L471 AbstractCegarLoop]: Abstraction has 2907 states and 3567 transitions. [2024-11-09 06:31:36,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 06:31:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3567 transitions. [2024-11-09 06:31:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:31:36,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:36,366 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:31:36,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:31:36,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 06:31:36,571 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:36,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:36,572 INFO L85 PathProgramCache]: Analyzing trace with hash 696062107, now seen corresponding path program 1 times [2024-11-09 06:31:36,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:36,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215668524] [2024-11-09 06:31:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 06:31:37,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215668524] [2024-11-09 06:31:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215668524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868355584] [2024-11-09 06:31:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:37,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:37,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:31:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:37,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:31:37,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 06:31:37,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:31:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868355584] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:31:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 6] total 15 [2024-11-09 06:31:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816570401] [2024-11-09 06:31:37,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:31:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:31:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:31:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:31:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:31:37,695 INFO L87 Difference]: Start difference. First operand 2907 states and 3567 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:31:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:31:38,041 INFO L93 Difference]: Finished difference Result 5443 states and 6730 transitions. [2024-11-09 06:31:38,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:31:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2024-11-09 06:31:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:31:38,063 INFO L225 Difference]: With dead ends: 5443 [2024-11-09 06:31:38,063 INFO L226 Difference]: Without dead ends: 2847 [2024-11-09 06:31:38,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:31:38,072 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 4 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:31:38,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 596 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:31:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2024-11-09 06:31:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2681. [2024-11-09 06:31:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 1970 states have (on average 1.1989847715736042) internal successors, (2362), 1993 states have internal predecessors, (2362), 439 states have call successors, (439), 271 states have call predecessors, (439), 271 states have return successors, (439), 416 states have call predecessors, (439), 439 states have call successors, (439) [2024-11-09 06:31:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3240 transitions. [2024-11-09 06:31:38,495 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3240 transitions. Word has length 124 [2024-11-09 06:31:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:31:38,496 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3240 transitions. [2024-11-09 06:31:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:31:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3240 transitions. [2024-11-09 06:31:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 06:31:38,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:31:38,502 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:31:38,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:31:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 06:31:38,707 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:31:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:31:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1598095994, now seen corresponding path program 1 times [2024-11-09 06:31:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:31:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046018679] [2024-11-09 06:31:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:31:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 06:31:39,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:31:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046018679] [2024-11-09 06:31:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046018679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:31:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396578004] [2024-11-09 06:31:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:31:39,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:31:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:31:39,364 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:31:39,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:31:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:31:39,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:31:39,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:31:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 06:31:39,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:31:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 06:31:40,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396578004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:31:40,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007911260] [2024-11-09 06:31:40,247 INFO L159 IcfgInterpreter]: Started Sifa with 86 locations of interest [2024-11-09 06:31:40,247 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:31:40,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:31:40,248 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:31:40,248 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:31:58,440 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-09 06:31:58,464 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:31:58,465 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 20 for LOIs [2024-11-09 06:31:58,493 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 212 for LOIs [2024-11-09 06:31:59,290 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 190 for LOIs [2024-11-09 06:32:02,187 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 24 for LOIs [2024-11-09 06:32:02,208 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:33:00,363 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '163843#(and (<= 0 ~side2Failed_History_0~0) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_#t~ret28#1_19| Int) (|v_ULTIMATE.start_check_~tmp___17~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___16~0#1_17| Int) (|v_ULTIMATE.start_check_#t~ret27#1_19| Int)) (and (or (and (not (= |v_ULTIMATE.start_check_#t~ret27#1_19| 0)) (= |v_ULTIMATE.start_check_~tmp___16~0#1_17| 1)) (and (= |v_ULTIMATE.start_check_#t~ret27#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___16~0#1_17| 0))) (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| |v_ULTIMATE.start_check_~tmp___16~0#1_17|) (<= |v_ULTIMATE.start_check_#t~ret27#1_19| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret27#1_19|) (<= 0 |v_ULTIMATE.start_check_#t~ret28#1_19|) (<= |v_ULTIMATE.start_check_#t~ret28#1_19| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret28#1_19| 0))) (and (= |v_ULTIMATE.start_check_~tmp___17~0#1_17| 0) (= |v_ULTIMATE.start_check_#t~ret28#1_19| 0))))) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_#t~ret26#1_19| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___15~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret26#1_19|) (or (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_19| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_19|) (= |v_ULTIMATE.start_check_~tmp___2~0#1_17| 1) (<= |v_ULTIMATE.start_check_#t~ret12#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret12#1_19| 0)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_19| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_19|) (<= |v_ULTIMATE.start_check_#t~ret25#1_19| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0)))))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret11#1_23| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_23| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_20| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_25| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_21| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_21| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 1)) (or (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|)) (= ~active_side_History_0~0 0)) (and (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|))) (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|) (= 2 ~active_side_History_0~0))))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret19#1_23| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret19#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret19#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_20| 1))) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_19| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_19|) (= |v_ULTIMATE.start_check_~tmp___2~0#1_17| 1) (<= |v_ULTIMATE.start_check_#t~ret12#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret12#1_19| 0)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_19| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_19|) (<= |v_ULTIMATE.start_check_#t~ret25#1_19| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_17| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_19| 0)))))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret11#1_23| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_23| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_20| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_25| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_21| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_21| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28| 1)) (or (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|)) (= ~active_side_History_0~0 0)) (and (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_28|) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|))) (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_28|) (= 2 ~active_side_History_0~0))))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_20| Int) (|v_ULTIMATE.start_check_#t~ret19#1_23| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret19#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret19#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_20| 1))) (= ~nomsg~0 ~s1s2_new~0))) (<= |v_ULTIMATE.start_check_#t~ret26#1_19| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| 0) (= |v_ULTIMATE.start_check_#t~ret26#1_19| 0)) (and (not (= |v_ULTIMATE.start_check_#t~ret26#1_19| 0)) (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| 1))) (= |v_ULTIMATE.start_check_~tmp___15~0#1_17| |v_ULTIMATE.start_check_~tmp___14~0#1_17|))) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___19~0#1_17| Int) (|v_ULTIMATE.start_check_~tmp___18~0#1_17| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_17|)) (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_17| |v_ULTIMATE.start_check_~tmp___19~0#1_17|)) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_17| 128)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_17| 127) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_17| 127))) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:33:00,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:33:00,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 26 [2024-11-09 06:33:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664304025] [2024-11-09 06:33:00,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 06:33:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 06:33:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=7332, Unknown=0, NotChecked=0, Total=7832 [2024-11-09 06:33:00,367 INFO L87 Difference]: Start difference. First operand 2681 states and 3240 transitions. Second operand has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-09 06:33:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:04,190 INFO L93 Difference]: Finished difference Result 6509 states and 7896 transitions. [2024-11-09 06:33:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-09 06:33:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 134 [2024-11-09 06:33:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:04,216 INFO L225 Difference]: With dead ends: 6509 [2024-11-09 06:33:04,217 INFO L226 Difference]: Without dead ends: 3995 [2024-11-09 06:33:04,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 313 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4701 ImplicationChecksByTransitivity, 59.7s TimeCoverageRelationStatistics Valid=829, Invalid=13691, Unknown=0, NotChecked=0, Total=14520 [2024-11-09 06:33:04,230 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1205 mSDsluCounter, 5015 mSDsCounter, 0 mSdLazyCounter, 1901 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:04,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 5330 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1901 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 06:33:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2024-11-09 06:33:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3634. [2024-11-09 06:33:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 2662 states have (on average 1.1919609316303532) internal successors, (3173), 2695 states have internal predecessors, (3173), 598 states have call successors, (598), 373 states have call predecessors, (598), 373 states have return successors, (598), 565 states have call predecessors, (598), 598 states have call successors, (598) [2024-11-09 06:33:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 4369 transitions. [2024-11-09 06:33:04,804 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 4369 transitions. Word has length 134 [2024-11-09 06:33:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:04,805 INFO L471 AbstractCegarLoop]: Abstraction has 3634 states and 4369 transitions. [2024-11-09 06:33:04,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.208333333333333) internal successors, (149), 21 states have internal predecessors, (149), 7 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-09 06:33:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 4369 transitions. [2024-11-09 06:33:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 06:33:04,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:04,811 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-09 06:33:04,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:33:05,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 06:33:05,013 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash -137440141, now seen corresponding path program 1 times [2024-11-09 06:33:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566500204] [2024-11-09 06:33:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:05,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:33:05,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566500204] [2024-11-09 06:33:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566500204] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:05,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220295034] [2024-11-09 06:33:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:05,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:05,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:33:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:05,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:33:05,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:33:07,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 06:33:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220295034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:33:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687513202] [2024-11-09 06:33:08,903 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2024-11-09 06:33:08,903 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:33:08,904 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:33:08,904 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:33:08,904 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:33:19,114 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 72 for LOIs [2024-11-09 06:33:19,324 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:33:19,325 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 10 for LOIs [2024-11-09 06:33:19,335 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 144 for LOIs [2024-11-09 06:33:20,004 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 74 for LOIs [2024-11-09 06:33:20,084 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 16 for LOIs [2024-11-09 06:33:20,092 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:33:35,688 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '178718#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_13| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_13| 0) (<= 0 (+ ~active_side_History_0~0 128)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_24| Int) (|v_ULTIMATE.start_check_#t~ret16#1_26| Int)) (and (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_35| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_29| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret15#1_35| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_35|) (<= |v_ULTIMATE.start_check_#t~ret15#1_35| 1) (= |v_ULTIMATE.start_check_~tmp___7~0#1_29| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_26| 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_24| 0))) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:33:35,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:33:35,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:33:35,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 17] total 33 [2024-11-09 06:33:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018325454] [2024-11-09 06:33:35,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:33:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 06:33:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:33:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 06:33:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=7775, Unknown=0, NotChecked=0, Total=8372 [2024-11-09 06:33:35,692 INFO L87 Difference]: Start difference. First operand 3634 states and 4369 transitions. Second operand has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 06:33:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:33:44,124 INFO L93 Difference]: Finished difference Result 10842 states and 13143 transitions. [2024-11-09 06:33:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-09 06:33:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 143 [2024-11-09 06:33:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:33:44,156 INFO L225 Difference]: With dead ends: 10842 [2024-11-09 06:33:44,156 INFO L226 Difference]: Without dead ends: 7425 [2024-11-09 06:33:44,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 354 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9286 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=2238, Invalid=21018, Unknown=0, NotChecked=0, Total=23256 [2024-11-09 06:33:44,168 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 2727 mSDsluCounter, 6082 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 1000 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 6562 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1000 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:33:44,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 6562 Invalid, 5437 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1000 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 06:33:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7425 states. [2024-11-09 06:33:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7425 to 7023. [2024-11-09 06:33:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7023 states, 5156 states have (on average 1.186966640806827) internal successors, (6120), 5217 states have internal predecessors, (6120), 1147 states have call successors, (1147), 719 states have call predecessors, (1147), 719 states have return successors, (1147), 1086 states have call predecessors, (1147), 1147 states have call successors, (1147) [2024-11-09 06:33:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7023 states to 7023 states and 8414 transitions. [2024-11-09 06:33:45,138 INFO L78 Accepts]: Start accepts. Automaton has 7023 states and 8414 transitions. Word has length 143 [2024-11-09 06:33:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:33:45,139 INFO L471 AbstractCegarLoop]: Abstraction has 7023 states and 8414 transitions. [2024-11-09 06:33:45,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.242424242424242) internal successors, (206), 32 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 06:33:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7023 states and 8414 transitions. [2024-11-09 06:33:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 06:33:45,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:33:45,147 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:33:45,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:33:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 06:33:45,350 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:33:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:33:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -901470125, now seen corresponding path program 1 times [2024-11-09 06:33:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:33:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841901464] [2024-11-09 06:33:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:33:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:33:46,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:33:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841901464] [2024-11-09 06:33:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841901464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971491533] [2024-11-09 06:33:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:46,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:46,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:46,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:33:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:46,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:33:46,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:33:46,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 06:33:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971491533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:33:47,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [613137930] [2024-11-09 06:33:47,091 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-09 06:33:47,091 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:33:47,091 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:33:47,091 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:33:47,092 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:34:04,169 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:34:04,184 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:34:04,185 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-09 06:34:04,236 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-09 06:34:04,863 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-09 06:34:04,943 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-09 06:34:04,950 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:34:18,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '204223#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_24| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret16#1_35| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_32| Int)) (and (= |v_ULTIMATE.start_check_~tmp___8~0#1_32| 0) (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_47| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_39| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_47| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_47|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_47| 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_39| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_35| 0))) (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_24| 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:34:18,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:34:18,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:34:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-09 06:34:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702908182] [2024-11-09 06:34:18,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:34:18,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:34:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:34:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:34:18,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=6731, Unknown=0, NotChecked=0, Total=7140 [2024-11-09 06:34:18,667 INFO L87 Difference]: Start difference. First operand 7023 states and 8414 transitions. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-09 06:34:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:34:25,175 INFO L93 Difference]: Finished difference Result 17486 states and 20860 transitions. [2024-11-09 06:34:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-09 06:34:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) Word has length 143 [2024-11-09 06:34:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:34:25,234 INFO L225 Difference]: With dead ends: 17486 [2024-11-09 06:34:25,234 INFO L226 Difference]: Without dead ends: 12732 [2024-11-09 06:34:25,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 376 SyntacticMatches, 9 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8028 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1511, Invalid=20541, Unknown=0, NotChecked=0, Total=22052 [2024-11-09 06:34:25,254 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1833 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 4818 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:34:25,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1833 Valid, 4818 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 06:34:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12732 states. [2024-11-09 06:34:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12732 to 8101. [2024-11-09 06:34:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8101 states, 5965 states have (on average 1.1869237217099748) internal successors, (7080), 6036 states have internal predecessors, (7080), 1304 states have call successors, (1304), 831 states have call predecessors, (1304), 831 states have return successors, (1304), 1233 states have call predecessors, (1304), 1304 states have call successors, (1304) [2024-11-09 06:34:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8101 states to 8101 states and 9688 transitions. [2024-11-09 06:34:26,545 INFO L78 Accepts]: Start accepts. Automaton has 8101 states and 9688 transitions. Word has length 143 [2024-11-09 06:34:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:34:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 8101 states and 9688 transitions. [2024-11-09 06:34:26,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 22 states have internal predecessors, (208), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-09 06:34:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 9688 transitions. [2024-11-09 06:34:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 06:34:26,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:34:26,554 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:34:26,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 06:34:26,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 06:34:26,755 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:34:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:34:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1335972739, now seen corresponding path program 1 times [2024-11-09 06:34:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:34:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53073922] [2024-11-09 06:34:26,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:34:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 06:34:26,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:34:26,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53073922] [2024-11-09 06:34:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53073922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:34:26,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:34:26,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:34:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901127088] [2024-11-09 06:34:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:34:26,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:34:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:34:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:34:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:34:26,984 INFO L87 Difference]: Start difference. First operand 8101 states and 9688 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:34:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:34:29,529 INFO L93 Difference]: Finished difference Result 22758 states and 27268 transitions. [2024-11-09 06:34:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:34:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-11-09 06:34:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:34:29,591 INFO L225 Difference]: With dead ends: 22758 [2024-11-09 06:34:29,592 INFO L226 Difference]: Without dead ends: 15923 [2024-11-09 06:34:29,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:34:29,606 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 192 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:34:29,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1875 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:34:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-09 06:34:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 12436. [2024-11-09 06:34:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12436 states, 9100 states have (on average 1.180879120879121) internal successors, (10746), 9213 states have internal predecessors, (10746), 2056 states have call successors, (2056), 1279 states have call predecessors, (2056), 1279 states have return successors, (2056), 1943 states have call predecessors, (2056), 2056 states have call successors, (2056) [2024-11-09 06:34:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12436 states to 12436 states and 14858 transitions. [2024-11-09 06:34:31,524 INFO L78 Accepts]: Start accepts. Automaton has 12436 states and 14858 transitions. Word has length 144 [2024-11-09 06:34:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:34:31,524 INFO L471 AbstractCegarLoop]: Abstraction has 12436 states and 14858 transitions. [2024-11-09 06:34:31,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 06:34:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12436 states and 14858 transitions. [2024-11-09 06:34:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 06:34:31,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:34:31,538 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:34:31,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:34:31,538 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:34:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:34:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 712262968, now seen corresponding path program 1 times [2024-11-09 06:34:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:34:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284085836] [2024-11-09 06:34:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:34:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 06:34:32,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:34:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284085836] [2024-11-09 06:34:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284085836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:34:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434564333] [2024-11-09 06:34:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:34:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:34:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:34:32,652 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:34:32,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:34:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:34:32,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 06:34:32,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:34:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:34:33,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:34:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434564333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:34:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200460341] [2024-11-09 06:34:34,266 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-09 06:34:34,266 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:34:34,267 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:34:34,267 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:34:34,267 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:34:44,130 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:34:44,209 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:34:44,211 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-09 06:34:44,262 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-09 06:34:44,905 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-09 06:34:44,971 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-09 06:34:44,978 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:35:00,746 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '288532#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_33| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_39| Int) (|v_ULTIMATE.start_check_#t~ret16#1_43| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_39| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_58| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_48| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_58| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_58| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_58|) (= |v_ULTIMATE.start_check_~tmp___7~0#1_48| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_43| 0))) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_33| 0) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:35:00,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:35:00,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:35:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 27 [2024-11-09 06:35:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047176558] [2024-11-09 06:35:00,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:35:00,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 06:35:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:35:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 06:35:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=7243, Unknown=0, NotChecked=0, Total=7656 [2024-11-09 06:35:00,752 INFO L87 Difference]: Start difference. First operand 12436 states and 14858 transitions. Second operand has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) [2024-11-09 06:35:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:35:07,819 INFO L93 Difference]: Finished difference Result 24569 states and 29285 transitions. [2024-11-09 06:35:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 06:35:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) Word has length 145 [2024-11-09 06:35:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:35:07,883 INFO L225 Difference]: With dead ends: 24569 [2024-11-09 06:35:07,883 INFO L226 Difference]: Without dead ends: 13693 [2024-11-09 06:35:07,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 355 SyntacticMatches, 9 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=772, Invalid=11884, Unknown=0, NotChecked=0, Total=12656 [2024-11-09 06:35:07,909 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1533 mSDsluCounter, 4141 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:35:07,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 4555 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 06:35:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13693 states. [2024-11-09 06:35:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13693 to 13162. [2024-11-09 06:35:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13162 states, 9636 states have (on average 1.1739310917393109) internal successors, (11312), 9757 states have internal predecessors, (11312), 2168 states have call successors, (2168), 1357 states have call predecessors, (2168), 1357 states have return successors, (2168), 2047 states have call predecessors, (2168), 2168 states have call successors, (2168) [2024-11-09 06:35:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13162 states to 13162 states and 15648 transitions. [2024-11-09 06:35:10,528 INFO L78 Accepts]: Start accepts. Automaton has 13162 states and 15648 transitions. Word has length 145 [2024-11-09 06:35:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:35:10,528 INFO L471 AbstractCegarLoop]: Abstraction has 13162 states and 15648 transitions. [2024-11-09 06:35:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.148148148148148) internal successors, (193), 26 states have internal predecessors, (193), 9 states have call successors, (44), 5 states have call predecessors, (44), 7 states have return successors, (43), 10 states have call predecessors, (43), 9 states have call successors, (43) [2024-11-09 06:35:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 13162 states and 15648 transitions. [2024-11-09 06:35:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 06:35:10,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:35:10,539 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-09 06:35:10,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 06:35:10,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:35:10,740 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:35:10,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:35:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1459173618, now seen corresponding path program 1 times [2024-11-09 06:35:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:35:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632700336] [2024-11-09 06:35:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:35:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:35:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:35:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:35:11,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:35:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632700336] [2024-11-09 06:35:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632700336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:35:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849355608] [2024-11-09 06:35:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:35:11,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:35:11,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:35:11,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:35:11,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 06:35:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:35:12,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:35:12,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:35:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 70 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:35:13,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:35:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 06:35:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849355608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:35:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1142659382] [2024-11-09 06:35:15,222 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-09 06:35:15,222 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:35:15,223 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:35:15,223 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:35:15,223 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:35:37,074 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 19 for LOIs [2024-11-09 06:35:37,093 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:35:37,094 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2024-11-09 06:35:37,112 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 142 for LOIs [2024-11-09 06:35:37,834 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 72 for LOIs [2024-11-09 06:35:37,957 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 72 for LOIs [2024-11-09 06:35:38,213 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:35:58,497 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '341301#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_44| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_44| 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_46| Int) (|v_ULTIMATE.start_check_#t~ret16#1_51| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_51| 0) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_46| 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_58| Int) (|v_ULTIMATE.start_check_#t~ret15#1_70| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_70|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_70| 0)) (<= |v_ULTIMATE.start_check_#t~ret15#1_70| 1) (= |v_ULTIMATE.start_check_~tmp___7~0#1_58| 1))))) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:35:58,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:35:58,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:35:58,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 18] total 35 [2024-11-09 06:35:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581438514] [2024-11-09 06:35:58,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:35:58,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 06:35:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:35:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 06:35:58,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=8047, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 06:35:58,502 INFO L87 Difference]: Start difference. First operand 13162 states and 15648 transitions. Second operand has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 06:36:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:36:08,458 INFO L93 Difference]: Finished difference Result 26865 states and 32083 transitions. [2024-11-09 06:36:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-09 06:36:08,459 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 146 [2024-11-09 06:36:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:36:08,518 INFO L225 Difference]: With dead ends: 26865 [2024-11-09 06:36:08,519 INFO L226 Difference]: Without dead ends: 14593 [2024-11-09 06:36:08,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 363 SyntacticMatches, 10 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9850 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=1674, Invalid=23766, Unknown=0, NotChecked=0, Total=25440 [2024-11-09 06:36:08,549 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1602 mSDsluCounter, 4718 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 5106 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:36:08,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 5106 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:36:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14593 states. [2024-11-09 06:36:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14593 to 13056. [2024-11-09 06:36:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13056 states, 9566 states have (on average 1.1740539410411874) internal successors, (11231), 9686 states have internal predecessors, (11231), 2137 states have call successors, (2137), 1352 states have call predecessors, (2137), 1352 states have return successors, (2137), 2017 states have call predecessors, (2137), 2137 states have call successors, (2137) [2024-11-09 06:36:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13056 states to 13056 states and 15505 transitions. [2024-11-09 06:36:11,445 INFO L78 Accepts]: Start accepts. Automaton has 13056 states and 15505 transitions. Word has length 146 [2024-11-09 06:36:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:36:11,445 INFO L471 AbstractCegarLoop]: Abstraction has 13056 states and 15505 transitions. [2024-11-09 06:36:11,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.885714285714286) internal successors, (206), 34 states have internal predecessors, (206), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 06:36:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 13056 states and 15505 transitions. [2024-11-09 06:36:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 06:36:11,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:36:11,452 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-09 06:36:11,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 06:36:11,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:36:11,653 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:36:11,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:36:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash -409059753, now seen corresponding path program 1 times [2024-11-09 06:36:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:36:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913518732] [2024-11-09 06:36:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:36:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:36:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:36:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 06:36:13,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:36:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913518732] [2024-11-09 06:36:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913518732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:36:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825756893] [2024-11-09 06:36:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:36:13,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:36:13,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:36:13,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:36:13,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 06:36:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:36:13,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 06:36:13,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:36:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 06:36:14,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:36:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 06:36:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825756893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:36:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147816725] [2024-11-09 06:36:15,717 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-09 06:36:15,717 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:36:15,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:36:15,718 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:36:15,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:36:25,953 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 66 for LOIs [2024-11-09 06:36:26,192 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:36:26,194 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-09 06:36:26,210 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 140 for LOIs [2024-11-09 06:36:26,734 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 68 for LOIs [2024-11-09 06:36:26,791 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:36:26,944 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:36:46,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '397133#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_53| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_53| 0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_54| Int) (|v_ULTIMATE.start_check_#t~ret16#1_60| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_#t~ret16#1_60| 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_67| Int) (|v_ULTIMATE.start_check_#t~ret15#1_81| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_67| 1) (<= |v_ULTIMATE.start_check_#t~ret15#1_81| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_81| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_81|))) (= |v_ULTIMATE.start_check_~tmp___8~0#1_54| 0))) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:36:46,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:36:46,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:36:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 16] total 34 [2024-11-09 06:36:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025376619] [2024-11-09 06:36:46,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:36:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 06:36:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:36:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 06:36:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=8391, Unknown=0, NotChecked=0, Total=8930 [2024-11-09 06:36:46,507 INFO L87 Difference]: Start difference. First operand 13056 states and 15505 transitions. Second operand has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-09 06:36:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:36:58,504 INFO L93 Difference]: Finished difference Result 35195 states and 41854 transitions. [2024-11-09 06:36:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-11-09 06:36:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) Word has length 148 [2024-11-09 06:36:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:36:58,576 INFO L225 Difference]: With dead ends: 35195 [2024-11-09 06:36:58,576 INFO L226 Difference]: Without dead ends: 22425 [2024-11-09 06:36:58,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 385 SyntacticMatches, 5 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20114 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=3463, Invalid=46489, Unknown=0, NotChecked=0, Total=49952 [2024-11-09 06:36:58,605 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 2304 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:36:58,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 3862 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 06:36:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22425 states. [2024-11-09 06:37:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22425 to 13445. [2024-11-09 06:37:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13445 states, 9878 states have (on average 1.1729094958493622) internal successors, (11586), 10000 states have internal predecessors, (11586), 2178 states have call successors, (2178), 1388 states have call predecessors, (2178), 1388 states have return successors, (2178), 2056 states have call predecessors, (2178), 2178 states have call successors, (2178) [2024-11-09 06:37:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13445 states to 13445 states and 15942 transitions. [2024-11-09 06:37:01,303 INFO L78 Accepts]: Start accepts. Automaton has 13445 states and 15942 transitions. Word has length 148 [2024-11-09 06:37:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:01,304 INFO L471 AbstractCegarLoop]: Abstraction has 13445 states and 15942 transitions. [2024-11-09 06:37:01,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.323529411764706) internal successors, (215), 33 states have internal predecessors, (215), 11 states have call successors, (46), 7 states have call predecessors, (46), 10 states have return successors, (46), 11 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-09 06:37:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 13445 states and 15942 transitions. [2024-11-09 06:37:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 06:37:01,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:01,314 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:37:01,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 06:37:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:01,515 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1046860253, now seen corresponding path program 1 times [2024-11-09 06:37:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723177937] [2024-11-09 06:37:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 06:37:02,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:37:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723177937] [2024-11-09 06:37:02,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723177937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:37:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745944895] [2024-11-09 06:37:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:37:02,560 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:37:02,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 06:37:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:37:02,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:37:02,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:37:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:37:03,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:37:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 06:37:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745944895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:37:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639285481] [2024-11-09 06:37:03,408 INFO L159 IcfgInterpreter]: Started Sifa with 76 locations of interest [2024-11-09 06:37:03,408 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:37:03,408 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:37:03,408 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:37:03,408 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:37:08,447 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 06:37:08,454 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 06:37:11,812 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 06:37:11,819 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 06:37:12,341 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-09 06:37:12,358 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:37:12,359 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-09 06:37:12,374 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 122 for LOIs [2024-11-09 06:37:13,287 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 49 for LOIs [2024-11-09 06:37:13,319 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:37:13,456 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:37:30,546 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '465014#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_58| Int) (|v_ULTIMATE.start_check_~tmp~3#1_72| Int)) (and (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_58| 0) (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (not (= ~active_side_History_0~0 1)) (exists ((|v_ULTIMATE.start_check_#t~ret20#1_71| Int) (|v_ULTIMATE.start_check_~tmp___12~0#1_65| Int)) (and (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_65| Int) (|v_ULTIMATE.start_check_#t~ret19#1_75| Int)) (and (= |v_ULTIMATE.start_check_#t~ret19#1_75| 0) (= |v_ULTIMATE.start_check_~tmp___11~0#1_65| 0))) (= |v_ULTIMATE.start_check_~tmp___12~0#1_65| 1) (not (= |v_ULTIMATE.start_check_#t~ret20#1_71| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_71|) (<= |v_ULTIMATE.start_check_#t~ret20#1_71| 1) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_77| Int) (|v_ULTIMATE.start_check_#t~ret15#1_93| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_77| 0) (= |v_ULTIMATE.start_check_#t~ret15#1_93| 0))) (not (= ~side2Failed_History_1~0 0)))) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_check_~tmp~3#1_72| 1) (= ~side2_written~0 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 06:37:30,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:37:30,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:37:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-11-09 06:37:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178180449] [2024-11-09 06:37:30,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:37:30,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:37:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:37:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:37:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=6533, Unknown=0, NotChecked=0, Total=6972 [2024-11-09 06:37:30,550 INFO L87 Difference]: Start difference. First operand 13445 states and 15942 transitions. Second operand has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) [2024-11-09 06:37:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:37:37,880 INFO L93 Difference]: Finished difference Result 35832 states and 42526 transitions. [2024-11-09 06:37:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 06:37:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) Word has length 156 [2024-11-09 06:37:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:37:37,957 INFO L225 Difference]: With dead ends: 35832 [2024-11-09 06:37:37,957 INFO L226 Difference]: Without dead ends: 22829 [2024-11-09 06:37:37,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 395 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3829 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=677, Invalid=9829, Unknown=0, NotChecked=0, Total=10506 [2024-11-09 06:37:37,987 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 914 mSDsluCounter, 3364 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:37:37,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 3687 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 06:37:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22829 states. [2024-11-09 06:37:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22829 to 19833. [2024-11-09 06:37:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19833 states, 14522 states have (on average 1.1696735986778681) internal successors, (16986), 14703 states have internal predecessors, (16986), 3270 states have call successors, (3270), 2040 states have call predecessors, (3270), 2040 states have return successors, (3270), 3089 states have call predecessors, (3270), 3270 states have call successors, (3270) [2024-11-09 06:37:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19833 states to 19833 states and 23526 transitions. [2024-11-09 06:37:42,970 INFO L78 Accepts]: Start accepts. Automaton has 19833 states and 23526 transitions. Word has length 156 [2024-11-09 06:37:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:37:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 19833 states and 23526 transitions. [2024-11-09 06:37:42,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 20 states have internal predecessors, (216), 9 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (44), 12 states have call predecessors, (44), 9 states have call successors, (44) [2024-11-09 06:37:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19833 states and 23526 transitions. [2024-11-09 06:37:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 06:37:42,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:37:42,980 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:37:43,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 06:37:43,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:37:43,181 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:37:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:37:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash -406136485, now seen corresponding path program 1 times [2024-11-09 06:37:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:37:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276806849] [2024-11-09 06:37:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:37:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:37:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:37:43,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:37:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:37:43,623 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:37:43,624 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:37:43,625 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 06:37:43,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 06:37:43,631 INFO L407 BasicCegarLoop]: Path program 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-09 06:37:43,820 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:37:43,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:43 BoogieIcfgContainer [2024-11-09 06:37:43,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:37:43,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:37:43,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:37:43,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:37:43,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:29:46" (3/4) ... [2024-11-09 06:37:43,828 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:37:44,069 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 06:37:44,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:37:44,070 INFO L158 Benchmark]: Toolchain (without parser) took 480317.22ms. Allocated memory was 144.7MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 89.8MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-09 06:37:44,073 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 144.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:37:44,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.86ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 89.5MB in the beginning and 160.8MB in the end (delta: -71.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-09 06:37:44,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.96ms. Allocated memory is still 192.9MB. Free memory was 160.8MB in the beginning and 156.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:37:44,074 INFO L158 Benchmark]: Boogie Preprocessor took 80.28ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 153.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:37:44,075 INFO L158 Benchmark]: RCFGBuilder took 1587.16ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 142.4MB in the end (delta: 11.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-09 06:37:44,075 INFO L158 Benchmark]: TraceAbstraction took 477762.34ms. Allocated memory was 192.9MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 141.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-11-09 06:37:44,075 INFO L158 Benchmark]: Witness Printer took 243.61ms. Allocated memory is still 4.2GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 06:37:44,076 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.37ms. Allocated memory is still 144.7MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.86ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 89.5MB in the beginning and 160.8MB in the end (delta: -71.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.96ms. Allocated memory is still 192.9MB. Free memory was 160.8MB in the beginning and 156.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.28ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 153.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1587.16ms. Allocated memory is still 192.9MB. Free memory was 153.6MB in the beginning and 142.4MB in the end (delta: 11.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * TraceAbstraction took 477762.34ms. Allocated memory was 192.9MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 141.3MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 243.61ms. Allocated memory is still 4.2GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. 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: 618]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=4, cs1_old=-1, cs2=0, cs2_new=4, cs2_old=-1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, index=2, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L616] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, i2=1, manual_selection_History_0=4, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE 1 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=4, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=4, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=4, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L616] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L618] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=4, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 149 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 477.5s, OverallIterations: 35, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 73.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16132 SdHoareTripleChecker+Valid, 25.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16062 mSDsluCounter, 66746 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57049 mSDsCounter, 4603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23506 IncrementalHoareTripleChecker+Invalid, 28109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4603 mSolverCounterUnsat, 9697 mSDtfsCounter, 23506 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4962 GetRequests, 3554 SyntacticMatches, 62 SemanticMatches, 1346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66097 ImplicationChecksByTransitivity, 230.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19833occurred in iteration=34, InterpolantAutomatonStates: 620, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 25139 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 4725 NumberOfCodeBlocks, 4725 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 5789 ConstructedInterpolants, 0 QuantifiedInterpolants, 21223 SizeOfPredicates, 79 NumberOfNonLiveVariables, 7966 ConjunctsInSsa, 408 ConjunctsInUnsatCore, 59 InterpolantComputations, 25 PerfectInterpolantSequences, 2901/3319 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-09 06:37:44,302 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 06:37:44,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c72ec6be-e2d4-4192-a8a8-43ff669b98b7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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