./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 0e0057cc 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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh --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.4-dev-0e0057c [2023-12-02 14:59:29,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:59:29,319 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 14:59:29,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:59:29,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:59:29,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:59:29,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:59:29,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:59:29,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:59:29,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:59:29,351 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:59:29,351 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:59:29,352 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:59:29,352 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:59:29,353 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:59:29,353 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:59:29,354 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:59:29,354 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:59:29,355 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:59:29,356 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:59:29,356 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:59:29,358 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:59:29,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:59:29,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 14:59:29,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:59:29,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:59:29,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:59:29,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:59:29,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 14:59:29,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:59:29,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 14:59:29,362 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:59:29,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 14:59:29,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:59:29,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:59:29,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:59:29,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:59:29,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:59:29,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:59:29,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:59:29,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 14:59:29,365 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:59:29,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:59:29,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:59:29,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 14:59:29,366 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:59:29,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:59:29,366 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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh 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 [2023-12-02 14:59:29,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:59:29,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:59:29,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:59:29,609 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:59:29,610 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:59:29,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2023-12-02 14:59:32,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:59:32,457 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:59:32,458 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2023-12-02 14:59:32,470 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/data/c14d59157/9eda8e2e2045433cb0affee24b2de261/FLAG212746387 [2023-12-02 14:59:32,484 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/data/c14d59157/9eda8e2e2045433cb0affee24b2de261 [2023-12-02 14:59:32,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:59:32,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:59:32,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:59:32,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:59:32,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:59:32,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c17ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32, skipping insertion in model container [2023-12-02 14:59:32,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,540 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:59:32,761 WARN L240 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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2023-12-02 14:59:32,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:59:32,778 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:59:32,839 WARN L240 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_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2023-12-02 14:59:32,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:59:32,858 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:59:32,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32 WrapperNode [2023-12-02 14:59:32,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:59:32,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:59:32,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:59:32,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:59:32,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,914 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 497 [2023-12-02 14:59:32,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:59:32,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:59:32,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:59:32,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:59:32,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:59:32,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:59:32,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:59:32,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:59:32,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (1/1) ... [2023-12-02 14:59:32,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:59:32,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:59:32,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:59:32,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:59:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-12-02 14:59:33,028 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-12-02 14:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-12-02 14:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-12-02 14:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-12-02 14:59:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-12-02 14:59:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-12-02 14:59:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-12-02 14:59:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-02 14:59:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-02 14:59:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 14:59:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-12-02 14:59:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-12-02 14:59:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:59:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:59:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-12-02 14:59:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-12-02 14:59:33,139 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:59:33,141 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:59:33,611 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:59:33,757 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:59:33,757 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 14:59:33,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:33 BoogieIcfgContainer [2023-12-02 14:59:33,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:59:33,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:59:33,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:59:33,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:59:33,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:59:32" (1/3) ... [2023-12-02 14:59:33,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bce4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:59:33, skipping insertion in model container [2023-12-02 14:59:33,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:59:32" (2/3) ... [2023-12-02 14:59:33,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bce4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:59:33, skipping insertion in model container [2023-12-02 14:59:33,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:33" (3/3) ... [2023-12-02 14:59:33,767 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2023-12-02 14:59:33,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:59:33,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 14:59:33,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:59:33,849 INFO L357 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, mHoare=true, 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;@5a539310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:59:33,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 14:59:33,854 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) [2023-12-02 14:59:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 14:59:33,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:33,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:59:33,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:33,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash 563549731, now seen corresponding path program 1 times [2023-12-02 14:59:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823565424] [2023-12-02 14:59:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:59:34,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823565424] [2023-12-02 14:59:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823565424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:34,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068885732] [2023-12-02 14:59:34,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:34,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:34,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:34,291 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) [2023-12-02 14:59:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:34,413 INFO L93 Difference]: Finished difference Result 298 states and 487 transitions. [2023-12-02 14:59:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:34,415 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 [2023-12-02 14:59:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:34,425 INFO L225 Difference]: With dead ends: 298 [2023-12-02 14:59:34,425 INFO L226 Difference]: Without dead ends: 152 [2023-12-02 14:59:34,430 INFO L412 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 [2023-12-02 14:59:34,434 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 5 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 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 [2023-12-02 14:59:34,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:59:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-02 14:59:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-12-02 14:59:34,483 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) [2023-12-02 14:59:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2023-12-02 14:59:34,488 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 19 [2023-12-02 14:59:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:34,489 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2023-12-02 14:59:34,489 INFO L496 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) [2023-12-02 14:59:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2023-12-02 14:59:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 14:59:34,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:34,491 INFO L195 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] [2023-12-02 14:59:34,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 14:59:34,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:34,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1882593775, now seen corresponding path program 1 times [2023-12-02 14:59:34,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:34,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021059891] [2023-12-02 14:59:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:34,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021059891] [2023-12-02 14:59:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021059891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:59:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483082198] [2023-12-02 14:59:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:34,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:59:34,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:59:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:59:34,653 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) [2023-12-02 14:59:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:34,837 INFO L93 Difference]: Finished difference Result 337 states and 512 transitions. [2023-12-02 14:59:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:59:34,837 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 [2023-12-02 14:59:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:34,840 INFO L225 Difference]: With dead ends: 337 [2023-12-02 14:59:34,840 INFO L226 Difference]: Without dead ends: 188 [2023-12-02 14:59:34,842 INFO L412 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 [2023-12-02 14:59:34,844 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 325 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 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.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:34,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 572 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:59:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-02 14:59:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2023-12-02 14:59:34,867 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) [2023-12-02 14:59:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 281 transitions. [2023-12-02 14:59:34,870 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 281 transitions. Word has length 30 [2023-12-02 14:59:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:34,870 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 281 transitions. [2023-12-02 14:59:34,871 INFO L496 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) [2023-12-02 14:59:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 281 transitions. [2023-12-02 14:59:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:59:34,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:34,872 INFO L195 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] [2023-12-02 14:59:34,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 14:59:34,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:34,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1995629030, now seen corresponding path program 1 times [2023-12-02 14:59:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:34,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373165022] [2023-12-02 14:59:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:34,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373165022] [2023-12-02 14:59:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373165022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:34,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:59:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404556600] [2023-12-02 14:59:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:34,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:59:34,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:59:34,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:59:34,996 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) [2023-12-02 14:59:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:35,164 INFO L93 Difference]: Finished difference Result 337 states and 510 transitions. [2023-12-02 14:59:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:59:35,165 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 [2023-12-02 14:59:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:35,167 INFO L225 Difference]: With dead ends: 337 [2023-12-02 14:59:35,167 INFO L226 Difference]: Without dead ends: 188 [2023-12-02 14:59:35,168 INFO L412 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 [2023-12-02 14:59:35,170 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 321 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:35,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 575 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:59:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-02 14:59:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2023-12-02 14:59:35,189 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) [2023-12-02 14:59:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2023-12-02 14:59:35,191 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 31 [2023-12-02 14:59:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:35,192 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2023-12-02 14:59:35,192 INFO L496 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) [2023-12-02 14:59:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2023-12-02 14:59:35,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 14:59:35,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:35,194 INFO L195 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] [2023-12-02 14:59:35,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 14:59:35,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:35,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2323855, now seen corresponding path program 1 times [2023-12-02 14:59:35,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:35,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924149946] [2023-12-02 14:59:35,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:35,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:35,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924149946] [2023-12-02 14:59:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924149946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:35,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007599506] [2023-12-02 14:59:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:35,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:35,378 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) [2023-12-02 14:59:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:35,440 INFO L93 Difference]: Finished difference Result 340 states and 514 transitions. [2023-12-02 14:59:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:35,440 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 [2023-12-02 14:59:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:35,443 INFO L225 Difference]: With dead ends: 340 [2023-12-02 14:59:35,443 INFO L226 Difference]: Without dead ends: 191 [2023-12-02 14:59:35,444 INFO L412 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 [2023-12-02 14:59:35,445 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 6 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:59:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-02 14:59:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-12-02 14:59:35,462 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) [2023-12-02 14:59:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2023-12-02 14:59:35,464 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 33 [2023-12-02 14:59:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:35,464 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2023-12-02 14:59:35,464 INFO L496 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) [2023-12-02 14:59:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2023-12-02 14:59:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 14:59:35,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:35,467 INFO L195 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] [2023-12-02 14:59:35,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 14:59:35,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:35,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash -708088937, now seen corresponding path program 1 times [2023-12-02 14:59:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:35,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423567166] [2023-12-02 14:59:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:35,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423567166] [2023-12-02 14:59:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423567166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474042613] [2023-12-02 14:59:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:35,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:35,645 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) [2023-12-02 14:59:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:35,724 INFO L93 Difference]: Finished difference Result 350 states and 525 transitions. [2023-12-02 14:59:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:35,726 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 [2023-12-02 14:59:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:35,728 INFO L225 Difference]: With dead ends: 350 [2023-12-02 14:59:35,728 INFO L226 Difference]: Without dead ends: 196 [2023-12-02 14:59:35,729 INFO L412 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 [2023-12-02 14:59:35,730 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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 [2023-12-02 14:59:35,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 14:59:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-02 14:59:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-12-02 14:59:35,748 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) [2023-12-02 14:59:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2023-12-02 14:59:35,750 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 41 [2023-12-02 14:59:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:35,751 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2023-12-02 14:59:35,751 INFO L496 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) [2023-12-02 14:59:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2023-12-02 14:59:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 14:59:35,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:35,754 INFO L195 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] [2023-12-02 14:59:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 14:59:35,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:35,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -864154271, now seen corresponding path program 1 times [2023-12-02 14:59:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447522947] [2023-12-02 14:59:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:35,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447522947] [2023-12-02 14:59:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447522947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:35,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758769243] [2023-12-02 14:59:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:35,901 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) [2023-12-02 14:59:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:35,968 INFO L93 Difference]: Finished difference Result 359 states and 529 transitions. [2023-12-02 14:59:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:35,969 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 [2023-12-02 14:59:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:35,971 INFO L225 Difference]: With dead ends: 359 [2023-12-02 14:59:35,971 INFO L226 Difference]: Without dead ends: 200 [2023-12-02 14:59:35,972 INFO L412 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 [2023-12-02 14:59:35,973 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:35,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:59:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-02 14:59:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-12-02 14:59:35,987 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) [2023-12-02 14:59:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2023-12-02 14:59:35,989 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 49 [2023-12-02 14:59:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:35,989 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2023-12-02 14:59:35,990 INFO L496 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) [2023-12-02 14:59:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2023-12-02 14:59:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 14:59:35,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:35,991 INFO L195 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] [2023-12-02 14:59:35,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 14:59:35,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:35,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:35,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1532305032, now seen corresponding path program 1 times [2023-12-02 14:59:35,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814900168] [2023-12-02 14:59:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 14:59:36,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814900168] [2023-12-02 14:59:36,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814900168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:36,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:36,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220895894] [2023-12-02 14:59:36,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:36,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:36,155 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) [2023-12-02 14:59:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:36,222 INFO L93 Difference]: Finished difference Result 368 states and 539 transitions. [2023-12-02 14:59:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:36,222 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 [2023-12-02 14:59:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:36,224 INFO L225 Difference]: With dead ends: 368 [2023-12-02 14:59:36,224 INFO L226 Difference]: Without dead ends: 205 [2023-12-02 14:59:36,225 INFO L412 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 [2023-12-02 14:59:36,226 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:36,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 633 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:59:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-02 14:59:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-12-02 14:59:36,238 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) [2023-12-02 14:59:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2023-12-02 14:59:36,239 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 49 [2023-12-02 14:59:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:36,240 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2023-12-02 14:59:36,240 INFO L496 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) [2023-12-02 14:59:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2023-12-02 14:59:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 14:59:36,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:36,241 INFO L195 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] [2023-12-02 14:59:36,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 14:59:36,242 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:36,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1635203352, now seen corresponding path program 1 times [2023-12-02 14:59:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:36,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546312701] [2023-12-02 14:59:36,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:36,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 14:59:36,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546312701] [2023-12-02 14:59:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546312701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:59:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:59:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047494143] [2023-12-02 14:59:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:36,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:59:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:59:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:59:36,391 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) [2023-12-02 14:59:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:36,451 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2023-12-02 14:59:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:59:36,451 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 [2023-12-02 14:59:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:36,453 INFO L225 Difference]: With dead ends: 379 [2023-12-02 14:59:36,454 INFO L226 Difference]: Without dead ends: 211 [2023-12-02 14:59:36,454 INFO L412 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 [2023-12-02 14:59:36,455 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 7 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 644 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:36,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 14:59:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-02 14:59:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-12-02 14:59:36,467 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) [2023-12-02 14:59:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2023-12-02 14:59:36,469 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 57 [2023-12-02 14:59:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:36,469 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2023-12-02 14:59:36,470 INFO L496 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) [2023-12-02 14:59:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2023-12-02 14:59:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 14:59:36,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:36,471 INFO L195 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] [2023-12-02 14:59:36,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 14:59:36,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:36,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1412769855, now seen corresponding path program 1 times [2023-12-02 14:59:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355524817] [2023-12-02 14:59:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:36,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:59:36,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355524817] [2023-12-02 14:59:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355524817] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:59:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461193108] [2023-12-02 14:59:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:36,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:59:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:59:36,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:59:36,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 14:59:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:37,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 14:59:37,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:59:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 14:59:37,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:59:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461193108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:37,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 14:59:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2023-12-02 14:59:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627918568] [2023-12-02 14:59:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:59:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:59:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-02 14:59:37,269 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 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) [2023-12-02 14:59:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:37,587 INFO L93 Difference]: Finished difference Result 598 states and 836 transitions. [2023-12-02 14:59:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 14:59:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 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 [2023-12-02 14:59:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:37,591 INFO L225 Difference]: With dead ends: 598 [2023-12-02 14:59:37,591 INFO L226 Difference]: Without dead ends: 398 [2023-12-02 14:59:37,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-12-02 14:59:37,593 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 219 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:37,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1151 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 14:59:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-02 14:59:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2023-12-02 14:59:37,619 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) [2023-12-02 14:59:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 555 transitions. [2023-12-02 14:59:37,622 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 555 transitions. Word has length 60 [2023-12-02 14:59:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:37,622 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 555 transitions. [2023-12-02 14:59:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 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) [2023-12-02 14:59:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 555 transitions. [2023-12-02 14:59:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 14:59:37,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:37,624 INFO L195 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] [2023-12-02 14:59:37,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:59:37,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:59:37,826 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:37,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1685759676, now seen corresponding path program 1 times [2023-12-02 14:59:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274501522] [2023-12-02 14:59:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:59:38,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274501522] [2023-12-02 14:59:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274501522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:59:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269370881] [2023-12-02 14:59:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:59:38,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:59:38,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:59:38,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 14:59:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:38,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:59:38,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:59:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:59:38,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:59:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:59:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269370881] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:59:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052021380] [2023-12-02 14:59:39,060 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2023-12-02 14:59:39,060 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:59:39,063 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:59:39,068 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:59:39,069 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 14:59:45,096 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 134 for LOIs [2023-12-02 14:59:45,355 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 14:59:45,368 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 14:59:45,447 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 14:59:51,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1052021380] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:59:51,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:59:51,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [9, 9, 9] total 38 [2023-12-02 14:59:51,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919599565] [2023-12-02 14:59:51,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:59:51,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 14:59:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 14:59:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 14:59:51,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 14:59:51,947 INFO L87 Difference]: Start difference. First operand 395 states and 555 transitions. Second operand has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 14:59:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:56,200 INFO L93 Difference]: Finished difference Result 883 states and 1229 transitions. [2023-12-02 14:59:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 14:59:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2023-12-02 14:59:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:56,204 INFO L225 Difference]: With dead ends: 883 [2023-12-02 14:59:56,204 INFO L226 Difference]: Without dead ends: 528 [2023-12-02 14:59:56,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 150 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=167, Invalid=1555, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 14:59:56,206 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 176 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:56,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 3249 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 14:59:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-02 14:59:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 375. [2023-12-02 14:59:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 281 states have (on average 1.3807829181494662) internal successors, (388), 283 states have internal predecessors, (388), 63 states have call successors, (63), 30 states have call predecessors, (63), 30 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-02 14:59:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 514 transitions. [2023-12-02 14:59:56,261 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 514 transitions. Word has length 62 [2023-12-02 14:59:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:56,261 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 514 transitions. [2023-12-02 14:59:56,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 14:59:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 514 transitions. [2023-12-02 14:59:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 14:59:56,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:56,263 INFO L195 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] [2023-12-02 14:59:56,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 14:59:56,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 14:59:56,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 14:59:56,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 826283740, now seen corresponding path program 1 times [2023-12-02 14:59:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 14:59:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760267928] [2023-12-02 14:59:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 14:59:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:59:56,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 14:59:56,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760267928] [2023-12-02 14:59:56,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760267928] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:59:56,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701771556] [2023-12-02 14:59:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:56,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:59:56,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:59:56,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:59:56,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 14:59:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:56,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 14:59:56,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:59:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:59:57,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:59:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 14:59:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701771556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:59:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716226715] [2023-12-02 14:59:57,411 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2023-12-02 14:59:57,411 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 14:59:57,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 14:59:57,412 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 14:59:57,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:00:02,170 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 134 for LOIs [2023-12-02 15:00:02,405 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 111 for LOIs [2023-12-02 15:00:02,418 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:00:02,483 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:00:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1716226715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:00:08,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:00:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [9, 9, 9] total 38 [2023-12-02 15:00:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713905513] [2023-12-02 15:00:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:00:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 15:00:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:08,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 15:00:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 15:00:08,706 INFO L87 Difference]: Start difference. First operand 375 states and 514 transitions. Second operand has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 15:00:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:13,765 INFO L93 Difference]: Finished difference Result 736 states and 1012 transitions. [2023-12-02 15:00:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 15:00:13,766 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2023-12-02 15:00:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:13,768 INFO L225 Difference]: With dead ends: 736 [2023-12-02 15:00:13,768 INFO L226 Difference]: Without dead ends: 520 [2023-12-02 15:00:13,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 150 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 15:00:13,770 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 180 mSDsluCounter, 4692 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 5026 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:13,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 5026 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 15:00:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-02 15:00:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2023-12-02 15:00:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 383 states have (on average 1.3420365535248042) internal successors, (514), 386 states have internal predecessors, (514), 90 states have call successors, (90), 43 states have call predecessors, (90), 43 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-02 15:00:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 694 transitions. [2023-12-02 15:00:13,890 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 694 transitions. Word has length 62 [2023-12-02 15:00:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:13,890 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 694 transitions. [2023-12-02 15:00:13,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 19 states have internal predecessors, (43), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 15:00:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 694 transitions. [2023-12-02 15:00:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 15:00:13,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:13,892 INFO L195 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, 1, 1] [2023-12-02 15:00:13,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:00:14,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:14,092 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:14,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1637649175, now seen corresponding path program 1 times [2023-12-02 15:00:14,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:14,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914411749] [2023-12-02 15:00:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:00:14,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914411749] [2023-12-02 15:00:14,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914411749] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:00:14,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901210840] [2023-12-02 15:00:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:14,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:14,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:00:14,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:00:14,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:00:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:14,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:00:14,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:00:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:00:14,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:00:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:00:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901210840] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:00:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1423276513] [2023-12-02 15:00:14,975 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2023-12-02 15:00:14,975 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:00:14,976 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:00:14,976 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:00:14,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:00:19,748 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 129 for LOIs [2023-12-02 15:00:19,928 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 105 for LOIs [2023-12-02 15:00:19,941 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2023-12-02 15:00:20,007 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:00:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1423276513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:00:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:00:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [9, 9, 9] total 40 [2023-12-02 15:00:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225751927] [2023-12-02 15:00:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:00:26,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 15:00:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 15:00:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 15:00:26,796 INFO L87 Difference]: Start difference. First operand 517 states and 694 transitions. Second operand has 29 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 15:00:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:31,698 INFO L93 Difference]: Finished difference Result 855 states and 1162 transitions. [2023-12-02 15:00:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 15:00:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 64 [2023-12-02 15:00:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:31,703 INFO L225 Difference]: With dead ends: 855 [2023-12-02 15:00:31,703 INFO L226 Difference]: Without dead ends: 650 [2023-12-02 15:00:31,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=206, Invalid=1686, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 15:00:31,705 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 118 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 2735 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 4679 SdHoareTripleChecker+Invalid, 2766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:31,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 4679 Invalid, 2766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2735 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 15:00:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-12-02 15:00:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 647. [2023-12-02 15:00:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 476 states have (on average 1.3256302521008403) internal successors, (631), 480 states have internal predecessors, (631), 116 states have call successors, (116), 54 states have call predecessors, (116), 54 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-02 15:00:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 863 transitions. [2023-12-02 15:00:31,821 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 863 transitions. Word has length 64 [2023-12-02 15:00:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:31,821 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 863 transitions. [2023-12-02 15:00:31,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 21 states have internal predecessors, (45), 5 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 15:00:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 863 transitions. [2023-12-02 15:00:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 15:00:31,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:31,823 INFO L195 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] [2023-12-02 15:00:31,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 15:00:32,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:32,025 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:32,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1662054802, now seen corresponding path program 1 times [2023-12-02 15:00:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:32,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284377080] [2023-12-02 15:00:32,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:00:32,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284377080] [2023-12-02 15:00:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284377080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:00:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:00:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:00:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924458498] [2023-12-02 15:00:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:00:32,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:00:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:00:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:00:32,149 INFO L87 Difference]: Start difference. First operand 647 states and 863 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) [2023-12-02 15:00:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:32,307 INFO L93 Difference]: Finished difference Result 1194 states and 1611 transitions. [2023-12-02 15:00:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:00:32,308 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 [2023-12-02 15:00:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:32,312 INFO L225 Difference]: With dead ends: 1194 [2023-12-02 15:00:32,312 INFO L226 Difference]: Without dead ends: 663 [2023-12-02 15:00:32,313 INFO L412 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 [2023-12-02 15:00:32,314 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 5 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 642 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:32,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 642 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:00:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2023-12-02 15:00:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2023-12-02 15:00:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 488 states have (on average 1.3176229508196722) internal successors, (643), 492 states have internal predecessors, (643), 116 states have call successors, (116), 58 states have call predecessors, (116), 58 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-02 15:00:32,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 875 transitions. [2023-12-02 15:00:32,426 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 875 transitions. Word has length 66 [2023-12-02 15:00:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:32,426 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 875 transitions. [2023-12-02 15:00:32,426 INFO L496 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) [2023-12-02 15:00:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 875 transitions. [2023-12-02 15:00:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 15:00:32,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:32,428 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 15:00:32,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 15:00:32,429 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:32,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1867984620, now seen corresponding path program 1 times [2023-12-02 15:00:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:32,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49341864] [2023-12-02 15:00:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:32,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:00:32,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49341864] [2023-12-02 15:00:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49341864] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:00:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041060710] [2023-12-02 15:00:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:00:32,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:00:32,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:00:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:32,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:00:32,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:00:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:00:33,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:00:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:00:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041060710] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:00:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1999720738] [2023-12-02 15:00:33,156 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2023-12-02 15:00:33,156 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:00:33,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:00:33,157 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:00:33,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:00:38,841 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 94 for LOIs [2023-12-02 15:00:38,881 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 15:00:38,894 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 89 for LOIs [2023-12-02 15:00:38,946 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 106 for LOIs [2023-12-02 15:00:39,010 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 112 for LOIs [2023-12-02 15:00:39,135 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:00:39,200 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:00:51,129 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16100#(and (= ~s2s2_old~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (= (+ 2 ~active_side_History_2~0) 0) (<= 1 |#StackHeapBarrier|) (= ~s1p~0 0) (or (and (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side1Failed~0 256) 0)) (and (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side2Failed~0 256) 0))) (= ~cs1~0 0) (= (+ ~s1s2_old~0 1) 0) (= ~s2s1~0 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (+ ~s1p_old~0 1) 0) (= (+ ~s2p_new~0 1) 0) (= ~s1s1~0 0) (= (+ ~s2s1_new~0 1) 0) (= (+ ~s1p_new~0 1) 0) (= ~s2p_old~0 0) (= (+ ~s1s2_new~0 1) 0) (= ~s2s1_old~0 0) (= (+ ~cs1_new~0 1) 0) (= ~s2s2~0 0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (= (+ ~s2s2_new~0 1) 0) (= (+ ~s1s1_new~0 1) 0) (= (+ ~side1_written~0 1) 0) (= (+ 2 ~active_side_History_1~0) 0) (= ~active_side_History_0~0 0) (= assert_~arg 0) (= ~cs2~0 0) (= (+ ~cs2_new~0 1) 0) (= ~s2p~0 0) (= (+ ~s1s1_old~0 1) 0))' at error location [2023-12-02 15:00:51,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:00:51,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:00:51,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-12-02 15:00:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598132760] [2023-12-02 15:00:51,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:00:51,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:00:51,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:00:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2994, Unknown=0, NotChecked=0, Total=3306 [2023-12-02 15:00:51,132 INFO L87 Difference]: Start difference. First operand 663 states and 875 transitions. Second operand has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-02 15:00:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:51,650 INFO L93 Difference]: Finished difference Result 1262 states and 1692 transitions. [2023-12-02 15:00:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:00:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 70 [2023-12-02 15:00:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:51,656 INFO L225 Difference]: With dead ends: 1262 [2023-12-02 15:00:51,656 INFO L226 Difference]: Without dead ends: 731 [2023-12-02 15:00:51,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 154 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=336, Invalid=3570, Unknown=0, NotChecked=0, Total=3906 [2023-12-02 15:00:51,660 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 257 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:51,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 3147 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:00:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2023-12-02 15:00:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 663. [2023-12-02 15:00:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 488 states have (on average 1.3114754098360655) internal successors, (640), 492 states have internal predecessors, (640), 116 states have call successors, (116), 58 states have call predecessors, (116), 58 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2023-12-02 15:00:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 872 transitions. [2023-12-02 15:00:51,817 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 872 transitions. Word has length 70 [2023-12-02 15:00:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:51,817 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 872 transitions. [2023-12-02 15:00:51,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2023-12-02 15:00:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 872 transitions. [2023-12-02 15:00:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 15:00:51,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:51,819 INFO L195 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] [2023-12-02 15:00:51,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:00:52,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:52,020 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:52,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash -172696923, now seen corresponding path program 1 times [2023-12-02 15:00:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:52,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334587869] [2023-12-02 15:00:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:00:52,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:52,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334587869] [2023-12-02 15:00:52,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334587869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:00:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:00:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:00:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449420785] [2023-12-02 15:00:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:00:52,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:00:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:00:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:00:52,249 INFO L87 Difference]: Start difference. First operand 663 states and 872 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) [2023-12-02 15:00:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:52,969 INFO L93 Difference]: Finished difference Result 1317 states and 1811 transitions. [2023-12-02 15:00:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:00:52,969 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 [2023-12-02 15:00:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:52,974 INFO L225 Difference]: With dead ends: 1317 [2023-12-02 15:00:52,975 INFO L226 Difference]: Without dead ends: 1006 [2023-12-02 15:00:52,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:00:52,976 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 482 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:52,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1456 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:00:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2023-12-02 15:00:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 797. [2023-12-02 15:00:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 585 states have (on average 1.3128205128205128) internal successors, (768), 589 states have internal predecessors, (768), 140 states have call successors, (140), 71 states have call predecessors, (140), 71 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2023-12-02 15:00:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1048 transitions. [2023-12-02 15:00:53,114 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1048 transitions. Word has length 71 [2023-12-02 15:00:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:53,114 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1048 transitions. [2023-12-02 15:00:53,114 INFO L496 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) [2023-12-02 15:00:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1048 transitions. [2023-12-02 15:00:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 15:00:53,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:53,116 INFO L195 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] [2023-12-02 15:00:53,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 15:00:53,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:53,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 660061754, now seen corresponding path program 1 times [2023-12-02 15:00:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316555948] [2023-12-02 15:00:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:00:53,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316555948] [2023-12-02 15:00:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316555948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:00:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:00:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:00:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632096126] [2023-12-02 15:00:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:00:53,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:00:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:00:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:00:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:00:53,279 INFO L87 Difference]: Start difference. First operand 797 states and 1048 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) [2023-12-02 15:00:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:00:53,975 INFO L93 Difference]: Finished difference Result 1505 states and 2064 transitions. [2023-12-02 15:00:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:00:53,976 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 [2023-12-02 15:00:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:00:53,981 INFO L225 Difference]: With dead ends: 1505 [2023-12-02 15:00:53,981 INFO L226 Difference]: Without dead ends: 1164 [2023-12-02 15:00:53,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:00:53,983 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 498 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:00:53,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2066 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:00:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2023-12-02 15:00:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 950. [2023-12-02 15:00:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 695 states have (on average 1.3237410071942446) internal successors, (920), 700 states have internal predecessors, (920), 169 states have call successors, (169), 85 states have call predecessors, (169), 85 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2023-12-02 15:00:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1258 transitions. [2023-12-02 15:00:54,136 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1258 transitions. Word has length 73 [2023-12-02 15:00:54,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:00:54,136 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1258 transitions. [2023-12-02 15:00:54,136 INFO L496 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) [2023-12-02 15:00:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1258 transitions. [2023-12-02 15:00:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 15:00:54,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:00:54,137 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:00:54,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 15:00:54,137 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:00:54,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:00:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1499947866, now seen corresponding path program 1 times [2023-12-02 15:00:54,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:00:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626088432] [2023-12-02 15:00:54,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:54,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:00:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 15:00:54,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:00:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626088432] [2023-12-02 15:00:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626088432] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:00:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139295038] [2023-12-02 15:00:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:00:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:00:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:00:54,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:00:54,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:00:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:00:54,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:00:54,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:00:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 15:00:54,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:00:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 15:00:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139295038] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:00:54,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1179059279] [2023-12-02 15:00:54,819 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2023-12-02 15:00:54,819 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:00:54,820 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:00:54,820 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:00:54,820 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:01:00,420 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 134 for LOIs [2023-12-02 15:01:00,618 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 15:01:00,631 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2023-12-02 15:01:00,853 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:01:00,945 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:01:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1179059279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:01:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [8, 9, 9] total 50 [2023-12-02 15:01:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385061949] [2023-12-02 15:01:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 15:01:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 15:01:10,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2223, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 15:01:10,645 INFO L87 Difference]: Start difference. First operand 950 states and 1258 transitions. Second operand has 39 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 15:01:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:15,474 INFO L93 Difference]: Finished difference Result 1538 states and 2057 transitions. [2023-12-02 15:01:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 15:01:15,475 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2023-12-02 15:01:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:15,480 INFO L225 Difference]: With dead ends: 1538 [2023-12-02 15:01:15,480 INFO L226 Difference]: Without dead ends: 939 [2023-12-02 15:01:15,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 185 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=258, Invalid=2712, Unknown=0, NotChecked=0, Total=2970 [2023-12-02 15:01:15,484 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 199 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:15,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2470 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 15:01:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-12-02 15:01:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 936. [2023-12-02 15:01:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 685 states have (on average 1.3226277372262774) internal successors, (906), 690 states have internal predecessors, (906), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2023-12-02 15:01:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1238 transitions. [2023-12-02 15:01:15,676 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1238 transitions. Word has length 77 [2023-12-02 15:01:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:15,676 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 1238 transitions. [2023-12-02 15:01:15,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.5) internal successors, (48), 27 states have internal predecessors, (48), 8 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-12-02 15:01:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1238 transitions. [2023-12-02 15:01:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 15:01:15,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:15,678 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:01:15,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:01:15,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 15:01:15,882 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:15,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:15,882 INFO L85 PathProgramCache]: Analyzing trace with hash 444655750, now seen corresponding path program 1 times [2023-12-02 15:01:15,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:15,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005712909] [2023-12-02 15:01:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 15:01:16,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005712909] [2023-12-02 15:01:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005712909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:01:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850814329] [2023-12-02 15:01:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:16,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:01:16,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:01:16,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:01:16,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:01:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:16,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 15:01:16,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:01:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:01:16,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:01:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850814329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:01:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-12-02 15:01:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316983743] [2023-12-02 15:01:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:01:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:01:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:01:16,365 INFO L87 Difference]: Start difference. First operand 936 states and 1238 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 15:01:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:16,870 INFO L93 Difference]: Finished difference Result 1761 states and 2381 transitions. [2023-12-02 15:01:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:01:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2023-12-02 15:01:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:16,878 INFO L225 Difference]: With dead ends: 1761 [2023-12-02 15:01:16,878 INFO L226 Difference]: Without dead ends: 1045 [2023-12-02 15:01:16,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:01:16,880 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 465 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:16,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1386 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:01:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2023-12-02 15:01:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 936. [2023-12-02 15:01:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 685 states have (on average 1.3167883211678832) internal successors, (902), 690 states have internal predecessors, (902), 166 states have call successors, (166), 84 states have call predecessors, (166), 84 states have return successors, (166), 161 states have call predecessors, (166), 166 states have call successors, (166) [2023-12-02 15:01:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1234 transitions. [2023-12-02 15:01:17,071 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1234 transitions. Word has length 77 [2023-12-02 15:01:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:17,071 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 1234 transitions. [2023-12-02 15:01:17,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 15:01:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1234 transitions. [2023-12-02 15:01:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 15:01:17,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:17,073 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2023-12-02 15:01:17,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:01:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 15:01:17,274 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:17,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 811971612, now seen corresponding path program 1 times [2023-12-02 15:01:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467300323] [2023-12-02 15:01:17,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 15:01:17,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467300323] [2023-12-02 15:01:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467300323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:01:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:01:17,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071615341] [2023-12-02 15:01:17,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:17,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:01:17,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:01:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:01:17,419 INFO L87 Difference]: Start difference. First operand 936 states and 1234 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:01:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:17,711 INFO L93 Difference]: Finished difference Result 1241 states and 1714 transitions. [2023-12-02 15:01:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:01:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 80 [2023-12-02 15:01:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:17,718 INFO L225 Difference]: With dead ends: 1241 [2023-12-02 15:01:17,718 INFO L226 Difference]: Without dead ends: 1239 [2023-12-02 15:01:17,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:01:17,719 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 171 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:17,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1527 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:01:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-12-02 15:01:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 944. [2023-12-02 15:01:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 689 states have (on average 1.3149492017416546) internal successors, (906), 696 states have internal predecessors, (906), 168 states have call successors, (168), 86 states have call predecessors, (168), 86 states have return successors, (168), 161 states have call predecessors, (168), 168 states have call successors, (168) [2023-12-02 15:01:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1242 transitions. [2023-12-02 15:01:17,877 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1242 transitions. Word has length 80 [2023-12-02 15:01:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:17,877 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1242 transitions. [2023-12-02 15:01:17,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:01:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1242 transitions. [2023-12-02 15:01:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-02 15:01:17,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:17,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2023-12-02 15:01:17,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 15:01:17,879 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:17,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 578326197, now seen corresponding path program 1 times [2023-12-02 15:01:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662295288] [2023-12-02 15:01:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 15:01:18,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662295288] [2023-12-02 15:01:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662295288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:18,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:01:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:01:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826450354] [2023-12-02 15:01:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:18,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:01:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:01:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:01:18,004 INFO L87 Difference]: Start difference. First operand 944 states and 1242 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:01:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:18,205 INFO L93 Difference]: Finished difference Result 1626 states and 2156 transitions. [2023-12-02 15:01:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:01:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 83 [2023-12-02 15:01:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:18,211 INFO L225 Difference]: With dead ends: 1626 [2023-12-02 15:01:18,211 INFO L226 Difference]: Without dead ends: 932 [2023-12-02 15:01:18,212 INFO L412 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 [2023-12-02 15:01:18,213 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:18,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 634 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:01:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2023-12-02 15:01:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2023-12-02 15:01:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 683 states have (on average 1.2913616398243046) internal successors, (882), 690 states have internal predecessors, (882), 162 states have call successors, (162), 86 states have call predecessors, (162), 86 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2023-12-02 15:01:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1206 transitions. [2023-12-02 15:01:18,366 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1206 transitions. Word has length 83 [2023-12-02 15:01:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:18,367 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1206 transitions. [2023-12-02 15:01:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-02 15:01:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1206 transitions. [2023-12-02 15:01:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-02 15:01:18,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:18,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2023-12-02 15:01:18,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 15:01:18,369 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:18,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1019597036, now seen corresponding path program 1 times [2023-12-02 15:01:18,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:18,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447359776] [2023-12-02 15:01:18,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:18,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:01:18,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447359776] [2023-12-02 15:01:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447359776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:01:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623302853] [2023-12-02 15:01:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:01:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:01:18,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:01:18,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:01:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:18,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:01:18,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:01:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:01:19,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:01:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:01:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623302853] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:01:19,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797459693] [2023-12-02 15:01:19,164 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2023-12-02 15:01:19,164 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:01:19,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:01:19,164 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:01:19,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:01:26,304 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 94 for LOIs [2023-12-02 15:01:26,343 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 15:01:26,356 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2023-12-02 15:01:26,501 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 110 for LOIs [2023-12-02 15:01:26,570 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 120 for LOIs [2023-12-02 15:01:26,743 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:01:26,808 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:01:41,098 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '38341#(and (= ~s2s2_old~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (= (+ 2 ~active_side_History_2~0) 0) (<= 1 |#StackHeapBarrier|) (or (and (not (= (mod ~side1Failed_History_0~0 256) 0)) (not (= (mod ~side2Failed_History_1~0 256) 0)) (= (mod ~side2Failed~0 256) 0) (= (mod ~side1Failed_History_1~0 256) 0)) (and (not (= (mod ~side1Failed_History_0~0 256) 0)) (not (= (mod ~side2Failed_History_1~0 256) 0)) (= (mod ~side1Failed~0 256) 0) (= (mod ~side1Failed_History_1~0 256) 0))) (= ~s1p~0 0) (= ~cs1~0 0) (= (+ ~s1s2_old~0 1) 0) (= ~s2s1~0 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (+ ~s1p_old~0 1) 0) (= (+ ~s2p_new~0 1) 0) (= ~s1s1~0 0) (= (+ ~s2s1_new~0 1) 0) (= (+ ~s1p_new~0 1) 0) (= ~s2p_old~0 0) (= (+ ~s1s2_new~0 1) 0) (= ~s2s1_old~0 0) (= (+ ~cs1_new~0 1) 0) (= ~s2s2~0 0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (= (+ ~s2s2_new~0 1) 0) (= (+ ~s1s1_new~0 1) 0) (= (+ ~side1_written~0 1) 0) (= (+ 2 ~active_side_History_1~0) 0) (= ~active_side_History_0~0 0) (= assert_~arg 0) (= ~cs2~0 0) (= (+ ~cs2_new~0 1) 0) (= ~s2p~0 0) (= (+ ~s1s1_old~0 1) 0))' at error location [2023-12-02 15:01:41,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:01:41,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:01:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-12-02 15:01:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123888930] [2023-12-02 15:01:41,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:01:41,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:01:41,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:01:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=3636, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 15:01:41,102 INFO L87 Difference]: Start difference. First operand 932 states and 1206 transitions. Second operand has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-02 15:01:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:41,652 INFO L93 Difference]: Finished difference Result 1874 states and 2471 transitions. [2023-12-02 15:01:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:01:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 85 [2023-12-02 15:01:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:41,659 INFO L225 Difference]: With dead ends: 1874 [2023-12-02 15:01:41,659 INFO L226 Difference]: Without dead ends: 1117 [2023-12-02 15:01:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 191 SyntacticMatches, 9 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=424, Invalid=4268, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 15:01:41,663 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 173 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1860 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:01:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2023-12-02 15:01:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 911. [2023-12-02 15:01:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 668 states have (on average 1.284431137724551) internal successors, (858), 675 states have internal predecessors, (858), 156 states have call successors, (156), 86 states have call predecessors, (156), 86 states have return successors, (156), 149 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-02 15:01:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1170 transitions. [2023-12-02 15:01:41,818 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1170 transitions. Word has length 85 [2023-12-02 15:01:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:41,819 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1170 transitions. [2023-12-02 15:01:41,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (21), 3 states have call predecessors, (21), 8 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-02 15:01:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1170 transitions. [2023-12-02 15:01:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-02 15:01:41,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:41,820 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-02 15:01:41,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 15:01:42,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 15:01:42,021 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:42,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1652874954, now seen corresponding path program 1 times [2023-12-02 15:01:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824833016] [2023-12-02 15:01:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 15:01:42,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824833016] [2023-12-02 15:01:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824833016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:42,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:01:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:01:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058690455] [2023-12-02 15:01:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:42,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:01:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:42,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:01:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:01:42,310 INFO L87 Difference]: Start difference. First operand 911 states and 1170 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 15:01:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:43,066 INFO L93 Difference]: Finished difference Result 2501 states and 3393 transitions. [2023-12-02 15:01:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:01:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2023-12-02 15:01:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:43,075 INFO L225 Difference]: With dead ends: 2501 [2023-12-02 15:01:43,075 INFO L226 Difference]: Without dead ends: 1820 [2023-12-02 15:01:43,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:01:43,076 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 490 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:43,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1628 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:01:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2023-12-02 15:01:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1100. [2023-12-02 15:01:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 804 states have (on average 1.2835820895522387) internal successors, (1032), 813 states have internal predecessors, (1032), 190 states have call successors, (190), 105 states have call predecessors, (190), 105 states have return successors, (190), 181 states have call predecessors, (190), 190 states have call successors, (190) [2023-12-02 15:01:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1412 transitions. [2023-12-02 15:01:43,288 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1412 transitions. Word has length 85 [2023-12-02 15:01:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:43,288 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1412 transitions. [2023-12-02 15:01:43,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-02 15:01:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1412 transitions. [2023-12-02 15:01:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 15:01:43,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:43,290 INFO L195 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] [2023-12-02 15:01:43,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 15:01:43,290 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:43,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 997837635, now seen corresponding path program 1 times [2023-12-02 15:01:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252426080] [2023-12-02 15:01:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 15:01:43,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252426080] [2023-12-02 15:01:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252426080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:01:43,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:01:43,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:01:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356421439] [2023-12-02 15:01:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:01:43,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:01:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:01:43,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:01:43,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:01:43,410 INFO L87 Difference]: Start difference. First operand 1100 states and 1412 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-02 15:01:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:01:43,664 INFO L93 Difference]: Finished difference Result 1893 states and 2451 transitions. [2023-12-02 15:01:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:01:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 92 [2023-12-02 15:01:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:01:43,669 INFO L225 Difference]: With dead ends: 1893 [2023-12-02 15:01:43,669 INFO L226 Difference]: Without dead ends: 1084 [2023-12-02 15:01:43,670 INFO L412 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 [2023-12-02 15:01:43,671 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:01:43,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 616 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:01:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-12-02 15:01:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2023-12-02 15:01:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 796 states have (on average 1.256281407035176) internal successors, (1000), 805 states have internal predecessors, (1000), 182 states have call successors, (182), 105 states have call predecessors, (182), 105 states have return successors, (182), 173 states have call predecessors, (182), 182 states have call successors, (182) [2023-12-02 15:01:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1364 transitions. [2023-12-02 15:01:43,901 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1364 transitions. Word has length 92 [2023-12-02 15:01:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:01:43,901 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1364 transitions. [2023-12-02 15:01:43,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-02 15:01:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1364 transitions. [2023-12-02 15:01:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 15:01:43,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:01:43,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-12-02 15:01:43,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 15:01:43,902 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:01:43,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:01:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -348183969, now seen corresponding path program 1 times [2023-12-02 15:01:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:01:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677011393] [2023-12-02 15:01:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:01:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:01:44,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:01:44,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677011393] [2023-12-02 15:01:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677011393] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:01:44,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2206325] [2023-12-02 15:01:44,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:44,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:01:44,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:01:44,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:01:44,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:01:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:44,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:01:44,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:01:44,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:01:44,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:01:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 15:01:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2206325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:01:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169154121] [2023-12-02 15:01:44,506 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2023-12-02 15:01:44,506 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:01:44,506 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:01:44,506 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:01:44,507 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:01:50,716 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 132 for LOIs [2023-12-02 15:01:50,874 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 111 for LOIs [2023-12-02 15:01:50,893 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2023-12-02 15:01:51,063 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 136 for LOIs [2023-12-02 15:01:51,869 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:01:51,933 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:02:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [169154121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:02:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:02:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [8, 9, 9] total 60 [2023-12-02 15:02:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76039893] [2023-12-02 15:02:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:02:06,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 15:02:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:02:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 15:02:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3178, Unknown=0, NotChecked=0, Total=3540 [2023-12-02 15:02:06,186 INFO L87 Difference]: Start difference. First operand 1084 states and 1364 transitions. Second operand has 49 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:02:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:02:12,644 INFO L93 Difference]: Finished difference Result 1853 states and 2350 transitions. [2023-12-02 15:02:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 15:02:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 92 [2023-12-02 15:02:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:02:12,650 INFO L225 Difference]: With dead ends: 1853 [2023-12-02 15:02:12,650 INFO L226 Difference]: Without dead ends: 1173 [2023-12-02 15:02:12,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 220 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=393, Invalid=3767, Unknown=0, NotChecked=0, Total=4160 [2023-12-02 15:02:12,652 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 192 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 3617 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 3680 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:02:12,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 3680 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3617 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 15:02:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-12-02 15:02:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1074. [2023-12-02 15:02:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 789 states have (on average 1.2534854245880862) internal successors, (989), 798 states have internal predecessors, (989), 179 states have call successors, (179), 105 states have call predecessors, (179), 105 states have return successors, (179), 170 states have call predecessors, (179), 179 states have call successors, (179) [2023-12-02 15:02:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1347 transitions. [2023-12-02 15:02:12,865 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1347 transitions. Word has length 92 [2023-12-02 15:02:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:02:12,865 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1347 transitions. [2023-12-02 15:02:12,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 1.325) internal successors, (53), 34 states have internal predecessors, (53), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:02:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1347 transitions. [2023-12-02 15:02:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 15:02:12,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:02:12,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-12-02 15:02:12,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:02:13,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 15:02:13,067 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:02:13,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:02:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1593752922, now seen corresponding path program 1 times [2023-12-02 15:02:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:02:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477545721] [2023-12-02 15:02:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:02:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:02:13,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:02:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477545721] [2023-12-02 15:02:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477545721] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:02:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130618825] [2023-12-02 15:02:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:02:13,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:02:13,376 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:02:13,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 15:02:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:13,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:02:13,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:02:13,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:02:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 15:02:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130618825] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:02:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094954897] [2023-12-02 15:02:13,732 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2023-12-02 15:02:13,732 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:02:13,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:02:13,732 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:02:13,732 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:02:19,792 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 127 for LOIs [2023-12-02 15:02:19,945 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 105 for LOIs [2023-12-02 15:02:19,958 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 86 for LOIs [2023-12-02 15:02:20,107 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 132 for LOIs [2023-12-02 15:02:20,976 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2023-12-02 15:02:21,037 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:02:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1094954897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:02:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:02:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [8, 9, 9] total 62 [2023-12-02 15:02:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896782412] [2023-12-02 15:02:36,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:02:36,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 15:02:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:02:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 15:02:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3416, Unknown=0, NotChecked=0, Total=3782 [2023-12-02 15:02:36,020 INFO L87 Difference]: Start difference. First operand 1074 states and 1347 transitions. Second operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 36 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:02:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:02:45,095 INFO L93 Difference]: Finished difference Result 1886 states and 2400 transitions. [2023-12-02 15:02:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 15:02:45,095 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 36 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 94 [2023-12-02 15:02:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:02:45,101 INFO L225 Difference]: With dead ends: 1886 [2023-12-02 15:02:45,101 INFO L226 Difference]: Without dead ends: 1206 [2023-12-02 15:02:45,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 224 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=397, Invalid=4025, Unknown=0, NotChecked=0, Total=4422 [2023-12-02 15:02:45,104 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 251 mSDsluCounter, 6502 mSDsCounter, 0 mSdLazyCounter, 5364 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 6861 SdHoareTripleChecker+Invalid, 5428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 5364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:02:45,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 6861 Invalid, 5428 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 5364 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-02 15:02:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2023-12-02 15:02:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1077. [2023-12-02 15:02:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 791 states have (on average 1.2528445006321112) internal successors, (991), 800 states have internal predecessors, (991), 180 states have call successors, (180), 105 states have call predecessors, (180), 105 states have return successors, (180), 171 states have call predecessors, (180), 180 states have call successors, (180) [2023-12-02 15:02:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1351 transitions. [2023-12-02 15:02:45,319 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1351 transitions. Word has length 94 [2023-12-02 15:02:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:02:45,319 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1351 transitions. [2023-12-02 15:02:45,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 36 states have internal predecessors, (55), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:02:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1351 transitions. [2023-12-02 15:02:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 15:02:45,321 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:02:45,321 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-12-02 15:02:45,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 15:02:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 15:02:45,522 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:02:45,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:02:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 717112231, now seen corresponding path program 1 times [2023-12-02 15:02:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:02:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021452861] [2023-12-02 15:02:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:02:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 15:02:45,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:02:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021452861] [2023-12-02 15:02:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021452861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:02:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424935113] [2023-12-02 15:02:45,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:02:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:02:45,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:02:45,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 15:02:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:45,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:02:45,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 15:02:45,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:02:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 15:02:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424935113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:02:46,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076826370] [2023-12-02 15:02:46,130 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2023-12-02 15:02:46,130 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:02:46,131 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:02:46,131 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:02:46,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:02:52,841 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 131 for LOIs [2023-12-02 15:02:53,066 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 105 for LOIs [2023-12-02 15:02:53,079 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 86 for LOIs [2023-12-02 15:02:53,222 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 132 for LOIs [2023-12-02 15:02:54,086 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2023-12-02 15:02:54,148 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:03:09,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1076826370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:09,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [8, 9, 9] total 62 [2023-12-02 15:03:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853631636] [2023-12-02 15:03:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:09,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 15:03:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:09,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 15:03:09,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=3416, Unknown=0, NotChecked=0, Total=3782 [2023-12-02 15:03:09,073 INFO L87 Difference]: Start difference. First operand 1077 states and 1351 transitions. Second operand has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:03:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:17,738 INFO L93 Difference]: Finished difference Result 1876 states and 2383 transitions. [2023-12-02 15:03:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 15:03:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 98 [2023-12-02 15:03:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:17,744 INFO L225 Difference]: With dead ends: 1876 [2023-12-02 15:03:17,744 INFO L226 Difference]: Without dead ends: 1196 [2023-12-02 15:03:17,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 236 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=397, Invalid=4025, Unknown=0, NotChecked=0, Total=4422 [2023-12-02 15:03:17,746 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 255 mSDsluCounter, 7042 mSDsCounter, 0 mSdLazyCounter, 5363 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 7386 SdHoareTripleChecker+Invalid, 5426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 5363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:17,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 7386 Invalid, 5426 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 5363 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-02 15:03:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-12-02 15:03:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1064. [2023-12-02 15:03:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 782 states have (on average 1.2506393861892584) internal successors, (978), 791 states have internal predecessors, (978), 176 states have call successors, (176), 105 states have call predecessors, (176), 105 states have return successors, (176), 167 states have call predecessors, (176), 176 states have call successors, (176) [2023-12-02 15:03:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1330 transitions. [2023-12-02 15:03:17,958 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1330 transitions. Word has length 98 [2023-12-02 15:03:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:17,958 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 1330 transitions. [2023-12-02 15:03:17,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.372093023255814) internal successors, (59), 36 states have internal predecessors, (59), 10 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-02 15:03:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1330 transitions. [2023-12-02 15:03:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 15:03:17,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:17,960 INFO L195 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] [2023-12-02 15:03:17,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 15:03:18,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 15:03:18,160 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:03:18,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 653630847, now seen corresponding path program 1 times [2023-12-02 15:03:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071260298] [2023-12-02 15:03:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-02 15:03:18,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071260298] [2023-12-02 15:03:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071260298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:18,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373332267] [2023-12-02 15:03:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:18,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:18,269 INFO L87 Difference]: Start difference. First operand 1064 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-02 15:03:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:18,530 INFO L93 Difference]: Finished difference Result 1777 states and 2253 transitions. [2023-12-02 15:03:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2023-12-02 15:03:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:18,535 INFO L225 Difference]: With dead ends: 1777 [2023-12-02 15:03:18,535 INFO L226 Difference]: Without dead ends: 1048 [2023-12-02 15:03:18,536 INFO L412 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 [2023-12-02 15:03:18,537 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:18,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 604 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:03:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-12-02 15:03:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 973. [2023-12-02 15:03:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 720 states have (on average 1.2138888888888888) internal successors, (874), 729 states have internal predecessors, (874), 156 states have call successors, (156), 96 states have call predecessors, (156), 96 states have return successors, (156), 147 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-02 15:03:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1186 transitions. [2023-12-02 15:03:18,735 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1186 transitions. Word has length 108 [2023-12-02 15:03:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:18,735 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1186 transitions. [2023-12-02 15:03:18,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-02 15:03:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1186 transitions. [2023-12-02 15:03:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 15:03:18,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:18,737 INFO L195 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] [2023-12-02 15:03:18,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 15:03:18,737 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:03:18,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash -852364933, now seen corresponding path program 1 times [2023-12-02 15:03:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238865415] [2023-12-02 15:03:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:03:18,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238865415] [2023-12-02 15:03:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238865415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972374644] [2023-12-02 15:03:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:18,839 INFO L87 Difference]: Start difference. First operand 973 states and 1186 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) [2023-12-02 15:03:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:19,069 INFO L93 Difference]: Finished difference Result 1554 states and 1931 transitions. [2023-12-02 15:03:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:19,069 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 [2023-12-02 15:03:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:19,073 INFO L225 Difference]: With dead ends: 1554 [2023-12-02 15:03:19,073 INFO L226 Difference]: Without dead ends: 958 [2023-12-02 15:03:19,074 INFO L412 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 [2023-12-02 15:03:19,075 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 6 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:19,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 595 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:03:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-02 15:03:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 934. [2023-12-02 15:03:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 692 states have (on average 1.1921965317919074) internal successors, (825), 701 states have internal predecessors, (825), 148 states have call successors, (148), 93 states have call predecessors, (148), 93 states have return successors, (148), 139 states have call predecessors, (148), 148 states have call successors, (148) [2023-12-02 15:03:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1121 transitions. [2023-12-02 15:03:19,306 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1121 transitions. Word has length 124 [2023-12-02 15:03:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:19,306 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1121 transitions. [2023-12-02 15:03:19,306 INFO L496 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) [2023-12-02 15:03:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1121 transitions. [2023-12-02 15:03:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-02 15:03:19,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:19,308 INFO L195 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] [2023-12-02 15:03:19,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-02 15:03:19,309 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:03:19,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 145512122, now seen corresponding path program 1 times [2023-12-02 15:03:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:19,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000761745] [2023-12-02 15:03:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-02 15:03:19,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000761745] [2023-12-02 15:03:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000761745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88399576] [2023-12-02 15:03:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:19,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:19,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 15:03:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:19,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 15:03:19,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 15:03:19,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-02 15:03:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88399576] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [760998389] [2023-12-02 15:03:19,996 INFO L159 IcfgInterpreter]: Started Sifa with 86 locations of interest [2023-12-02 15:03:19,996 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:19,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:19,996 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:19,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:03:28,365 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 95 for LOIs [2023-12-02 15:03:28,602 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 15:03:28,615 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2023-12-02 15:03:28,829 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 140 for LOIs [2023-12-02 15:03:28,935 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 93 for LOIs [2023-12-02 15:03:29,069 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 93 for LOIs [2023-12-02 15:03:29,208 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:03:47,462 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '70867#(and (= ~s2s2_old~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (= (+ 2 ~active_side_History_2~0) 0) (<= 1 |#StackHeapBarrier|) (= ~s1p~0 0) (= ~cs1~0 0) (= (+ ~s1s2_old~0 1) 0) (= ~s2s1~0 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (+ ~s1p_old~0 1) 0) (= (+ ~s2p_new~0 1) 0) (= ~s1s1~0 0) (= (+ ~s2s1_new~0 1) 0) (= (+ ~s1p_new~0 1) 0) (= ~s2p_old~0 0) (= (+ ~s1s2_new~0 1) 0) (exists ((|v_ULTIMATE.start_check_~tmp___18~0#1_27| Int) (|v_ULTIMATE.start_check_~tmp___19~0#1_27| Int)) (and (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_27| |v_ULTIMATE.start_check_~tmp___19~0#1_27|)) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_27| 128)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_27| 127) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_27| 127) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_27|)))) (= ~s2s1_old~0 0) (= (+ ~cs1_new~0 1) 0) (= ~s2s2~0 0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (= (+ ~s2s2_new~0 1) 0) (= (+ ~s1s1_new~0 1) 0) (= (+ ~side1_written~0 1) 0) (or (and (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_35| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___1~0#1_35| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_38| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___7~0#1_38| 256) 0)) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_33| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___2~0#1_33| 256) 0))) (exists ((|v_ULTIMATE.start_check_~tmp___14~0#1_27| Int) (|v_ULTIMATE.start_check_~tmp___15~0#1_27| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___15~0#1_27| 256) (mod |v_ULTIMATE.start_check_~tmp___14~0#1_27| 256))) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_29| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___11~0#1_29| 256) 0))) (= (mod ~side1Failed~0 256) 0)) (and (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_35| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___1~0#1_35| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_38| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___7~0#1_38| 256) 0)) (= (mod ~side2Failed_History_1~0 256) (mod ~side2Failed_History_2~0 256)) (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_33| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___2~0#1_33| 256) 0))) (exists ((|v_ULTIMATE.start_check_~tmp___14~0#1_27| Int) (|v_ULTIMATE.start_check_~tmp___15~0#1_27| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___15~0#1_27| 256) (mod |v_ULTIMATE.start_check_~tmp___14~0#1_27| 256))) (= (mod ~side2Failed~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_29| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___11~0#1_29| 256) 0))))) (= (+ 2 ~active_side_History_1~0) 0) (= ~active_side_History_0~0 0) (= assert_~arg 0) (= ~cs2~0 0) (= (+ ~cs2_new~0 1) 0) (= ~s2p~0 0) (= (+ ~s1s1_old~0 1) 0))' at error location [2023-12-02 15:03:47,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:03:47,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:03:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 13 [2023-12-02 15:03:47,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555241332] [2023-12-02 15:03:47,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:47,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 15:03:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:03:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 15:03:47,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4434, Unknown=0, NotChecked=0, Total=4830 [2023-12-02 15:03:47,465 INFO L87 Difference]: Start difference. First operand 934 states and 1121 transitions. Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 10 states have internal predecessors, (108), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) [2023-12-02 15:03:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:48,418 INFO L93 Difference]: Finished difference Result 2313 states and 2891 transitions. [2023-12-02 15:03:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:03:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 10 states have internal predecessors, (108), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) Word has length 134 [2023-12-02 15:03:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:48,425 INFO L225 Difference]: With dead ends: 2313 [2023-12-02 15:03:48,425 INFO L226 Difference]: Without dead ends: 1558 [2023-12-02 15:03:48,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 324 SyntacticMatches, 19 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=433, Invalid=5117, Unknown=0, NotChecked=0, Total=5550 [2023-12-02 15:03:48,427 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 538 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:48,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 2295 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:03:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2023-12-02 15:03:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1237. [2023-12-02 15:03:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 914 states have (on average 1.1827133479212253) internal successors, (1081), 926 states have internal predecessors, (1081), 196 states have call successors, (196), 126 states have call predecessors, (196), 126 states have return successors, (196), 184 states have call predecessors, (196), 196 states have call successors, (196) [2023-12-02 15:03:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1473 transitions. [2023-12-02 15:03:48,664 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1473 transitions. Word has length 134 [2023-12-02 15:03:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1473 transitions. [2023-12-02 15:03:48,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 10 states have internal predecessors, (108), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (30), 6 states have call predecessors, (30), 3 states have call successors, (30) [2023-12-02 15:03:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1473 transitions. [2023-12-02 15:03:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 15:03:48,666 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:48,666 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:48,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 15:03:48,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 15:03:48,867 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:03:48,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1793690646, now seen corresponding path program 1 times [2023-12-02 15:03:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:03:48,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717664343] [2023-12-02 15:03:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:03:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-02 15:03:51,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:03:51,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717664343] [2023-12-02 15:03:51,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717664343] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:51,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100795870] [2023-12-02 15:03:51,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:51,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:51,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:51,009 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:51,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 15:03:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:51,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 15:03:51,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 15:03:51,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-12-02 15:03:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100795870] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385368039] [2023-12-02 15:03:52,501 INFO L159 IcfgInterpreter]: Started Sifa with 89 locations of interest [2023-12-02 15:03:52,501 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:03:52,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:03:52,502 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:03:52,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:04:01,507 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 95 for LOIs [2023-12-02 15:04:01,742 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 108 for LOIs [2023-12-02 15:04:01,755 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 90 for LOIs [2023-12-02 15:04:01,963 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 140 for LOIs [2023-12-02 15:04:02,081 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 90 for LOIs [2023-12-02 15:04:02,256 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 90 for LOIs [2023-12-02 15:04:02,415 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:04:28,886 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '76342#(and (= ~s2s2_old~0 0) (<= 0 (+ ~manual_selection_History_0~0 128)) (= (+ 2 ~active_side_History_2~0) 0) (<= 1 |#StackHeapBarrier|) (= ~s1p~0 0) (= ~cs1~0 0) (= (+ ~s1s2_old~0 1) 0) (= ~s2s1~0 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (+ ~s1p_old~0 1) 0) (= (+ ~s2p_new~0 1) 0) (= ~s1s1~0 0) (= (+ ~s2s1_new~0 1) 0) (= (+ ~s1p_new~0 1) 0) (= ~s2p_old~0 0) (= (+ ~s1s2_new~0 1) 0) (or (and (= (mod ~side2Failed_History_2~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_39| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___1~0#1_39| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_33| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___11~0#1_33| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___15~0#1_31| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_31| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___14~0#1_31| 256) (mod |v_ULTIMATE.start_check_~tmp___15~0#1_31| 256))) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_42| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___7~0#1_42| 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side2Failed~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_37| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___2~0#1_37| 256) 0)))) (and (= (mod ~side2Failed_History_2~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_39| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___1~0#1_39| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_33| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___11~0#1_33| 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___15~0#1_31| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_31| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___14~0#1_31| 256) (mod |v_ULTIMATE.start_check_~tmp___15~0#1_31| 256))) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_42| Int)) (= (mod |v_ULTIMATE.start_check_~tmp___7~0#1_42| 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (= (mod ~side1Failed~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_37| Int)) (not (= (mod |v_ULTIMATE.start_check_~tmp___2~0#1_37| 256) 0))))) (= ~s2s1_old~0 0) (= (+ ~cs1_new~0 1) 0) (= ~s2s2~0 0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (= (+ ~nomsg~0 1) 0) (= ~s1s2~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___18~0#1_31| Int) (|v_ULTIMATE.start_check_~tmp___19~0#1_31| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_31|)) (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_31| |v_ULTIMATE.start_check_~tmp___19~0#1_31|)) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_31| 127) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_31| 128)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_31| 127))) (= (+ ~s2s2_new~0 1) 0) (= (+ ~s1s1_new~0 1) 0) (= (+ ~side1_written~0 1) 0) (= (+ 2 ~active_side_History_1~0) 0) (= ~active_side_History_0~0 0) (= assert_~arg 0) (= ~cs2~0 0) (= (+ ~cs2_new~0 1) 0) (= ~s2p~0 0) (= (+ ~s1s1_old~0 1) 0))' at error location [2023-12-02 15:04:28,886 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:04:28,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:04:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14, 14] total 55 [2023-12-02 15:04:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876768543] [2023-12-02 15:04:28,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:28,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-02 15:04:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:04:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-02 15:04:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2194, Invalid=10916, Unknown=0, NotChecked=0, Total=13110 [2023-12-02 15:04:28,890 INFO L87 Difference]: Start difference. First operand 1237 states and 1473 transitions. Second operand has 55 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 44 states have internal predecessors, (185), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2023-12-02 15:04:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:33,518 INFO L93 Difference]: Finished difference Result 2646 states and 3328 transitions. [2023-12-02 15:04:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-02 15:04:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 44 states have internal predecessors, (185), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) Word has length 142 [2023-12-02 15:04:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:33,525 INFO L225 Difference]: With dead ends: 2646 [2023-12-02 15:04:33,526 INFO L226 Difference]: Without dead ends: 1639 [2023-12-02 15:04:33,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 334 SyntacticMatches, 15 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6322 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=2648, Invalid=17092, Unknown=0, NotChecked=0, Total=19740 [2023-12-02 15:04:33,530 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 641 mSDsluCounter, 9976 mSDsCounter, 0 mSdLazyCounter, 3947 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 10345 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 3947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:33,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 10345 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 3947 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 15:04:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2023-12-02 15:04:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1138. [2023-12-02 15:04:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 843 states have (on average 1.206405693950178) internal successors, (1017), 857 states have internal predecessors, (1017), 178 states have call successors, (178), 116 states have call predecessors, (178), 116 states have return successors, (178), 164 states have call predecessors, (178), 178 states have call successors, (178) [2023-12-02 15:04:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1373 transitions. [2023-12-02 15:04:33,764 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1373 transitions. Word has length 142 [2023-12-02 15:04:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:33,764 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1373 transitions. [2023-12-02 15:04:33,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 44 states have internal predecessors, (185), 18 states have call successors, (50), 5 states have call predecessors, (50), 17 states have return successors, (49), 24 states have call predecessors, (49), 18 states have call successors, (49) [2023-12-02 15:04:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1373 transitions. [2023-12-02 15:04:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-02 15:04:33,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:33,766 INFO L195 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] [2023-12-02 15:04:33,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 15:04:33,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:33,966 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:04:33,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2054384972, now seen corresponding path program 1 times [2023-12-02 15:04:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:04:33,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013312265] [2023-12-02 15:04:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:04:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:04:34,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:04:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013312265] [2023-12-02 15:04:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013312265] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240652078] [2023-12-02 15:04:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:34,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:34,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:04:34,246 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:04:34,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 15:04:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:34,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 15:04:34,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 15:04:34,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:04:35,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240652078] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1775450295] [2023-12-02 15:04:35,501 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2023-12-02 15:04:35,501 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:04:35,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:04:35,502 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:04:35,502 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:05:06,017 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 14 for LOIs [2023-12-02 15:05:06,030 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 20 for LOIs [2023-12-02 15:05:06,032 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 26 for LOIs [2023-12-02 15:05:06,052 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 58 for LOIs [2023-12-02 15:05:06,152 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 25 for LOIs [2023-12-02 15:05:06,160 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 49 for LOIs [2023-12-02 15:05:06,194 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:05:39,163 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '82107#(and (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_398| Int) (|v_ULTIMATE.start_check_#res#1_BEFORE_CALL_23| Int)) (and (<= 0 (+ ~manual_selection_History_0~0 128)) (<= ~manual_selection_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (= |v_ULTIMATE.start_check_#res#1_BEFORE_CALL_23| 0) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (= ~side2_written~0 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_398| 0) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))) (= assert_~arg |assert_#in~arg|))' at error location [2023-12-02 15:05:39,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:05:39,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:05:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2023-12-02 15:05:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872918370] [2023-12-02 15:05:39,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:05:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 15:05:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 15:05:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=7179, Unknown=8, NotChecked=0, Total=7656 [2023-12-02 15:05:39,166 INFO L87 Difference]: Start difference. First operand 1138 states and 1373 transitions. Second operand has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2023-12-02 15:05:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:42,874 INFO L93 Difference]: Finished difference Result 2872 states and 3508 transitions. [2023-12-02 15:05:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 15:05:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) Word has length 143 [2023-12-02 15:05:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:42,885 INFO L225 Difference]: With dead ends: 2872 [2023-12-02 15:05:42,886 INFO L226 Difference]: Without dead ends: 2007 [2023-12-02 15:05:42,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6539 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=1406, Invalid=15878, Unknown=8, NotChecked=0, Total=17292 [2023-12-02 15:05:42,890 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 1486 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:42,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1886 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 15:05:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2023-12-02 15:05:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1784. [2023-12-02 15:05:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1326 states have (on average 1.205128205128205) internal successors, (1598), 1340 states have internal predecessors, (1598), 275 states have call successors, (275), 182 states have call predecessors, (275), 182 states have return successors, (275), 261 states have call predecessors, (275), 275 states have call successors, (275) [2023-12-02 15:05:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2148 transitions. [2023-12-02 15:05:43,250 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2148 transitions. Word has length 143 [2023-12-02 15:05:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:43,250 INFO L495 AbstractCegarLoop]: Abstraction has 1784 states and 2148 transitions. [2023-12-02 15:05:43,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.19047619047619) internal successors, (193), 21 states have internal predecessors, (193), 9 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (45), 9 states have call predecessors, (45), 9 states have call successors, (45) [2023-12-02 15:05:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2148 transitions. [2023-12-02 15:05:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 15:05:43,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:43,252 INFO L195 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] [2023-12-02 15:05:43,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 15:05:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-02 15:05:43,453 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:05:43,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1052273605, now seen corresponding path program 1 times [2023-12-02 15:05:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125109433] [2023-12-02 15:05:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-12-02 15:05:43,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:43,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125109433] [2023-12-02 15:05:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125109433] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:05:43,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:05:43,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:05:43,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522829865] [2023-12-02 15:05:43,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:05:43,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:05:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:05:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:05:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:05:43,599 INFO L87 Difference]: Start difference. First operand 1784 states and 2148 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) [2023-12-02 15:05:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:44,754 INFO L93 Difference]: Finished difference Result 5546 states and 7030 transitions. [2023-12-02 15:05:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:05:44,755 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 [2023-12-02 15:05:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:44,769 INFO L225 Difference]: With dead ends: 5546 [2023-12-02 15:05:44,769 INFO L226 Difference]: Without dead ends: 4010 [2023-12-02 15:05:44,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:05:44,772 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 281 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:44,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1917 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:05:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2023-12-02 15:05:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 2864. [2023-12-02 15:05:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2110 states have (on average 1.2009478672985783) internal successors, (2534), 2134 states have internal predecessors, (2534), 461 states have call successors, (461), 292 states have call predecessors, (461), 292 states have return successors, (461), 437 states have call predecessors, (461), 461 states have call successors, (461) [2023-12-02 15:05:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3456 transitions. [2023-12-02 15:05:45,386 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3456 transitions. Word has length 144 [2023-12-02 15:05:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:45,386 INFO L495 AbstractCegarLoop]: Abstraction has 2864 states and 3456 transitions. [2023-12-02 15:05:45,386 INFO L496 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) [2023-12-02 15:05:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3456 transitions. [2023-12-02 15:05:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 15:05:45,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:45,389 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:05:45,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 15:05:45,389 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:05:45,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2092921536, now seen corresponding path program 1 times [2023-12-02 15:05:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:05:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742735881] [2023-12-02 15:05:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:05:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:05:45,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:05:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742735881] [2023-12-02 15:05:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742735881] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147097509] [2023-12-02 15:05:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:05:45,769 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:05:45,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 15:05:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:45,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 15:05:45,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 59 proven. 18 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 15:05:46,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:05:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147097509] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:05:46,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [410757735] [2023-12-02 15:05:46,648 INFO L159 IcfgInterpreter]: Started Sifa with 80 locations of interest [2023-12-02 15:05:46,648 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:05:46,648 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:05:46,649 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:05:46,649 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:06:08,230 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 6 for LOIs [2023-12-02 15:06:08,240 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2023-12-02 15:06:08,241 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 61 for LOIs [2023-12-02 15:06:08,354 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 52 for LOIs [2023-12-02 15:06:08,429 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 19 for LOIs [2023-12-02 15:06:08,434 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 43 for LOIs [2023-12-02 15:06:08,465 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:07:04,327 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '99704#(and (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_427| Int) (|v_ULTIMATE.start_check_#res#1_BEFORE_CALL_41| Int)) (and (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (= |v_ULTIMATE.start_check_#res#1_BEFORE_CALL_41| 0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_427| 0) (<= ~active_side_History_1~0 127) (<= 0 ~active_side_History_0~0) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~active_side_History_0~0 2) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)))) (= assert_~arg |assert_#in~arg|))' at error location [2023-12-02 15:07:04,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:07:04,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:07:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 23 [2023-12-02 15:07:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986844216] [2023-12-02 15:07:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:07:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 15:07:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:07:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 15:07:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=8041, Unknown=13, NotChecked=0, Total=8556 [2023-12-02 15:07:04,330 INFO L87 Difference]: Start difference. First operand 2864 states and 3456 transitions. Second operand has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2023-12-02 15:07:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:07:06,860 INFO L93 Difference]: Finished difference Result 6610 states and 8030 transitions. [2023-12-02 15:07:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 15:07:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) Word has length 146 [2023-12-02 15:07:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:07:06,870 INFO L225 Difference]: With dead ends: 6610 [2023-12-02 15:07:06,870 INFO L226 Difference]: Without dead ends: 3994 [2023-12-02 15:07:06,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6031 ImplicationChecksByTransitivity, 56.7s TimeCoverageRelationStatistics Valid=990, Invalid=14999, Unknown=13, NotChecked=0, Total=16002 [2023-12-02 15:07:06,875 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 796 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:07:06,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2123 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:07:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2023-12-02 15:07:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3933. [2023-12-02 15:07:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 2921 states have (on average 1.2084902430674427) internal successors, (3530), 2951 states have internal predecessors, (3530), 611 states have call successors, (611), 400 states have call predecessors, (611), 400 states have return successors, (611), 581 states have call predecessors, (611), 611 states have call successors, (611) [2023-12-02 15:07:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 4752 transitions. [2023-12-02 15:07:07,677 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 4752 transitions. Word has length 146 [2023-12-02 15:07:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:07:07,678 INFO L495 AbstractCegarLoop]: Abstraction has 3933 states and 4752 transitions. [2023-12-02 15:07:07,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 23 states have internal predecessors, (178), 9 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (36), 9 states have call predecessors, (36), 9 states have call successors, (36) [2023-12-02 15:07:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 4752 transitions. [2023-12-02 15:07:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 15:07:07,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:07:07,682 INFO L195 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] [2023-12-02 15:07:07,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-02 15:07:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 15:07:07,883 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:07:07,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:07:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1356667632, now seen corresponding path program 1 times [2023-12-02 15:07:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:07:07,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937585531] [2023-12-02 15:07:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:07:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:07:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:07:08,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:07:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937585531] [2023-12-02 15:07:08,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937585531] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:07:08,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893625445] [2023-12-02 15:07:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:08,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:07:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:07:08,712 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:07:08,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 15:07:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:07:08,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 15:07:08,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:07:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 15:07:09,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:07:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-02 15:07:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893625445] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:07:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1283603295] [2023-12-02 15:07:11,237 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2023-12-02 15:07:11,237 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:07:11,237 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:07:11,237 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:07:11,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:07:59,223 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 19 for LOIs [2023-12-02 15:07:59,239 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 16 for LOIs [2023-12-02 15:07:59,240 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 24 for LOIs [2023-12-02 15:07:59,257 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 61 for LOIs [2023-12-02 15:07:59,360 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 23 for LOIs [2023-12-02 15:07:59,367 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 71 for LOIs [2023-12-02 15:07:59,540 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:08:10,767 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '114030#(and (= assert_~arg |assert_#in~arg|) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_537| Int) (|v_ULTIMATE.start_check_#res#1_BEFORE_CALL_55| Int)) (and (<= 0 (+ ~manual_selection_History_0~0 128)) (= |v_ULTIMATE.start_check_#res#1_BEFORE_CALL_55| 0) (<= ~active_side_History_0~0 127) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_537| 0) (<= ~manual_selection_History_0~0 127) (= |assert_#in~arg| 0) (<= 0 (+ ~manual_selection_History_2~0 128)) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (<= ~manual_selection_History_2~0 127) (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)))))' at error location [2023-12-02 15:08:10,767 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:08:10,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:08:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 17] total 32 [2023-12-02 15:08:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702322229] [2023-12-02 15:08:10,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:08:10,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 15:08:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:08:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 15:08:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=8965, Unknown=0, NotChecked=0, Total=9506 [2023-12-02 15:08:10,770 INFO L87 Difference]: Start difference. First operand 3933 states and 4752 transitions. Second operand has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 11 states have call successors, (52), 5 states have call predecessors, (52), 6 states have return successors, (51), 12 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-02 15:08:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:33,938 INFO L93 Difference]: Finished difference Result 11744 states and 14777 transitions. [2023-12-02 15:08:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2023-12-02 15:08:33,939 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 11 states have call successors, (52), 5 states have call predecessors, (52), 6 states have return successors, (51), 12 states have call predecessors, (51), 11 states have call successors, (51) Word has length 146 [2023-12-02 15:08:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:33,958 INFO L225 Difference]: With dead ends: 11744 [2023-12-02 15:08:33,958 INFO L226 Difference]: Without dead ends: 8090 [2023-12-02 15:08:33,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34897 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=5289, Invalid=81441, Unknown=0, NotChecked=0, Total=86730 [2023-12-02 15:08:33,968 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 2658 mSDsluCounter, 5469 mSDsCounter, 0 mSdLazyCounter, 4761 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 5866 SdHoareTripleChecker+Invalid, 5774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 4761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:33,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 5866 Invalid, 5774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 4761 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-02 15:08:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2023-12-02 15:08:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 4670. [2023-12-02 15:08:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 3466 states have (on average 1.2054241200230813) internal successors, (4178), 3502 states have internal predecessors, (4178), 729 states have call successors, (729), 474 states have call predecessors, (729), 474 states have return successors, (729), 693 states have call predecessors, (729), 729 states have call successors, (729) [2023-12-02 15:08:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 5636 transitions. [2023-12-02 15:08:35,087 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 5636 transitions. Word has length 146 [2023-12-02 15:08:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:35,087 INFO L495 AbstractCegarLoop]: Abstraction has 4670 states and 5636 transitions. [2023-12-02 15:08:35,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.5) internal successors, (208), 31 states have internal predecessors, (208), 11 states have call successors, (52), 5 states have call predecessors, (52), 6 states have return successors, (51), 12 states have call predecessors, (51), 11 states have call successors, (51) [2023-12-02 15:08:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 5636 transitions. [2023-12-02 15:08:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 15:08:35,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:35,091 INFO L195 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, 1, 1, 1, 1] [2023-12-02 15:08:35,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 15:08:35,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-02 15:08:35,291 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:08:35,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1185789942, now seen corresponding path program 1 times [2023-12-02 15:08:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:08:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543929242] [2023-12-02 15:08:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:08:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:08:35,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:08:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543929242] [2023-12-02 15:08:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543929242] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060872023] [2023-12-02 15:08:35,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:35,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:08:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:08:35,497 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:08:35,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 15:08:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:35,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 15:08:35,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 60 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 15:08:36,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-02 15:08:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060872023] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:08:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1500202685] [2023-12-02 15:08:36,504 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2023-12-02 15:08:36,504 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:08:36,504 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:08:36,504 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:08:36,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:09:32,455 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 6 for LOIs [2023-12-02 15:09:32,464 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2023-12-02 15:09:32,465 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 15 for LOIs [2023-12-02 15:09:32,475 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 49 for LOIs [2023-12-02 15:09:32,531 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 11 for LOIs [2023-12-02 15:09:32,535 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 95 for LOIs [2023-12-02 15:09:33,020 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:09:46,179 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '136149#(and (= assert_~arg |assert_#in~arg|) (exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_621| Int) (|v_ULTIMATE.start_check_#res#1_BEFORE_CALL_68| Int)) (and (= |v_ULTIMATE.start_check_#res#1_BEFORE_CALL_68| 0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= (mod ~side2Failed_History_1~0 256) 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_621| 0))))' at error location [2023-12-02 15:09:46,179 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:09:46,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:09:46,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2023-12-02 15:09:46,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046671635] [2023-12-02 15:09:46,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:09:46,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 15:09:46,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:46,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 15:09:46,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=7745, Unknown=0, NotChecked=0, Total=8190 [2023-12-02 15:09:46,182 INFO L87 Difference]: Start difference. First operand 4670 states and 5636 transitions. Second operand has 21 states, 21 states have (on average 9.761904761904763) internal successors, (205), 21 states have internal predecessors, (205), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2023-12-02 15:09:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:48,615 INFO L93 Difference]: Finished difference Result 9380 states and 11386 transitions. [2023-12-02 15:09:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 15:09:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.761904761904763) internal successors, (205), 21 states have internal predecessors, (205), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 149 [2023-12-02 15:09:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:09:48,630 INFO L225 Difference]: With dead ends: 9380 [2023-12-02 15:09:48,630 INFO L226 Difference]: Without dead ends: 4989 [2023-12-02 15:09:48,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4743 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=820, Invalid=11170, Unknown=0, NotChecked=0, Total=11990 [2023-12-02 15:09:48,639 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 1605 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:09:48,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 1265 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 15:09:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2023-12-02 15:09:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 4522. [2023-12-02 15:09:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4522 states, 3366 states have (on average 1.2073677956030897) internal successors, (4064), 3400 states have internal predecessors, (4064), 698 states have call successors, (698), 457 states have call predecessors, (698), 457 states have return successors, (698), 664 states have call predecessors, (698), 698 states have call successors, (698) [2023-12-02 15:09:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 5460 transitions. [2023-12-02 15:09:49,712 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 5460 transitions. Word has length 149 [2023-12-02 15:09:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:09:49,713 INFO L495 AbstractCegarLoop]: Abstraction has 4522 states and 5460 transitions. [2023-12-02 15:09:49,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.761904761904763) internal successors, (205), 21 states have internal predecessors, (205), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2023-12-02 15:09:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 5460 transitions. [2023-12-02 15:09:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-02 15:09:49,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:49,716 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:09:49,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 15:09:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-02 15:09:49,917 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:09:49,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash -190761180, now seen corresponding path program 1 times [2023-12-02 15:09:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523543254] [2023-12-02 15:09:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-02 15:09:50,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523543254] [2023-12-02 15:09:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523543254] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:09:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666270451] [2023-12-02 15:09:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:09:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:09:50,528 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:09:50,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 15:09:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:50,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:09:50,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:09:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 31 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 15:09:50,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:09:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 15:09:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666270451] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:09:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1025298192] [2023-12-02 15:09:51,024 INFO L159 IcfgInterpreter]: Started Sifa with 80 locations of interest [2023-12-02 15:09:51,024 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:09:51,024 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:09:51,024 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:09:51,025 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:10:01,916 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 132 for LOIs [2023-12-02 15:10:02,075 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 111 for LOIs [2023-12-02 15:10:02,089 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 112 for LOIs [2023-12-02 15:10:02,681 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 139 for LOIs [2023-12-02 15:10:02,991 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 97 for LOIs [2023-12-02 15:10:03,056 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:10:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1025298192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:10:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [9, 8, 8] total 64 [2023-12-02 15:10:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607354242] [2023-12-02 15:10:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:18,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-02 15:10:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-02 15:10:18,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=3523, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 15:10:18,488 INFO L87 Difference]: Start difference. First operand 4522 states and 5460 transitions. Second operand has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 33 states have internal predecessors, (65), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-12-02 15:10:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:25,658 INFO L93 Difference]: Finished difference Result 8800 states and 10660 transitions. [2023-12-02 15:10:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 15:10:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 33 states have internal predecessors, (65), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) Word has length 151 [2023-12-02 15:10:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:25,671 INFO L225 Difference]: With dead ends: 8800 [2023-12-02 15:10:25,671 INFO L226 Difference]: Without dead ends: 4510 [2023-12-02 15:10:25,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 393 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=551, Invalid=4005, Unknown=0, NotChecked=0, Total=4556 [2023-12-02 15:10:25,679 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 48 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4367 SdHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:25,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4367 Invalid, 3492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-02 15:10:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2023-12-02 15:10:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4502. [2023-12-02 15:10:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 3352 states have (on average 1.20763723150358) internal successors, (4048), 3385 states have internal predecessors, (4048), 694 states have call successors, (694), 455 states have call predecessors, (694), 455 states have return successors, (694), 661 states have call predecessors, (694), 694 states have call successors, (694) [2023-12-02 15:10:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 5436 transitions. [2023-12-02 15:10:26,696 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 5436 transitions. Word has length 151 [2023-12-02 15:10:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:26,697 INFO L495 AbstractCegarLoop]: Abstraction has 4502 states and 5436 transitions. [2023-12-02 15:10:26,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 33 states have internal predecessors, (65), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-12-02 15:10:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 5436 transitions. [2023-12-02 15:10:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-02 15:10:26,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:26,700 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:26,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 15:10:26,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 15:10:26,901 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:10:26,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1953381559, now seen corresponding path program 1 times [2023-12-02 15:10:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:26,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006338158] [2023-12-02 15:10:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2023-12-02 15:10:28,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006338158] [2023-12-02 15:10:28,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006338158] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:10:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047739183] [2023-12-02 15:10:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:28,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:10:28,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:10:28,120 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:10:28,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 15:10:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:28,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:10:28,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:10:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 31 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 15:10:28,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:10:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 15:10:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047739183] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:10:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546050273] [2023-12-02 15:10:28,723 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2023-12-02 15:10:28,723 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:10:28,723 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:10:28,723 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:10:28,724 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:10:40,266 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 94 for LOIs [2023-12-02 15:10:40,312 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 111 for LOIs [2023-12-02 15:10:40,326 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 116 for LOIs [2023-12-02 15:10:40,950 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 143 for LOIs [2023-12-02 15:10:41,242 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 101 for LOIs [2023-12-02 15:10:41,308 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:10:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [546050273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:10:59,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [10, 8, 8] total 67 [2023-12-02 15:10:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971504440] [2023-12-02 15:10:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 15:10:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 15:10:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=3887, Unknown=0, NotChecked=0, Total=4422 [2023-12-02 15:10:59,042 INFO L87 Difference]: Start difference. First operand 4502 states and 5436 transitions. Second operand has 51 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 35 states have internal predecessors, (68), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-12-02 15:11:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:11:04,640 INFO L93 Difference]: Finished difference Result 8788 states and 10644 transitions. [2023-12-02 15:11:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-02 15:11:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 35 states have internal predecessors, (68), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) Word has length 153 [2023-12-02 15:11:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:11:04,651 INFO L225 Difference]: With dead ends: 8788 [2023-12-02 15:11:04,651 INFO L226 Difference]: Without dead ends: 4498 [2023-12-02 15:11:04,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 397 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=556, Invalid=4136, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 15:11:04,657 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 86 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:11:04,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2904 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 15:11:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2023-12-02 15:11:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 4482. [2023-12-02 15:11:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 3338 states have (on average 1.2079089275014978) internal successors, (4032), 3370 states have internal predecessors, (4032), 690 states have call successors, (690), 453 states have call predecessors, (690), 453 states have return successors, (690), 658 states have call predecessors, (690), 690 states have call successors, (690) [2023-12-02 15:11:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 5412 transitions. [2023-12-02 15:11:05,669 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 5412 transitions. Word has length 153 [2023-12-02 15:11:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:11:05,669 INFO L495 AbstractCegarLoop]: Abstraction has 4482 states and 5412 transitions. [2023-12-02 15:11:05,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 35 states have internal predecessors, (68), 11 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2023-12-02 15:11:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 5412 transitions. [2023-12-02 15:11:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-02 15:11:05,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:11:05,673 INFO L195 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] [2023-12-02 15:11:05,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 15:11:05,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-02 15:11:05,874 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:11:05,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:11:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash -712201189, now seen corresponding path program 1 times [2023-12-02 15:11:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:11:05,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488035935] [2023-12-02 15:11:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:11:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:11:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:11:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:11:06,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:11:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488035935] [2023-12-02 15:11:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488035935] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:11:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029503956] [2023-12-02 15:11:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:11:06,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:11:06,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:11:06,135 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:11:06,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 15:11:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:11:06,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:11:06,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:11:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 56 proven. 54 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 15:11:06,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:11:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 19 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 15:11:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029503956] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:11:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058193871] [2023-12-02 15:11:06,701 INFO L159 IcfgInterpreter]: Started Sifa with 76 locations of interest [2023-12-02 15:11:06,701 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:11:06,701 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:11:06,701 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:11:06,701 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:11:14,599 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 15:11:14,606 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 15:11:16,664 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 15:11:16,671 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-12-02 15:11:19,611 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 14 for LOIs [2023-12-02 15:11:19,625 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 12 for LOIs [2023-12-02 15:11:19,626 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 18 for LOIs [2023-12-02 15:11:19,641 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 85 for LOIs [2023-12-02 15:11:19,811 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 21 for LOIs [2023-12-02 15:11:19,818 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 65 for LOIs [2023-12-02 15:11:19,985 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:11:32,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '190028#(and (= assert_~arg |assert_#in~arg|) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_110| Int) (|v_ULTIMATE.start_check_~tmp___0~0#1_106| Int) (|v_ULTIMATE.start_check_~tmp___11~0#1_87| Int) (|v_ULTIMATE.start_main_~c1~0#1_63| Int) (|v_ULTIMATE.start_check_~tmp~3#1_92| Int) (|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_827| Int) (|v_ULTIMATE.start_check_~tmp___12~0#1_85| Int) (|v_ULTIMATE.start_check_~tmp___9~0#1_61| Int)) (and (<= 0 (+ |v_ULTIMATE.start_check_~tmp___9~0#1_61| 128)) (<= 0 (+ |v_ULTIMATE.start_main_~c1~0#1_63| 2147483648)) (<= |v_ULTIMATE.start_check_~tmp___0~0#1_106| 127) (<= 0 (+ ~manual_selection_History_0~0 128)) (= 0 (mod |v_ULTIMATE.start_check_~tmp___7~0#1_110| 256)) (= |v_ULTIMATE.start_check_~tmp~3#1_92| 1) (= ~side1Failed_History_1~0 |v_ULTIMATE.start_check_~tmp___11~0#1_87|) (<= ~active_side_History_0~0 127) (<= ~manual_selection_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_827| 0) (not (= |v_ULTIMATE.start_check_~tmp___9~0#1_61| 1)) (not (= (mod |v_ULTIMATE.start_check_~tmp___12~0#1_85| 256) 0)) (= ~side2_written~0 0) (= ~active_side_History_0~0 |v_ULTIMATE.start_check_~tmp___9~0#1_61|) (= ~side1Failed_History_1~0 |v_ULTIMATE.start_check_~tmp___7~0#1_110|) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___0~0#1_106| 128)) (<= 0 (+ ~manual_selection_History_1~0 128)) (= |v_ULTIMATE.start_check_~tmp___12~0#1_85| ~side2Failed_History_1~0))))' at error location [2023-12-02 15:11:32,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:11:32,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:11:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2023-12-02 15:11:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478380688] [2023-12-02 15:11:32,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:11:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:11:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:11:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:11:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=5586, Unknown=0, NotChecked=0, Total=6006 [2023-12-02 15:11:32,974 INFO L87 Difference]: Start difference. First operand 4482 states and 5412 transitions. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 11 states have internal predecessors, (147), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2023-12-02 15:11:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:11:36,306 INFO L93 Difference]: Finished difference Result 13073 states and 16260 transitions. [2023-12-02 15:11:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 15:11:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 11 states have internal predecessors, (147), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 156 [2023-12-02 15:11:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:11:36,324 INFO L225 Difference]: With dead ends: 13073 [2023-12-02 15:11:36,324 INFO L226 Difference]: Without dead ends: 8830 [2023-12-02 15:11:36,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 393 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2729 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=546, Invalid=7826, Unknown=0, NotChecked=0, Total=8372 [2023-12-02 15:11:36,331 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 1124 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:11:36,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1893 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 15:11:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2023-12-02 15:11:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 7650. [2023-12-02 15:11:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 5644 states have (on average 1.1968462083628633) internal successors, (6755), 5706 states have internal predecessors, (6755), 1229 states have call successors, (1229), 776 states have call predecessors, (1229), 776 states have return successors, (1229), 1167 states have call predecessors, (1229), 1229 states have call successors, (1229) [2023-12-02 15:11:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 9213 transitions. [2023-12-02 15:11:38,189 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 9213 transitions. Word has length 156 [2023-12-02 15:11:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:11:38,189 INFO L495 AbstractCegarLoop]: Abstraction has 7650 states and 9213 transitions. [2023-12-02 15:11:38,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 11 states have internal predecessors, (147), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2023-12-02 15:11:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 9213 transitions. [2023-12-02 15:11:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-02 15:11:38,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:11:38,193 INFO L195 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] [2023-12-02 15:11:38,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 15:11:38,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-02 15:11:38,393 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:11:38,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:11:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1299584486, now seen corresponding path program 1 times [2023-12-02 15:11:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:11:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961980389] [2023-12-02 15:11:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:11:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:11:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:11:38,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:11:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:11:38,553 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:11:38,554 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:11:38,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:11:38,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-02 15:11:38,558 INFO L445 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, 1, 1, 1, 1] [2023-12-02 15:11:38,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:11:38,639 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 15:11:38,647 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:11:38,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:11:38,651 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-12-02 15:11:38,653 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-12-02 15:11:38,654 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated [2023-12-02 15:11:38,655 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-12-02 15:11:38,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-12-02 15:11:38,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 15:11:38,662 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:11:38,662 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-12-02 15:11:38,663 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-12-02 15:11:38,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-12-02 15:11:38,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated [2023-12-02 15:11:38,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:11:38 BoogieIcfgContainer [2023-12-02 15:11:38,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:11:38,700 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:11:38,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:11:38,700 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:11:38,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:59:33" (3/4) ... [2023-12-02 15:11:38,701 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 15:11:38,731 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 15:11:38,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:11:38,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:11:38,735 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-12-02 15:11:38,736 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-12-02 15:11:38,736 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated [2023-12-02 15:11:38,737 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-12-02 15:11:38,738 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-12-02 15:11:38,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 15:11:38,742 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:11:38,742 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-12-02 15:11:38,743 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-12-02 15:11:38,743 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-12-02 15:11:38,744 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated [2023-12-02 15:11:38,841 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:11:38,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:11:38,841 INFO L158 Benchmark]: Toolchain (without parser) took 726353.97ms. Allocated memory was 125.8MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 95.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 417.8MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,841 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 86.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:11:38,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.23ms. Allocated memory is still 125.8MB. Free memory was 95.4MB in the beginning and 77.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 125.8MB. Free memory was 77.6MB in the beginning and 73.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,842 INFO L158 Benchmark]: Boogie Preprocessor took 40.52ms. Allocated memory is still 125.8MB. Free memory was 73.9MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,842 INFO L158 Benchmark]: RCFGBuilder took 802.92ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 71.1MB in the beginning and 77.2MB in the end (delta: -6.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,843 INFO L158 Benchmark]: TraceAbstraction took 724938.35ms. Allocated memory was 151.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 76.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 345.9MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,843 INFO L158 Benchmark]: Witness Printer took 140.61ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 15:11:38,844 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.19ms. Allocated memory is still 125.8MB. Free memory was 86.5MB in the beginning and 86.3MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.23ms. Allocated memory is still 125.8MB. Free memory was 95.4MB in the beginning and 77.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 125.8MB. Free memory was 77.6MB in the beginning and 73.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.52ms. Allocated memory is still 125.8MB. Free memory was 73.9MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 802.92ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 71.1MB in the beginning and 77.2MB in the end (delta: -6.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 724938.35ms. Allocated memory was 151.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 76.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 345.9MB. Max. memory is 16.1GB. * Witness Printer took 140.61ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, 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, c1=0, 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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, 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, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, 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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=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=-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, manual_selection=0, manual_selection_History_0=-1, 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_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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, 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, 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] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, 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=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] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-2, 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, manual_selection_History_0=-1, 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, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, 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, manual_selection_History_0=-1, 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, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, 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, manual_selection_History_0=-1, 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, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, 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, manual_selection_History_0=-1, 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, tmp=-2] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp=-2] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-255, active_side_History_0=0, 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, index=0, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0, tmp___2=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0, tmp___2=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___20=-2, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___20=-2, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, 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, arg=1, 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=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, 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] [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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, side2=0, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=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, side2=0, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, index=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp=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=-2, cs1_old=-1, cs2=0, cs2_new=-2, cs2_old=-1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp=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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=1, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, index=0, manual_selection_History_0=-2, manual_selection_History_1=-1, 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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___5=2, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [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=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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, arg=0, cs1=0, cs1_new=-1, cs1_old=-2, cs2=0, cs2_new=-1, cs2_old=-2, manual_selection_History_0=-2, manual_selection_History_1=-1, 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: 724.7s, OverallIterations: 39, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 104.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14476 SdHoareTripleChecker+Valid, 56.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14102 mSDsluCounter, 90505 SdHoareTripleChecker+Invalid, 51.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80264 mSDsCounter, 3767 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47150 IncrementalHoareTripleChecker+Invalid, 50917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3767 mSolverCounterUnsat, 10241 mSDtfsCounter, 47150 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7006 GetRequests, 5173 SyntacticMatches, 125 SemanticMatches, 1708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72444 ImplicationChecksByTransitivity, 340.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7650occurred in iteration=38, InterpolantAutomatonStates: 907, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 38 MinimizatonAttempts, 9792 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 5713 NumberOfCodeBlocks, 5713 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 7505 ConstructedInterpolants, 0 QuantifiedInterpolants, 31568 SizeOfPredicates, 146 NumberOfNonLiveVariables, 10278 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 76 InterpolantComputations, 20 PerfectInterpolantSequences, 3666/4161 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: OVERALL_TIME: 70.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 47, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 563, DAG_INTERPRETER_EARLY_EXITS: 25, TOOLS_POST_APPLICATIONS: 588, TOOLS_POST_TIME: 23.6s, TOOLS_POST_CALL_APPLICATIONS: 262, TOOLS_POST_CALL_TIME: 20.2s, TOOLS_POST_RETURN_APPLICATIONS: 196, TOOLS_POST_RETURN_TIME: 14.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1046, TOOLS_QUANTIFIERELIM_TIME: 57.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.9s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1428, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 251, DOMAIN_JOIN_TIME: 10.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 563, DOMAIN_ISBOTTOM_TIME: 0.9s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 5.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 196, CALL_SUMMARIZER_CACHE_MISSES: 38, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.6s, DAG_COMPRESSION_PROCESSED_NODES: 56892, DAG_COMPRESSION_RETAINED_NODES: 1763, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-02 15:11:38,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3637cad-a58d-4fa6-b0fa-5ce5940800ef/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE