./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:55:24,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:24,616 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:55:24,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:24,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:24,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:24,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:24,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:24,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:24,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:24,654 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:55:24,654 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:55:24,655 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:55:24,655 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:55:24,656 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:55:24,656 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:55:24,656 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:55:24,657 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:55:24,657 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:55:24,658 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:55:24,658 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:55:24,659 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:55:24,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:24,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:24,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:24,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:24,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:24,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:24,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:24,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:24,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:24,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:24,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:24,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:24,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:24,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:24,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:55:24,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:24,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:55:24,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:24,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:24,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:24,671 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:55:24,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:24,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:24,672 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:55:24,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:24,673 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_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2024-11-09 06:55:25,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:25,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:25,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:25,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:25,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:25,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c Unable to find full path for "g++" [2024-11-09 06:55:26,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:27,196 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:27,197 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-09 06:55:27,209 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/data/317570657/ad8be26c8f91479badd5f653963a995a/FLAGe38514e93 [2024-11-09 06:55:27,229 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/data/317570657/ad8be26c8f91479badd5f653963a995a [2024-11-09 06:55:27,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:27,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:27,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:27,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:27,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:27,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac0417f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27, skipping insertion in model container [2024-11-09 06:55:27,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:27,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2024-11-09 06:55:27,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:27,671 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:27,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2024-11-09 06:55:27,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:27,772 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:27,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27 WrapperNode [2024-11-09 06:55:27,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:27,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:27,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:27,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:27,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,836 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 509 [2024-11-09 06:55:27,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:27,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:27,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:27,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:27,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:27,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:27,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:27,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:27,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (1/1) ... [2024-11-09 06:55:27,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:55:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:55:27,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:55:27,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:55:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-09 06:55:27,976 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-09 06:55:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:27,978 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-09 06:55:27,979 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-09 06:55:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-09 06:55:27,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-09 06:55:27,979 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-09 06:55:27,979 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-09 06:55:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 06:55:27,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 06:55:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-09 06:55:27,980 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-09 06:55:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:27,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-09 06:55:27,981 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-09 06:55:28,136 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:28,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:55:28,877 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-09 06:55:28,877 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:55:29,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:55:29,120 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:55:29,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:29 BoogieIcfgContainer [2024-11-09 06:55:29,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:55:29,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:55:29,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:55:29,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:55:29,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:27" (1/3) ... [2024-11-09 06:55:29,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6140e099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:29, skipping insertion in model container [2024-11-09 06:55:29,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:27" (2/3) ... [2024-11-09 06:55:29,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6140e099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:29, skipping insertion in model container [2024-11-09 06:55:29,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:29" (3/3) ... [2024-11-09 06:55:29,130 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2024-11-09 06:55:29,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:55:29,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:55:29,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:29,230 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61378180, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:29,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:55:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 06:55:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:55:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:29,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:29,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:29,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:29,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1752048089, now seen corresponding path program 1 times [2024-11-09 06:55:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699396387] [2024-11-09 06:55:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:30,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699396387] [2024-11-09 06:55:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699396387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131495069] [2024-11-09 06:55:30,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:30,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:30,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:30,081 INFO L87 Difference]: Start difference. First operand has 152 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 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 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:55:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:30,242 INFO L93 Difference]: Finished difference Result 305 states and 495 transitions. [2024-11-09 06:55:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:30,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 20 [2024-11-09 06:55:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:30,260 INFO L225 Difference]: With dead ends: 305 [2024-11-09 06:55:30,261 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 06:55:30,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:30,274 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 3 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:30,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 647 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 06:55:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 06:55:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 114 states have (on average 1.5) internal successors, (171), 114 states have internal predecessors, (171), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 06:55:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 233 transitions. [2024-11-09 06:55:30,354 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 233 transitions. Word has length 20 [2024-11-09 06:55:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:30,355 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 233 transitions. [2024-11-09 06:55:30,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 06:55:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 233 transitions. [2024-11-09 06:55:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:55:30,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:30,361 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:55:30,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 442668756, now seen corresponding path program 1 times [2024-11-09 06:55:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537717245] [2024-11-09 06:55:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:30,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:30,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537717245] [2024-11-09 06:55:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537717245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:30,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:30,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255361293] [2024-11-09 06:55:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:55:30,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:55:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:30,640 INFO L87 Difference]: Start difference. First operand 154 states and 233 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:55:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:30,931 INFO L93 Difference]: Finished difference Result 342 states and 517 transitions. [2024-11-09 06:55:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:55:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2024-11-09 06:55:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:30,938 INFO L225 Difference]: With dead ends: 342 [2024-11-09 06:55:30,938 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 06:55:30,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:55:30,944 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 327 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:30,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 578 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:55:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 06:55:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-11-09 06:55:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.5) internal successors, (216), 144 states have internal predecessors, (216), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2024-11-09 06:55:30,985 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 31 [2024-11-09 06:55:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2024-11-09 06:55:30,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:55:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2024-11-09 06:55:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:55:30,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:30,988 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:55:30,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1862373543, now seen corresponding path program 1 times [2024-11-09 06:55:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842156848] [2024-11-09 06:55:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:31,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842156848] [2024-11-09 06:55:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842156848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:31,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461485918] [2024-11-09 06:55:31,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:31,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:55:31,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:31,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:55:31,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:31,201 INFO L87 Difference]: Start difference. First operand 189 states and 284 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:55:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:31,445 INFO L93 Difference]: Finished difference Result 341 states and 514 transitions. [2024-11-09 06:55:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:55:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 32 [2024-11-09 06:55:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:31,451 INFO L225 Difference]: With dead ends: 341 [2024-11-09 06:55:31,451 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 06:55:31,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:55:31,457 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 322 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:31,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 581 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:55:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 06:55:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2024-11-09 06:55:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 144 states have internal predecessors, (215), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 283 transitions. [2024-11-09 06:55:31,488 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 283 transitions. Word has length 32 [2024-11-09 06:55:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 283 transitions. [2024-11-09 06:55:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:55:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 283 transitions. [2024-11-09 06:55:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:55:31,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:31,490 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:55:31,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:31,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1200982907, now seen corresponding path program 1 times [2024-11-09 06:55:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744220933] [2024-11-09 06:55:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:31,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:31,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744220933] [2024-11-09 06:55:31,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744220933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483411682] [2024-11-09 06:55:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:31,801 INFO L87 Difference]: Start difference. First operand 189 states and 283 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:55:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:31,887 INFO L93 Difference]: Finished difference Result 345 states and 519 transitions. [2024-11-09 06:55:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 34 [2024-11-09 06:55:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:31,890 INFO L225 Difference]: With dead ends: 345 [2024-11-09 06:55:31,890 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 06:55:31,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:31,892 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 4 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:31,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 653 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 06:55:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-09 06:55:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.4797297297297298) internal successors, (219), 148 states have internal predecessors, (219), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2024-11-09 06:55:31,923 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 34 [2024-11-09 06:55:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:31,924 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2024-11-09 06:55:31,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:55:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2024-11-09 06:55:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 06:55:31,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:31,927 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:55:31,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1751966987, now seen corresponding path program 1 times [2024-11-09 06:55:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790462013] [2024-11-09 06:55:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:32,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790462013] [2024-11-09 06:55:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790462013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835897196] [2024-11-09 06:55:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:32,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:32,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:32,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:32,214 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:55:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:32,313 INFO L93 Difference]: Finished difference Result 355 states and 530 transitions. [2024-11-09 06:55:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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 42 [2024-11-09 06:55:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:32,316 INFO L225 Difference]: With dead ends: 355 [2024-11-09 06:55:32,319 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 06:55:32,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:32,320 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:32,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 639 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 06:55:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-09 06:55:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-11-09 06:55:32,345 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 42 [2024-11-09 06:55:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:32,345 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-11-09 06:55:32,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:55:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-09 06:55:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:55:32,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:32,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:55:32,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:32,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1239266869, now seen corresponding path program 1 times [2024-11-09 06:55:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119393309] [2024-11-09 06:55:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:32,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119393309] [2024-11-09 06:55:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119393309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663553698] [2024-11-09 06:55:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:32,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:32,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:32,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:32,588 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:55:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:32,688 INFO L93 Difference]: Finished difference Result 364 states and 534 transitions. [2024-11-09 06:55:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:32,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 50 [2024-11-09 06:55:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:32,692 INFO L225 Difference]: With dead ends: 364 [2024-11-09 06:55:32,692 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 06:55:32,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:32,694 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 3 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:32,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 649 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 06:55:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-09 06:55:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 294 transitions. [2024-11-09 06:55:32,721 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 294 transitions. Word has length 50 [2024-11-09 06:55:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:32,722 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 294 transitions. [2024-11-09 06:55:32,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:55:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 294 transitions. [2024-11-09 06:55:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:55:32,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:32,725 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:32,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:32,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:32,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash -659241124, now seen corresponding path program 1 times [2024-11-09 06:55:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:32,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313763361] [2024-11-09 06:55:32,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:32,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:55:32,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313763361] [2024-11-09 06:55:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313763361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820856465] [2024-11-09 06:55:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:32,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:32,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:32,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:32,940 INFO L87 Difference]: Start difference. First operand 203 states and 294 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:55:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:33,068 INFO L93 Difference]: Finished difference Result 373 states and 544 transitions. [2024-11-09 06:55:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 50 [2024-11-09 06:55:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:33,071 INFO L225 Difference]: With dead ends: 373 [2024-11-09 06:55:33,071 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 06:55:33,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:33,075 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:33,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 639 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 06:55:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-09 06:55:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 159 states have (on average 1.4465408805031446) internal successors, (230), 159 states have internal predecessors, (230), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 298 transitions. [2024-11-09 06:55:33,100 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 298 transitions. Word has length 50 [2024-11-09 06:55:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:33,102 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 298 transitions. [2024-11-09 06:55:33,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 06:55:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 298 transitions. [2024-11-09 06:55:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 06:55:33,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:33,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:33,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:33,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 825988956, now seen corresponding path program 1 times [2024-11-09 06:55:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:33,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871075718] [2024-11-09 06:55:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 06:55:33,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871075718] [2024-11-09 06:55:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871075718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:55:33,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115586730] [2024-11-09 06:55:33,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:33,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:55:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:33,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:55:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:55:33,428 INFO L87 Difference]: Start difference. First operand 208 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 06:55:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:33,512 INFO L93 Difference]: Finished difference Result 384 states and 551 transitions. [2024-11-09 06:55:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:55:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 58 [2024-11-09 06:55:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:33,515 INFO L225 Difference]: With dead ends: 384 [2024-11-09 06:55:33,515 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 06:55:33,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:55:33,517 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 5 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:33,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 651 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:55:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 06:55:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-09 06:55:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 164 states have (on average 1.4329268292682926) internal successors, (235), 164 states have internal predecessors, (235), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-09 06:55:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 303 transitions. [2024-11-09 06:55:33,532 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 303 transitions. Word has length 58 [2024-11-09 06:55:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:33,532 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 303 transitions. [2024-11-09 06:55:33,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 06:55:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 303 transitions. [2024-11-09 06:55:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:55:33,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:33,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:33,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:55:33,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:33,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -306906133, now seen corresponding path program 1 times [2024-11-09 06:55:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092967141] [2024-11-09 06:55:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:55:34,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:34,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092967141] [2024-11-09 06:55:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092967141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076095343] [2024-11-09 06:55:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:34,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:55:34,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:34,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:55:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:34,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:55:34,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:34,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:55:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076095343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:55:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-09 06:55:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892488137] [2024-11-09 06:55:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:34,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:55:34,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:34,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:55:34,517 INFO L87 Difference]: Start difference. First operand 214 states and 303 transitions. Second operand has 6 states, 4 states have (on average 11.5) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:55:34,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:55:34,812 INFO L93 Difference]: Finished difference Result 605 states and 843 transitions. [2024-11-09 06:55:34,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:55:34,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 6 states have internal predecessors, (46), 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 61 [2024-11-09 06:55:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:55:34,815 INFO L225 Difference]: With dead ends: 605 [2024-11-09 06:55:34,815 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 06:55:34,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:55:34,817 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 211 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:55:34,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1048 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:55:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 06:55:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 398. [2024-11-09 06:55:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 302 states have (on average 1.4172185430463575) internal successors, (428), 303 states have internal predecessors, (428), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-09 06:55:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 558 transitions. [2024-11-09 06:55:34,847 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 558 transitions. Word has length 61 [2024-11-09 06:55:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:55:34,848 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 558 transitions. [2024-11-09 06:55:34,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 6 states have internal predecessors, (46), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:55:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 558 transitions. [2024-11-09 06:55:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 06:55:34,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:55:34,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:34,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:55:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 06:55:35,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:55:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 204949606, now seen corresponding path program 1 times [2024-11-09 06:55:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:55:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626510908] [2024-11-09 06:55:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:55:35,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:55:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626510908] [2024-11-09 06:55:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626510908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029750764] [2024-11-09 06:55:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:35,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:35,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:55:35,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:35,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:55:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:35,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:55:35,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:36,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:55:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:55:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029750764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:55:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1916432460] [2024-11-09 06:55:36,441 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2024-11-09 06:55:36,441 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:55:36,444 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:55:36,450 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:55:36,451 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:55:52,157 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:55:52,175 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:55:52,177 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 80 for LOIs [2024-11-09 06:55:52,425 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 131 for LOIs [2024-11-09 06:55:53,930 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 106 for LOIs [2024-11-09 06:55:54,591 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:55:54,729 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:56:17,494 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7814#(and (<= 0 ~side2Failed_History_0~0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_#t~ret16#1_15| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_14| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_15| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_15| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_14| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret15#1_15| 0)) (<= |v_ULTIMATE.start_check_#t~ret15#1_15| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_15|) (exists ((|v_ULTIMATE.start_check_~tmp___0~0#1_15| Int)) (and (<= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 127) (or (and (= ~s1p_new~0 ~nomsg~0) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (= ~manual_selection_History_1~0 |v_ULTIMATE.start_check_~tmp___0~0#1_15|) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 0)) (or (and (= ~active_side_History_0~0 0) (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|))) (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23|)))) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_23|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_23| 1)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0))) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___0~0#1_15|)) (not (= |v_ULTIMATE.start_check_~tmp___0~0#1_15| 0)))) (= |v_ULTIMATE.start_check_~tmp___7~0#1_14| 1) (not (= (mod ~side1Failed_History_1~0 256) 0)))) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_14| 0))) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:56:17,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:56:17,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:56:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-09 06:56:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770403261] [2024-11-09 06:56:17,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:56:17,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:56:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:56:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2862, Unknown=1, NotChecked=0, Total=3192 [2024-11-09 06:56:17,498 INFO L87 Difference]: Start difference. First operand 398 states and 558 transitions. Second operand has 13 states, 9 states have (on average 7.555555555555555) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 06:56:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:17,833 INFO L93 Difference]: Finished difference Result 1034 states and 1439 transitions. [2024-11-09 06:56:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:56:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 7.555555555555555) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 63 [2024-11-09 06:56:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:17,841 INFO L225 Difference]: With dead ends: 1034 [2024-11-09 06:56:17,841 INFO L226 Difference]: Without dead ends: 697 [2024-11-09 06:56:17,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=350, Invalid=3309, Unknown=1, NotChecked=0, Total=3660 [2024-11-09 06:56:17,845 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 195 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:17,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2053 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:56:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-09 06:56:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 527. [2024-11-09 06:56:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 394 states have (on average 1.416243654822335) internal successors, (558), 397 states have internal predecessors, (558), 91 states have call successors, (91), 41 states have call predecessors, (91), 41 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-09 06:56:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 740 transitions. [2024-11-09 06:56:17,895 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 740 transitions. Word has length 63 [2024-11-09 06:56:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:17,896 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 740 transitions. [2024-11-09 06:56:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 7.555555555555555) internal successors, (68), 12 states have internal predecessors, (68), 4 states have call successors, (15), 3 states have call predecessors, (15), 8 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 06:56:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 740 transitions. [2024-11-09 06:56:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 06:56:17,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:17,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:17,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:56:18,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:18,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:18,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1042784028, now seen corresponding path program 1 times [2024-11-09 06:56:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920241927] [2024-11-09 06:56:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:56:18,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920241927] [2024-11-09 06:56:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920241927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126444896] [2024-11-09 06:56:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:18,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:18,336 INFO L87 Difference]: Start difference. First operand 527 states and 740 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 06:56:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:18,432 INFO L93 Difference]: Finished difference Result 994 states and 1397 transitions. [2024-11-09 06:56:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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 67 [2024-11-09 06:56:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:18,438 INFO L225 Difference]: With dead ends: 994 [2024-11-09 06:56:18,438 INFO L226 Difference]: Without dead ends: 539 [2024-11-09 06:56:18,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:18,440 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 3 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:18,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 649 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-09 06:56:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-09 06:56:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 403 states have (on average 1.4069478908188586) internal successors, (567), 406 states have internal predecessors, (567), 91 states have call successors, (91), 44 states have call predecessors, (91), 44 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-09 06:56:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 749 transitions. [2024-11-09 06:56:18,477 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 749 transitions. Word has length 67 [2024-11-09 06:56:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:18,478 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 749 transitions. [2024-11-09 06:56:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-09 06:56:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 749 transitions. [2024-11-09 06:56:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 06:56:18,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:18,480 INFO L215 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, 1] [2024-11-09 06:56:18,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:56:18,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash 889988406, now seen corresponding path program 1 times [2024-11-09 06:56:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406978844] [2024-11-09 06:56:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:56:19,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:19,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406978844] [2024-11-09 06:56:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406978844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193712755] [2024-11-09 06:56:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:19,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:19,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:19,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:19,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:56:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:19,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:56:19,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:56:19,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:56:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:56:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193712755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:56:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [30546032] [2024-11-09 06:56:20,344 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2024-11-09 06:56:20,344 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:56:20,345 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:56:20,345 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:56:20,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:56:26,698 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:56:26,703 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:56:26,705 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 18 for LOIs [2024-11-09 06:56:26,717 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 95 for LOIs [2024-11-09 06:56:27,080 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 62 for LOIs [2024-11-09 06:56:27,167 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:56:27,325 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:56:40,470 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12450#(and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (exists ((|v_ULTIMATE.start_check_#t~ret16#1_20| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_18| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret15#1_21| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_19| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret11#1_17| Int) (|v_ULTIMATE.start_check_~tmp___1~0#1_16| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret11#1_17|) (not (= |v_ULTIMATE.start_check_#t~ret11#1_17| 0)) (<= |v_ULTIMATE.start_check_#t~ret11#1_17| 1) (= |v_ULTIMATE.start_check_~tmp___1~0#1_16| 1))) (<= |v_ULTIMATE.start_check_#t~ret15#1_21| 1) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_19| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_21|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_21| 0)))) (= |v_ULTIMATE.start_check_~tmp___8~0#1_18| 0) (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_#t~ret16#1_20| 0))) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:56:40,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:56:40,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:56:40,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 26 [2024-11-09 06:56:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182970533] [2024-11-09 06:56:40,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:56:40,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 06:56:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 06:56:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=4880, Unknown=1, NotChecked=0, Total=5256 [2024-11-09 06:56:40,475 INFO L87 Difference]: Start difference. First operand 539 states and 749 transitions. Second operand has 26 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (22), 4 states have call predecessors, (22), 10 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-09 06:56:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:42,448 INFO L93 Difference]: Finished difference Result 1168 states and 1600 transitions. [2024-11-09 06:56:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 06:56:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (22), 4 states have call predecessors, (22), 10 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) Word has length 71 [2024-11-09 06:56:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:42,453 INFO L225 Difference]: With dead ends: 1168 [2024-11-09 06:56:42,453 INFO L226 Difference]: Without dead ends: 707 [2024-11-09 06:56:42,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=562, Invalid=7627, Unknown=1, NotChecked=0, Total=8190 [2024-11-09 06:56:42,457 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 723 mSDsluCounter, 4742 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 5124 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:42,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 5124 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 06:56:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-09 06:56:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 522. [2024-11-09 06:56:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 390 states have (on average 1.3871794871794871) internal successors, (541), 392 states have internal predecessors, (541), 87 states have call successors, (87), 44 states have call predecessors, (87), 44 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-09 06:56:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 715 transitions. [2024-11-09 06:56:42,501 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 715 transitions. Word has length 71 [2024-11-09 06:56:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:42,501 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 715 transitions. [2024-11-09 06:56:42,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 6 states have call successors, (22), 4 states have call predecessors, (22), 10 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) [2024-11-09 06:56:42,502 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 715 transitions. [2024-11-09 06:56:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 06:56:42,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:42,503 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:42,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:56:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 06:56:42,707 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:42,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 440699352, now seen corresponding path program 1 times [2024-11-09 06:56:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088603400] [2024-11-09 06:56:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:56:43,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088603400] [2024-11-09 06:56:43,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088603400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:56:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893677939] [2024-11-09 06:56:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:43,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:56:43,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:56:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:56:43,384 INFO L87 Difference]: Start difference. First operand 522 states and 715 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:56:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:43,970 INFO L93 Difference]: Finished difference Result 1280 states and 1733 transitions. [2024-11-09 06:56:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:56:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 72 [2024-11-09 06:56:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:43,976 INFO L225 Difference]: With dead ends: 1280 [2024-11-09 06:56:43,976 INFO L226 Difference]: Without dead ends: 819 [2024-11-09 06:56:43,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:43,978 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 497 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:43,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1192 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-09 06:56:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 652. [2024-11-09 06:56:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 483 states have (on average 1.3519668737060042) internal successors, (653), 486 states have internal predecessors, (653), 109 states have call successors, (109), 59 states have call predecessors, (109), 59 states have return successors, (109), 106 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-09 06:56:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 871 transitions. [2024-11-09 06:56:44,055 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 871 transitions. Word has length 72 [2024-11-09 06:56:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:44,056 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 871 transitions. [2024-11-09 06:56:44,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:56:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 871 transitions. [2024-11-09 06:56:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 06:56:44,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:44,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:44,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:56:44,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:44,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:44,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1683445384, now seen corresponding path program 1 times [2024-11-09 06:56:44,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:44,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586023084] [2024-11-09 06:56:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:44,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586023084] [2024-11-09 06:56:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586023084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729252451] [2024-11-09 06:56:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:44,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:44,178 INFO L87 Difference]: Start difference. First operand 652 states and 871 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:44,425 INFO L93 Difference]: Finished difference Result 1585 states and 2122 transitions. [2024-11-09 06:56:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:56:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2024-11-09 06:56:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:44,432 INFO L225 Difference]: With dead ends: 1585 [2024-11-09 06:56:44,432 INFO L226 Difference]: Without dead ends: 1147 [2024-11-09 06:56:44,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:44,434 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 189 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:44,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 961 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-09 06:56:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1142. [2024-11-09 06:56:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 844 states have (on average 1.338862559241706) internal successors, (1130), 851 states have internal predecessors, (1130), 191 states have call successors, (191), 106 states have call predecessors, (191), 106 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2024-11-09 06:56:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1512 transitions. [2024-11-09 06:56:44,560 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1512 transitions. Word has length 72 [2024-11-09 06:56:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:44,560 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1512 transitions. [2024-11-09 06:56:44,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1512 transitions. [2024-11-09 06:56:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:56:44,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:44,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:44,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:56:44,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:44,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2033550381, now seen corresponding path program 1 times [2024-11-09 06:56:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:44,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842655169] [2024-11-09 06:56:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:56:45,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842655169] [2024-11-09 06:56:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842655169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:56:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851699069] [2024-11-09 06:56:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:45,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:56:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:56:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:56:45,160 INFO L87 Difference]: Start difference. First operand 1142 states and 1512 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 06:56:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:45,934 INFO L93 Difference]: Finished difference Result 2566 states and 3401 transitions. [2024-11-09 06:56:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:56:45,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 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 74 [2024-11-09 06:56:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:45,946 INFO L225 Difference]: With dead ends: 2566 [2024-11-09 06:56:45,946 INFO L226 Difference]: Without dead ends: 1770 [2024-11-09 06:56:45,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:45,951 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 539 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:45,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1724 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:56:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-09 06:56:46,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1725. [2024-11-09 06:56:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1265 states have (on average 1.3249011857707509) internal successors, (1676), 1276 states have internal predecessors, (1676), 298 states have call successors, (298), 161 states have call predecessors, (298), 161 states have return successors, (298), 287 states have call predecessors, (298), 298 states have call successors, (298) [2024-11-09 06:56:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2272 transitions. [2024-11-09 06:56:46,178 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2272 transitions. Word has length 74 [2024-11-09 06:56:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:46,178 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2272 transitions. [2024-11-09 06:56:46,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 06:56:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2272 transitions. [2024-11-09 06:56:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 06:56:46,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:46,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:46,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:56:46,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:46,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 261042066, now seen corresponding path program 1 times [2024-11-09 06:56:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:46,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251019917] [2024-11-09 06:56:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:46,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251019917] [2024-11-09 06:56:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251019917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937335168] [2024-11-09 06:56:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:46,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:46,305 INFO L87 Difference]: Start difference. First operand 1725 states and 2272 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:46,745 INFO L93 Difference]: Finished difference Result 3911 states and 5183 transitions. [2024-11-09 06:56:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:56:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-11-09 06:56:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:46,760 INFO L225 Difference]: With dead ends: 3911 [2024-11-09 06:56:46,760 INFO L226 Difference]: Without dead ends: 2817 [2024-11-09 06:56:46,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:46,764 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 194 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:46,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 744 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2024-11-09 06:56:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2458. [2024-11-09 06:56:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 1799 states have (on average 1.3179544191217343) internal successors, (2371), 1815 states have internal predecessors, (2371), 430 states have call successors, (430), 228 states have call predecessors, (430), 228 states have return successors, (430), 414 states have call predecessors, (430), 430 states have call successors, (430) [2024-11-09 06:56:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3231 transitions. [2024-11-09 06:56:47,117 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3231 transitions. Word has length 76 [2024-11-09 06:56:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:47,117 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3231 transitions. [2024-11-09 06:56:47,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3231 transitions. [2024-11-09 06:56:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 06:56:47,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:47,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:47,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:56:47,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:47,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1070788936, now seen corresponding path program 1 times [2024-11-09 06:56:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579829434] [2024-11-09 06:56:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:47,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579829434] [2024-11-09 06:56:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579829434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685576486] [2024-11-09 06:56:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:47,254 INFO L87 Difference]: Start difference. First operand 2458 states and 3231 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:47,769 INFO L93 Difference]: Finished difference Result 5183 states and 6857 transitions. [2024-11-09 06:56:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:56:47,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-11-09 06:56:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:47,790 INFO L225 Difference]: With dead ends: 5183 [2024-11-09 06:56:47,790 INFO L226 Difference]: Without dead ends: 3379 [2024-11-09 06:56:47,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:47,797 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 188 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:47,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1047 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2024-11-09 06:56:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3360. [2024-11-09 06:56:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3360 states, 2456 states have (on average 1.3102605863192183) internal successors, (3218), 2478 states have internal predecessors, (3218), 592 states have call successors, (592), 311 states have call predecessors, (592), 311 states have return successors, (592), 570 states have call predecessors, (592), 592 states have call successors, (592) [2024-11-09 06:56:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 4402 transitions. [2024-11-09 06:56:48,309 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 4402 transitions. Word has length 76 [2024-11-09 06:56:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:48,309 INFO L471 AbstractCegarLoop]: Abstraction has 3360 states and 4402 transitions. [2024-11-09 06:56:48,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 4402 transitions. [2024-11-09 06:56:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 06:56:48,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:48,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:56:48,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -119346261, now seen corresponding path program 1 times [2024-11-09 06:56:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346163095] [2024-11-09 06:56:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:48,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346163095] [2024-11-09 06:56:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346163095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397135469] [2024-11-09 06:56:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:48,377 INFO L87 Difference]: Start difference. First operand 3360 states and 4402 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:48,853 INFO L93 Difference]: Finished difference Result 6006 states and 7919 transitions. [2024-11-09 06:56:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-09 06:56:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:48,881 INFO L225 Difference]: With dead ends: 6006 [2024-11-09 06:56:48,881 INFO L226 Difference]: Without dead ends: 3385 [2024-11-09 06:56:48,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:48,889 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 6 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:48,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 416 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-11-09 06:56:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3365. [2024-11-09 06:56:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 2461 states have (on average 1.3096302316131654) internal successors, (3223), 2483 states have internal predecessors, (3223), 592 states have call successors, (592), 311 states have call predecessors, (592), 311 states have return successors, (592), 570 states have call predecessors, (592), 592 states have call successors, (592) [2024-11-09 06:56:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4407 transitions. [2024-11-09 06:56:49,414 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4407 transitions. Word has length 77 [2024-11-09 06:56:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:49,415 INFO L471 AbstractCegarLoop]: Abstraction has 3365 states and 4407 transitions. [2024-11-09 06:56:49,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4407 transitions. [2024-11-09 06:56:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:56:49,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:49,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:49,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:56:49,418 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash -516067725, now seen corresponding path program 1 times [2024-11-09 06:56:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405917317] [2024-11-09 06:56:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:49,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405917317] [2024-11-09 06:56:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405917317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374129075] [2024-11-09 06:56:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:49,578 INFO L87 Difference]: Start difference. First operand 3365 states and 4407 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:49,927 INFO L93 Difference]: Finished difference Result 5648 states and 7427 transitions. [2024-11-09 06:56:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-09 06:56:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:49,943 INFO L225 Difference]: With dead ends: 5648 [2024-11-09 06:56:49,944 INFO L226 Difference]: Without dead ends: 2514 [2024-11-09 06:56:49,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:49,953 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 57 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:49,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 644 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2024-11-09 06:56:50,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2514. [2024-11-09 06:56:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 1841 states have (on average 1.3215643671917436) internal successors, (2433), 1857 states have internal predecessors, (2433), 439 states have call successors, (439), 233 states have call predecessors, (439), 233 states have return successors, (439), 423 states have call predecessors, (439), 439 states have call successors, (439) [2024-11-09 06:56:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3311 transitions. [2024-11-09 06:56:50,315 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3311 transitions. Word has length 78 [2024-11-09 06:56:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:50,317 INFO L471 AbstractCegarLoop]: Abstraction has 2514 states and 3311 transitions. [2024-11-09 06:56:50,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3311 transitions. [2024-11-09 06:56:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 06:56:50,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:50,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:56:50,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -351175953, now seen corresponding path program 1 times [2024-11-09 06:56:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080471047] [2024-11-09 06:56:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:50,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080471047] [2024-11-09 06:56:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080471047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630434777] [2024-11-09 06:56:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:50,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:50,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:50,398 INFO L87 Difference]: Start difference. First operand 2514 states and 3311 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:50,797 INFO L93 Difference]: Finished difference Result 4827 states and 6375 transitions. [2024-11-09 06:56:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:50,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-09 06:56:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:50,812 INFO L225 Difference]: With dead ends: 4827 [2024-11-09 06:56:50,812 INFO L226 Difference]: Without dead ends: 2520 [2024-11-09 06:56:50,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:50,818 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:50,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2024-11-09 06:56:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2520. [2024-11-09 06:56:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 1847 states have (on average 1.3205197617758528) internal successors, (2439), 1863 states have internal predecessors, (2439), 439 states have call successors, (439), 233 states have call predecessors, (439), 233 states have return successors, (439), 423 states have call predecessors, (439), 439 states have call successors, (439) [2024-11-09 06:56:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3317 transitions. [2024-11-09 06:56:51,188 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3317 transitions. Word has length 79 [2024-11-09 06:56:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:51,189 INFO L471 AbstractCegarLoop]: Abstraction has 2520 states and 3317 transitions. [2024-11-09 06:56:51,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3317 transitions. [2024-11-09 06:56:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 06:56:51,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:51,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:56:51,199 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:51,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 304646292, now seen corresponding path program 1 times [2024-11-09 06:56:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109728834] [2024-11-09 06:56:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:56:51,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109728834] [2024-11-09 06:56:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109728834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117373089] [2024-11-09 06:56:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:51,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:51,370 INFO L87 Difference]: Start difference. First operand 2520 states and 3317 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:51,725 INFO L93 Difference]: Finished difference Result 4735 states and 6240 transitions. [2024-11-09 06:56:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:51,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-09 06:56:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:51,742 INFO L225 Difference]: With dead ends: 4735 [2024-11-09 06:56:51,742 INFO L226 Difference]: Without dead ends: 2370 [2024-11-09 06:56:51,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:51,749 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 39 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:51,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 634 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2024-11-09 06:56:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2328. [2024-11-09 06:56:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1699 states have (on average 1.3143025309005296) internal successors, (2233), 1714 states have internal predecessors, (2233), 409 states have call successors, (409), 219 states have call predecessors, (409), 219 states have return successors, (409), 394 states have call predecessors, (409), 409 states have call successors, (409) [2024-11-09 06:56:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3051 transitions. [2024-11-09 06:56:52,062 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3051 transitions. Word has length 79 [2024-11-09 06:56:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:52,063 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 3051 transitions. [2024-11-09 06:56:52,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:56:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3051 transitions. [2024-11-09 06:56:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 06:56:52,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:52,065 INFO L215 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, 1] [2024-11-09 06:56:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:56:52,066 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -210645210, now seen corresponding path program 1 times [2024-11-09 06:56:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178643872] [2024-11-09 06:56:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 06:56:52,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178643872] [2024-11-09 06:56:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178643872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:52,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:56:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912694481] [2024-11-09 06:56:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:52,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:52,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:52,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:52,469 INFO L87 Difference]: Start difference. First operand 2328 states and 3051 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-11-09 06:56:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:52,961 INFO L93 Difference]: Finished difference Result 3352 states and 4642 transitions. [2024-11-09 06:56:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:56:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 81 [2024-11-09 06:56:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:52,986 INFO L225 Difference]: With dead ends: 3352 [2024-11-09 06:56:52,987 INFO L226 Difference]: Without dead ends: 3350 [2024-11-09 06:56:52,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:56:52,989 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 125 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:52,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1525 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2024-11-09 06:56:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 2319. [2024-11-09 06:56:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1688 states have (on average 1.316350710900474) internal successors, (2222), 1704 states have internal predecessors, (2222), 410 states have call successors, (410), 220 states have call predecessors, (410), 220 states have return successors, (410), 394 states have call predecessors, (410), 410 states have call successors, (410) [2024-11-09 06:56:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3042 transitions. [2024-11-09 06:56:53,336 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3042 transitions. Word has length 81 [2024-11-09 06:56:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3042 transitions. [2024-11-09 06:56:53,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-11-09 06:56:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3042 transitions. [2024-11-09 06:56:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 06:56:53,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:53,339 INFO L215 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, 1] [2024-11-09 06:56:53,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:56:53,340 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:53,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1603651466, now seen corresponding path program 1 times [2024-11-09 06:56:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:53,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719202966] [2024-11-09 06:56:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 06:56:53,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:53,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719202966] [2024-11-09 06:56:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719202966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047435659] [2024-11-09 06:56:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:53,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:53,599 INFO L87 Difference]: Start difference. First operand 2319 states and 3042 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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) [2024-11-09 06:56:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:53,983 INFO L93 Difference]: Finished difference Result 4361 states and 5751 transitions. [2024-11-09 06:56:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 84 [2024-11-09 06:56:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:54,001 INFO L225 Difference]: With dead ends: 4361 [2024-11-09 06:56:54,005 INFO L226 Difference]: Without dead ends: 2287 [2024-11-09 06:56:54,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:54,013 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 5 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:54,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 641 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:56:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2024-11-09 06:56:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2210. [2024-11-09 06:56:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1616 states have (on average 1.2939356435643565) internal successors, (2091), 1631 states have internal predecessors, (2091), 382 states have call successors, (382), 211 states have call predecessors, (382), 211 states have return successors, (382), 367 states have call predecessors, (382), 382 states have call successors, (382) [2024-11-09 06:56:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2855 transitions. [2024-11-09 06:56:54,322 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2855 transitions. Word has length 84 [2024-11-09 06:56:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:54,323 INFO L471 AbstractCegarLoop]: Abstraction has 2210 states and 2855 transitions. [2024-11-09 06:56:54,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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) [2024-11-09 06:56:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2855 transitions. [2024-11-09 06:56:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 06:56:54,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:54,325 INFO L215 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, 1] [2024-11-09 06:56:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:56:54,325 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:56:54,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:54,325 INFO L85 PathProgramCache]: Analyzing trace with hash -141644480, now seen corresponding path program 1 times [2024-11-09 06:56:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292938172] [2024-11-09 06:56:54,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 06:56:55,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292938172] [2024-11-09 06:56:55,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292938172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:55,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790756978] [2024-11-09 06:56:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:55,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:55,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:55,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:56:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:55,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:56:55,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 06:56:55,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:56:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 06:56:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790756978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:56:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1045301236] [2024-11-09 06:56:56,266 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2024-11-09 06:56:56,266 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:56:56,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:56:56,267 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:56:56,267 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:02,469 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 06:57:02,474 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:57:02,475 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 19 for LOIs [2024-11-09 06:57:02,500 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 44 for LOIs [2024-11-09 06:57:02,526 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 135 for LOIs [2024-11-09 06:57:02,910 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 06:57:03,049 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:57:18,017 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '108040#(and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_19| Int) (|v_ULTIMATE.start_check_#t~ret20#1_20| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret20#1_20| 1) (= |v_ULTIMATE.start_check_~tmp___12~0#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret20#1_20| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_20|))) (not (= ~active_side_History_0~0 1)) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:57:18,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:57:18,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 26 [2024-11-09 06:57:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296469963] [2024-11-09 06:57:18,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:57:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 06:57:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 06:57:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=5302, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 06:57:18,021 INFO L87 Difference]: Start difference. First operand 2210 states and 2855 transitions. Second operand has 26 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 6 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (29), 9 states have call predecessors, (29), 6 states have call successors, (29) [2024-11-09 06:57:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:19,639 INFO L93 Difference]: Finished difference Result 4359 states and 5618 transitions. [2024-11-09 06:57:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 06:57:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 6 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (29), 9 states have call predecessors, (29), 6 states have call successors, (29) Word has length 86 [2024-11-09 06:57:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:19,664 INFO L225 Difference]: With dead ends: 4359 [2024-11-09 06:57:19,665 INFO L226 Difference]: Without dead ends: 2305 [2024-11-09 06:57:19,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 189 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3112 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=547, Invalid=7643, Unknown=0, NotChecked=0, Total=8190 [2024-11-09 06:57:19,674 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 863 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:19,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 2405 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:57:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-11-09 06:57:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2189. [2024-11-09 06:57:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1601 states have (on average 1.2904434728294816) internal successors, (2066), 1616 states have internal predecessors, (2066), 376 states have call successors, (376), 211 states have call predecessors, (376), 211 states have return successors, (376), 361 states have call predecessors, (376), 376 states have call successors, (376) [2024-11-09 06:57:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2818 transitions. [2024-11-09 06:57:20,020 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2818 transitions. Word has length 86 [2024-11-09 06:57:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:20,021 INFO L471 AbstractCegarLoop]: Abstraction has 2189 states and 2818 transitions. [2024-11-09 06:57:20,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 6 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (29), 9 states have call predecessors, (29), 6 states have call successors, (29) [2024-11-09 06:57:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2818 transitions. [2024-11-09 06:57:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 06:57:20,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:20,023 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:20,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:57:20,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 06:57:20,227 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:20,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1850356812, now seen corresponding path program 1 times [2024-11-09 06:57:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046793041] [2024-11-09 06:57:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-09 06:57:20,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046793041] [2024-11-09 06:57:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046793041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:20,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709357645] [2024-11-09 06:57:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:20,483 INFO L87 Difference]: Start difference. First operand 2189 states and 2818 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2024-11-09 06:57:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:20,841 INFO L93 Difference]: Finished difference Result 4111 states and 5327 transitions. [2024-11-09 06:57:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:57:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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 93 [2024-11-09 06:57:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:20,858 INFO L225 Difference]: With dead ends: 4111 [2024-11-09 06:57:20,859 INFO L226 Difference]: Without dead ends: 2159 [2024-11-09 06:57:20,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:20,864 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 5 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:20,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:57:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2024-11-09 06:57:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2159. [2024-11-09 06:57:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1586 states have (on average 1.2648171500630516) internal successors, (2006), 1601 states have internal predecessors, (2006), 361 states have call successors, (361), 211 states have call predecessors, (361), 211 states have return successors, (361), 346 states have call predecessors, (361), 361 states have call successors, (361) [2024-11-09 06:57:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2728 transitions. [2024-11-09 06:57:21,171 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2728 transitions. Word has length 93 [2024-11-09 06:57:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:21,172 INFO L471 AbstractCegarLoop]: Abstraction has 2159 states and 2728 transitions. [2024-11-09 06:57:21,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2024-11-09 06:57:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2728 transitions. [2024-11-09 06:57:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 06:57:21,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:21,174 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:21,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:57:21,175 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash 242599594, now seen corresponding path program 1 times [2024-11-09 06:57:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142853767] [2024-11-09 06:57:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 06:57:21,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142853767] [2024-11-09 06:57:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142853767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871837216] [2024-11-09 06:57:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:21,424 INFO L87 Difference]: Start difference. First operand 2159 states and 2728 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-09 06:57:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:21,772 INFO L93 Difference]: Finished difference Result 4003 states and 5096 transitions. [2024-11-09 06:57:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:57:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 109 [2024-11-09 06:57:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:21,786 INFO L225 Difference]: With dead ends: 4003 [2024-11-09 06:57:21,787 INFO L226 Difference]: Without dead ends: 2129 [2024-11-09 06:57:21,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:21,792 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 5 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:21,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 611 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:57:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2024-11-09 06:57:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2054. [2024-11-09 06:57:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1517 states have (on average 1.2353328938694792) internal successors, (1874), 1532 states have internal predecessors, (1874), 334 states have call successors, (334), 202 states have call predecessors, (334), 202 states have return successors, (334), 319 states have call predecessors, (334), 334 states have call successors, (334) [2024-11-09 06:57:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2542 transitions. [2024-11-09 06:57:22,143 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2542 transitions. Word has length 109 [2024-11-09 06:57:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:22,146 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2542 transitions. [2024-11-09 06:57:22,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-09 06:57:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2542 transitions. [2024-11-09 06:57:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 06:57:22,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:22,149 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:22,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:57:22,150 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:22,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:22,150 INFO L85 PathProgramCache]: Analyzing trace with hash -419713272, now seen corresponding path program 1 times [2024-11-09 06:57:22,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:22,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611707917] [2024-11-09 06:57:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:22,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:57:22,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611707917] [2024-11-09 06:57:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611707917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:22,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395084745] [2024-11-09 06:57:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:22,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:22,398 INFO L87 Difference]: Start difference. First operand 2054 states and 2542 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:57:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:22,729 INFO L93 Difference]: Finished difference Result 3760 states and 4691 transitions. [2024-11-09 06:57:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:57:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 125 [2024-11-09 06:57:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:22,744 INFO L225 Difference]: With dead ends: 3760 [2024-11-09 06:57:22,744 INFO L226 Difference]: Without dead ends: 2018 [2024-11-09 06:57:22,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:22,750 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 4 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:22,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 602 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:57:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2024-11-09 06:57:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1924. [2024-11-09 06:57:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1421 states have (on average 1.2097114707952146) internal successors, (1719), 1436 states have internal predecessors, (1719), 311 states have call successors, (311), 191 states have call predecessors, (311), 191 states have return successors, (311), 296 states have call predecessors, (311), 311 states have call successors, (311) [2024-11-09 06:57:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2341 transitions. [2024-11-09 06:57:23,037 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2341 transitions. Word has length 125 [2024-11-09 06:57:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2341 transitions. [2024-11-09 06:57:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 06:57:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2341 transitions. [2024-11-09 06:57:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 06:57:23,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:23,044 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:57:23,044 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:57:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1574297211, now seen corresponding path program 1 times [2024-11-09 06:57:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903318246] [2024-11-09 06:57:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 06:57:23,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903318246] [2024-11-09 06:57:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903318246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483765655] [2024-11-09 06:57:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:23,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:23,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:23,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:57:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:24,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:57:24,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 06:57:24,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 06:57:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483765655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [608221211] [2024-11-09 06:57:24,631 INFO L159 IcfgInterpreter]: Started Sifa with 87 locations of interest [2024-11-09 06:57:24,631 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:57:24,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:57:24,632 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:57:24,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:39,363 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-09 06:57:39,383 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:57:39,384 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 20 for LOIs [2024-11-09 06:57:39,412 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 212 for LOIs [2024-11-09 06:57:40,006 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 190 for LOIs [2024-11-09 06:57:42,574 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 24 for LOIs [2024-11-09 06:57:42,609 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:58:34,143 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '142448#(and (<= 0 ~side2Failed_History_0~0) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_#t~ret27#1_20| Int) (|v_ULTIMATE.start_check_~tmp___16~0#1_19| Int) (|v_ULTIMATE.start_check_#t~ret28#1_20| Int) (|v_ULTIMATE.start_check_~tmp___17~0#1_19| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret28#1_20|) (= |v_ULTIMATE.start_check_~tmp___17~0#1_19| |v_ULTIMATE.start_check_~tmp___16~0#1_19|) (<= 0 |v_ULTIMATE.start_check_#t~ret27#1_20|) (or (and (not (= |v_ULTIMATE.start_check_#t~ret28#1_20| 0)) (= |v_ULTIMATE.start_check_~tmp___17~0#1_19| 1)) (and (= |v_ULTIMATE.start_check_#t~ret28#1_20| 0) (= |v_ULTIMATE.start_check_~tmp___17~0#1_19| 0))) (<= |v_ULTIMATE.start_check_#t~ret28#1_20| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___16~0#1_19| 0) (= |v_ULTIMATE.start_check_#t~ret27#1_20| 0)) (and (= |v_ULTIMATE.start_check_~tmp___16~0#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret27#1_20| 0)))) (<= |v_ULTIMATE.start_check_#t~ret27#1_20| 1))) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___19~0#1_19| Int) (|v_ULTIMATE.start_check_~tmp___18~0#1_19| Int)) (and (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_19| |v_ULTIMATE.start_check_~tmp___19~0#1_19|)) (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_19| 128)) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_19|)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_19| 127) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_19| 127))) (exists ((|v_ULTIMATE.start_check_#t~ret26#1_20| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_19| Int) (|v_ULTIMATE.start_check_~tmp___15~0#1_19| Int)) (and (= |v_ULTIMATE.start_check_~tmp___15~0#1_19| |v_ULTIMATE.start_check_~tmp___14~0#1_19|) (or (and (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_26| Int) (|v_ULTIMATE.start_check_#t~ret15#1_30| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_30| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_26| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret11#1_27| Int) (|v_ULTIMATE.start_check_~tmp___1~0#1_24| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_27| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_24| 0))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| 1)) (or (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32|))) (and (or (and (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|)) (= ~active_side_History_0~0 0)) (and (= 2 ~active_side_History_0~0) (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|))) (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32|))))) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_23| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_21| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret12#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret12#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___2~0#1_21| 1))) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_22| Int) (|v_ULTIMATE.start_check_#t~ret19#1_24| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret19#1_24| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_22| 1) (<= |v_ULTIMATE.start_check_#t~ret19#1_24| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_24|))) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_20| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_20|) (<= |v_ULTIMATE.start_check_#t~ret25#1_20| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_20| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_19| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_20| 0)))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0)) (and (= ~s1p_new~0 ~nomsg~0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_26| Int) (|v_ULTIMATE.start_check_#t~ret15#1_30| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_30| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_26| 0))) (exists ((|v_ULTIMATE.start_check_#t~ret11#1_27| Int) (|v_ULTIMATE.start_check_~tmp___1~0#1_24| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_27| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_24| 0))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32| Int)) (and (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| 0)) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32| 1)) (or (and (= ~active_side_History_0~0 0) (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32|))) (and (or (and (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|)) (= ~active_side_History_0~0 0)) (and (= 2 ~active_side_History_0~0) (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_32|))) (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_32|))))) (exists ((|v_ULTIMATE.start_check_#t~ret12#1_23| Int) (|v_ULTIMATE.start_check_~tmp___2~0#1_21| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret12#1_23| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_23|) (not (= |v_ULTIMATE.start_check_#t~ret12#1_23| 0)) (= |v_ULTIMATE.start_check_~tmp___2~0#1_21| 1))) (= ~nomsg~0 ~s2p_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_22| Int) (|v_ULTIMATE.start_check_#t~ret19#1_24| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret19#1_24| 0)) (= |v_ULTIMATE.start_check_~tmp___11~0#1_22| 1) (<= |v_ULTIMATE.start_check_#t~ret19#1_24| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret19#1_24|))) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_20| Int)) (and (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_20|) (<= |v_ULTIMATE.start_check_#t~ret25#1_20| 1) (or (and (= |v_ULTIMATE.start_check_#t~ret25#1_20| 0) (= |v_ULTIMATE.start_check_~tmp___14~0#1_19| 0)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret25#1_20| 0)))))) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0))) (<= |v_ULTIMATE.start_check_#t~ret26#1_20| 1) (or (and (= |v_ULTIMATE.start_check_~tmp___15~0#1_19| 1) (not (= |v_ULTIMATE.start_check_#t~ret26#1_20| 0))) (and (= |v_ULTIMATE.start_check_#t~ret26#1_20| 0) (= |v_ULTIMATE.start_check_~tmp___15~0#1_19| 0))) (<= 0 |v_ULTIMATE.start_check_#t~ret26#1_20|))) (<= ~side2Failed_History_2~0 1))' at error location [2024-11-09 06:58:34,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:58:34,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:58:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 9] total 22 [2024-11-09 06:58:34,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438599912] [2024-11-09 06:58:34,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:58:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:58:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:58:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:58:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=6643, Unknown=0, NotChecked=0, Total=7140 [2024-11-09 06:58:34,147 INFO L87 Difference]: Start difference. First operand 1924 states and 2341 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 17 states have internal predecessors, (124), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-09 06:58:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:35,968 INFO L93 Difference]: Finished difference Result 5345 states and 6700 transitions. [2024-11-09 06:58:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 06:58:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 17 states have internal predecessors, (124), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) Word has length 135 [2024-11-09 06:58:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:35,988 INFO L225 Difference]: With dead ends: 5345 [2024-11-09 06:58:35,988 INFO L226 Difference]: Without dead ends: 3589 [2024-11-09 06:58:35,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 319 SyntacticMatches, 14 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 52.2s TimeCoverageRelationStatistics Valid=619, Invalid=8887, Unknown=0, NotChecked=0, Total=9506 [2024-11-09 06:58:35,997 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 567 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 3162 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:35,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 3162 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:58:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2024-11-09 06:58:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 2986. [2024-11-09 06:58:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2194 states have (on average 1.194165907019143) internal successors, (2620), 2220 states have internal predecessors, (2620), 487 states have call successors, (487), 304 states have call predecessors, (487), 304 states have return successors, (487), 461 states have call predecessors, (487), 487 states have call successors, (487) [2024-11-09 06:58:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3594 transitions. [2024-11-09 06:58:36,437 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3594 transitions. Word has length 135 [2024-11-09 06:58:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:36,438 INFO L471 AbstractCegarLoop]: Abstraction has 2986 states and 3594 transitions. [2024-11-09 06:58:36,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 17 states have internal predecessors, (124), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 9 states have call predecessors, (31), 4 states have call successors, (31) [2024-11-09 06:58:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3594 transitions. [2024-11-09 06:58:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 06:58:36,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:36,443 INFO L215 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, 1] [2024-11-09 06:58:36,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:36,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 06:58:36,644 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:58:36,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 42551317, now seen corresponding path program 1 times [2024-11-09 06:58:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213581121] [2024-11-09 06:58:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-09 06:58:41,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213581121] [2024-11-09 06:58:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213581121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163469995] [2024-11-09 06:58:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:41,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:41,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:58:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:42,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:58:42,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 06:58:42,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 06:58:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163469995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1230530387] [2024-11-09 06:58:43,118 INFO L159 IcfgInterpreter]: Started Sifa with 90 locations of interest [2024-11-09 06:58:43,118 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:58:43,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:58:43,119 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:58:43,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:59:01,434 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-09 06:59:01,455 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 06:59:01,456 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 20 for LOIs [2024-11-09 06:59:01,484 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 227 for LOIs [2024-11-09 06:59:02,084 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 20 for LOIs [2024-11-09 06:59:02,103 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 18 for LOIs [2024-11-09 06:59:02,119 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:59:55,301 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '154815#(and (<= 0 ~side2Failed_History_0~0) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (exists ((|v_ULTIMATE.start_check_~tmp___17~0#1_23| Int) (|v_ULTIMATE.start_check_#t~ret28#1_25| Int) (|v_ULTIMATE.start_check_~tmp___16~0#1_23| Int) (|v_ULTIMATE.start_check_#t~ret27#1_25| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret28#1_25| 1) (= |v_ULTIMATE.start_check_~tmp___17~0#1_23| |v_ULTIMATE.start_check_~tmp___16~0#1_23|) (or (and (not (= |v_ULTIMATE.start_check_#t~ret27#1_25| 0)) (= |v_ULTIMATE.start_check_~tmp___16~0#1_23| 1)) (and (= |v_ULTIMATE.start_check_~tmp___16~0#1_23| 0) (= |v_ULTIMATE.start_check_#t~ret27#1_25| 0))) (<= |v_ULTIMATE.start_check_#t~ret27#1_25| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret27#1_25|) (or (and (= |v_ULTIMATE.start_check_#t~ret28#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___17~0#1_23| 0)) (and (= |v_ULTIMATE.start_check_~tmp___17~0#1_23| 1) (not (= |v_ULTIMATE.start_check_#t~ret28#1_25| 0)))) (<= 0 |v_ULTIMATE.start_check_#t~ret28#1_25|))) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (= ~manual_selection_History_2~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___19~0#1_23| Int) (|v_ULTIMATE.start_check_~tmp___18~0#1_23| Int)) (and (<= 0 (+ |v_ULTIMATE.start_check_~tmp___18~0#1_23| 128)) (<= |v_ULTIMATE.start_check_~tmp___19~0#1_23| 127) (not (= |v_ULTIMATE.start_check_~tmp___18~0#1_23| |v_ULTIMATE.start_check_~tmp___19~0#1_23|)) (<= 0 (+ 128 |v_ULTIMATE.start_check_~tmp___19~0#1_23|)) (<= |v_ULTIMATE.start_check_~tmp___18~0#1_23| 127))) (<= ~side2Failed_History_2~0 1) (exists ((|v_ULTIMATE.start_check_~tmp___15~0#1_23| Int) (|v_ULTIMATE.start_check_#t~ret26#1_25| Int) (|v_ULTIMATE.start_check_~tmp___14~0#1_23| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret26#1_25| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret26#1_25|) (or (and (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_25| Int) (|v_ULTIMATE.start_check_#t~ret12#1_28| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret12#1_28| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_28|) (<= |v_ULTIMATE.start_check_#t~ret12#1_28| 1) (= |v_ULTIMATE.start_check_~tmp___2~0#1_25| 1))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_28| Int) (|v_ULTIMATE.start_check_#t~ret11#1_32| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_32| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_28| 0))) (= ~s1p_new~0 ~nomsg~0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_30| Int) (|v_ULTIMATE.start_check_#t~ret15#1_35| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_35| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_30| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| 1)) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|)) (or (and (or (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|) (= 2 ~active_side_History_0~0)) (and (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|)) (= ~active_side_History_0~0 0))) (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36|)) (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36|)) (= ~active_side_History_0~0 0))) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| 0)))) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_25| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret25#1_25| 1) (or (and (not (= |v_ULTIMATE.start_check_#t~ret25#1_25| 0)) (= |v_ULTIMATE.start_check_~tmp___14~0#1_23| 1)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_23| 0) (= |v_ULTIMATE.start_check_#t~ret25#1_25| 0))) (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_25|))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_24| Int) (|v_ULTIMATE.start_check_#t~ret20#1_26| Int)) (and (= |v_ULTIMATE.start_check_#t~ret20#1_26| 0) (= |v_ULTIMATE.start_check_~tmp___12~0#1_24| 0))) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (= (mod ~side1Failed~0 256) 0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_26| Int) (|v_ULTIMATE.start_check_#t~ret19#1_29| Int)) (and (= |v_ULTIMATE.start_check_#t~ret19#1_29| 0) (= |v_ULTIMATE.start_check_~tmp___11~0#1_26| 0))) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0)) (and (exists ((|v_ULTIMATE.start_check_~tmp___2~0#1_25| Int) (|v_ULTIMATE.start_check_#t~ret12#1_28| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret12#1_28| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret12#1_28|) (<= |v_ULTIMATE.start_check_#t~ret12#1_28| 1) (= |v_ULTIMATE.start_check_~tmp___2~0#1_25| 1))) (exists ((|v_ULTIMATE.start_check_~tmp___1~0#1_28| Int) (|v_ULTIMATE.start_check_#t~ret11#1_32| Int)) (and (= |v_ULTIMATE.start_check_#t~ret11#1_32| 0) (= |v_ULTIMATE.start_check_~tmp___1~0#1_28| 0))) (= ~s1p_new~0 ~nomsg~0) (not (= (mod ~side1Failed~0 256) 0)) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_30| Int) (|v_ULTIMATE.start_check_#t~ret15#1_35| Int)) (and (= |v_ULTIMATE.start_check_#t~ret15#1_35| 0) (= |v_ULTIMATE.start_check_~tmp___7~0#1_30| 0))) (exists ((|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36| Int) (|v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| Int)) (and (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| 1)) (not (= 1 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|)) (or (and (or (and (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|) (= 2 ~active_side_History_0~0)) (and (not (= 0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side2~2#1_36|)) (= ~active_side_History_0~0 0))) (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36|)) (and (not (= ~nomsg~0 |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36|)) (= ~active_side_History_0~0 0))) (not (= |v_ULTIMATE.start_Pendulum_prism_task_each_pals_period_~side1~2#1_36| 0)))) (exists ((|v_ULTIMATE.start_check_#t~ret25#1_25| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret25#1_25| 1) (or (and (not (= |v_ULTIMATE.start_check_#t~ret25#1_25| 0)) (= |v_ULTIMATE.start_check_~tmp___14~0#1_23| 1)) (and (= |v_ULTIMATE.start_check_~tmp___14~0#1_23| 0) (= |v_ULTIMATE.start_check_#t~ret25#1_25| 0))) (<= 0 |v_ULTIMATE.start_check_#t~ret25#1_25|))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_24| Int) (|v_ULTIMATE.start_check_#t~ret20#1_26| Int)) (and (= |v_ULTIMATE.start_check_#t~ret20#1_26| 0) (= |v_ULTIMATE.start_check_~tmp___12~0#1_24| 0))) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (= ~nomsg~0 ~cs1_new~0) (= ~nomsg~0 ~s2s2_new~0) (exists ((|v_ULTIMATE.start_check_~tmp___11~0#1_26| Int) (|v_ULTIMATE.start_check_#t~ret19#1_29| Int)) (and (= |v_ULTIMATE.start_check_#t~ret19#1_29| 0) (= |v_ULTIMATE.start_check_~tmp___11~0#1_26| 0))) (= ~nomsg~0 ~cs2_new~0) (= ~nomsg~0 ~s1s2_new~0))) (= |v_ULTIMATE.start_check_~tmp___15~0#1_23| |v_ULTIMATE.start_check_~tmp___14~0#1_23|) (or (and (= |v_ULTIMATE.start_check_#t~ret26#1_25| 0) (= |v_ULTIMATE.start_check_~tmp___15~0#1_23| 0)) (and (not (= |v_ULTIMATE.start_check_#t~ret26#1_25| 0)) (= |v_ULTIMATE.start_check_~tmp___15~0#1_23| 1))))))' at error location [2024-11-09 06:59:55,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:59:55,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:55,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 9, 9] total 45 [2024-11-09 06:59:55,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615250200] [2024-11-09 06:59:55,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 06:59:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:59:55,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 06:59:55,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=11317, Unknown=0, NotChecked=0, Total=11990 [2024-11-09 06:59:55,305 INFO L87 Difference]: Start difference. First operand 2986 states and 3594 transitions. Second operand has 45 states, 34 states have (on average 5.4411764705882355) internal successors, (185), 36 states have internal predecessors, (185), 16 states have call successors, (50), 4 states have call predecessors, (50), 14 states have return successors, (49), 18 states have call predecessors, (49), 16 states have call successors, (49) [2024-11-09 06:59:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:56,942 INFO L93 Difference]: Finished difference Result 5903 states and 7164 transitions. [2024-11-09 06:59:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 06:59:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 5.4411764705882355) internal successors, (185), 36 states have internal predecessors, (185), 16 states have call successors, (50), 4 states have call predecessors, (50), 14 states have return successors, (49), 18 states have call predecessors, (49), 16 states have call successors, (49) Word has length 143 [2024-11-09 06:59:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:56,957 INFO L225 Difference]: With dead ends: 5903 [2024-11-09 06:59:56,957 INFO L226 Difference]: Without dead ends: 3127 [2024-11-09 06:59:56,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 338 SyntacticMatches, 18 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4262 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=786, Invalid=13256, Unknown=0, NotChecked=0, Total=14042 [2024-11-09 06:59:56,965 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 101 mSDsluCounter, 6436 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 6654 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:56,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 6654 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:59:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2024-11-09 06:59:57,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2877. [2024-11-09 06:59:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2113 states have (on average 1.1973497397065784) internal successors, (2530), 2138 states have internal predecessors, (2530), 470 states have call successors, (470), 293 states have call predecessors, (470), 293 states have return successors, (470), 445 states have call predecessors, (470), 470 states have call successors, (470) [2024-11-09 06:59:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3470 transitions. [2024-11-09 06:59:57,335 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3470 transitions. Word has length 143 [2024-11-09 06:59:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:57,336 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 3470 transitions. [2024-11-09 06:59:57,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 5.4411764705882355) internal successors, (185), 36 states have internal predecessors, (185), 16 states have call successors, (50), 4 states have call predecessors, (50), 14 states have return successors, (49), 18 states have call predecessors, (49), 16 states have call successors, (49) [2024-11-09 06:59:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3470 transitions. [2024-11-09 06:59:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 06:59:57,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:57,341 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:57,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:57,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 06:59:57,542 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:59:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash -694937107, now seen corresponding path program 1 times [2024-11-09 06:59:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:59:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447937330] [2024-11-09 06:59:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 06:59:57,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:59:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447937330] [2024-11-09 06:59:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447937330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568359185] [2024-11-09 06:59:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:57,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:57,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:59:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:59:58,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 66 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:59:59,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:00:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 07:00:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568359185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:00:00,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389518313] [2024-11-09 07:00:00,623 INFO L159 IcfgInterpreter]: Started Sifa with 79 locations of interest [2024-11-09 07:00:00,623 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:00:00,624 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:00:00,624 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:00:00,624 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:00:11,383 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 72 for LOIs [2024-11-09 07:00:11,632 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:00:11,633 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 40 for LOIs [2024-11-09 07:00:11,681 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 144 for LOIs [2024-11-09 07:00:12,295 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 74 for LOIs [2024-11-09 07:00:12,360 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 16 for LOIs [2024-11-09 07:00:12,366 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:00:28,919 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '167777#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_14| Int)) (and (<= 0 ~side2Failed_History_0~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_14| 0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_30| Int) (|v_ULTIMATE.start_check_#t~ret16#1_33| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_#t~ret16#1_33| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_45| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_38| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_38| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_45| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_45|) (<= |v_ULTIMATE.start_check_#t~ret15#1_45| 1))) (= |v_ULTIMATE.start_check_~tmp___8~0#1_30| 0))) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 07:00:28,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:00:28,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:00:28,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 17] total 33 [2024-11-09 07:00:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859263265] [2024-11-09 07:00:28,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:00:28,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:00:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:00:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:00:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=8166, Unknown=0, NotChecked=0, Total=8742 [2024-11-09 07:00:28,923 INFO L87 Difference]: Start difference. First operand 2877 states and 3470 transitions. Second operand has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 32 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:00:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:00:37,143 INFO L93 Difference]: Finished difference Result 8389 states and 10215 transitions. [2024-11-09 07:00:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-09 07:00:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 32 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 146 [2024-11-09 07:00:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:00:37,170 INFO L225 Difference]: With dead ends: 8389 [2024-11-09 07:00:37,170 INFO L226 Difference]: Without dead ends: 5730 [2024-11-09 07:00:37,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 361 SyntacticMatches, 7 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9444 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=2217, Invalid=21653, Unknown=0, NotChecked=0, Total=23870 [2024-11-09 07:00:37,182 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4489 mSDsluCounter, 5414 mSDsCounter, 0 mSdLazyCounter, 3660 mSolverCounterSat, 1712 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1712 IncrementalHoareTripleChecker+Valid, 3660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:00:37,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 5905 Invalid, 5372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1712 Valid, 3660 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 07:00:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2024-11-09 07:00:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5363. [2024-11-09 07:00:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 3952 states have (on average 1.1938259109311742) internal successors, (4718), 3995 states have internal predecessors, (4718), 867 states have call successors, (867), 543 states have call predecessors, (867), 543 states have return successors, (867), 824 states have call predecessors, (867), 867 states have call successors, (867) [2024-11-09 07:00:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 6452 transitions. [2024-11-09 07:00:38,120 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 6452 transitions. Word has length 146 [2024-11-09 07:00:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:00:38,121 INFO L471 AbstractCegarLoop]: Abstraction has 5363 states and 6452 transitions. [2024-11-09 07:00:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.515151515151516) internal successors, (215), 32 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:00:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 6452 transitions. [2024-11-09 07:00:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 07:00:38,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:00:38,129 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:38,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:00:38,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:00:38,333 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:00:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash 788541837, now seen corresponding path program 1 times [2024-11-09 07:00:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:00:38,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945251325] [2024-11-09 07:00:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 07:00:39,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:00:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945251325] [2024-11-09 07:00:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945251325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:00:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297183934] [2024-11-09 07:00:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:39,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:00:39,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:00:39,206 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:00:39,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:00:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:39,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:00:39,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:00:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 24 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:00:39,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:00:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 07:00:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297183934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:00:40,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1133607600] [2024-11-09 07:00:40,024 INFO L159 IcfgInterpreter]: Started Sifa with 81 locations of interest [2024-11-09 07:00:40,024 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:00:40,025 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:00:40,025 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:00:40,025 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:00:56,745 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 07:00:56,760 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:00:56,761 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-09 07:00:56,813 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-09 07:00:57,379 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-09 07:00:57,449 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-09 07:00:57,456 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:01:12,659 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '187621#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_25| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_25| 0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_38| Int) (|v_ULTIMATE.start_check_#t~ret16#1_42| Int)) (and (= ~side2Failed_History_1~0 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_38| 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_57| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_48| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_57| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_57|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_57| 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_48| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_42| 0)))))' at error location [2024-11-09 07:01:12,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:01:12,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:01:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-09 07:01:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622456652] [2024-11-09 07:01:12,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:01:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:01:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:01:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:01:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=7096, Unknown=0, NotChecked=0, Total=7482 [2024-11-09 07:01:12,663 INFO L87 Difference]: Start difference. First operand 5363 states and 6452 transitions. Second operand has 24 states, 24 states have (on average 9.0) internal successors, (216), 22 states have internal predecessors, (216), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-09 07:01:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:01:19,297 INFO L93 Difference]: Finished difference Result 13007 states and 15607 transitions. [2024-11-09 07:01:19,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-09 07:01:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.0) internal successors, (216), 22 states have internal predecessors, (216), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) Word has length 146 [2024-11-09 07:01:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:01:19,337 INFO L225 Difference]: With dead ends: 13007 [2024-11-09 07:01:19,337 INFO L226 Difference]: Without dead ends: 9347 [2024-11-09 07:01:19,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 383 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8170 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=1488, Invalid=21162, Unknown=0, NotChecked=0, Total=22650 [2024-11-09 07:01:19,351 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1621 mSDsluCounter, 4517 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:01:19,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 4952 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 07:01:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2024-11-09 07:01:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 6193. [2024-11-09 07:01:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6193 states, 4582 states have (on average 1.1951113051069402) internal successors, (5476), 4632 states have internal predecessors, (5476), 982 states have call successors, (982), 628 states have call predecessors, (982), 628 states have return successors, (982), 932 states have call predecessors, (982), 982 states have call successors, (982) [2024-11-09 07:01:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 7440 transitions. [2024-11-09 07:01:20,517 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 7440 transitions. Word has length 146 [2024-11-09 07:01:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:01:20,517 INFO L471 AbstractCegarLoop]: Abstraction has 6193 states and 7440 transitions. [2024-11-09 07:01:20,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.0) internal successors, (216), 22 states have internal predecessors, (216), 9 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2024-11-09 07:01:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 7440 transitions. [2024-11-09 07:01:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 07:01:20,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:01:20,526 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:20,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:01:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-09 07:01:20,726 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:01:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -661766810, now seen corresponding path program 1 times [2024-11-09 07:01:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:01:20,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207342493] [2024-11-09 07:01:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 07:01:20,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:01:20,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207342493] [2024-11-09 07:01:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207342493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:20,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:01:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559540098] [2024-11-09 07:01:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:20,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:01:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:01:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:01:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:01:20,958 INFO L87 Difference]: Start difference. First operand 6193 states and 7440 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 07:01:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:01:23,119 INFO L93 Difference]: Finished difference Result 17312 states and 20854 transitions. [2024-11-09 07:01:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:01:23,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 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 147 [2024-11-09 07:01:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:01:23,169 INFO L225 Difference]: With dead ends: 17312 [2024-11-09 07:01:23,169 INFO L226 Difference]: Without dead ends: 12104 [2024-11-09 07:01:23,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:01:23,182 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 194 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:01:23,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1897 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:01:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2024-11-09 07:01:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 9198. [2024-11-09 07:01:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9198 states, 6751 states have (on average 1.1888609094948897) internal successors, (8026), 6829 states have internal predecessors, (8026), 1510 states have call successors, (1510), 936 states have call predecessors, (1510), 936 states have return successors, (1510), 1432 states have call predecessors, (1510), 1510 states have call successors, (1510) [2024-11-09 07:01:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9198 states to 9198 states and 11046 transitions. [2024-11-09 07:01:24,820 INFO L78 Accepts]: Start accepts. Automaton has 9198 states and 11046 transitions. Word has length 147 [2024-11-09 07:01:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:01:24,821 INFO L471 AbstractCegarLoop]: Abstraction has 9198 states and 11046 transitions. [2024-11-09 07:01:24,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 07:01:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9198 states and 11046 transitions. [2024-11-09 07:01:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 07:01:24,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:01:24,834 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 07:01:24,835 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:01:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1422422126, now seen corresponding path program 1 times [2024-11-09 07:01:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:01:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135678023] [2024-11-09 07:01:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 07:01:26,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:01:26,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135678023] [2024-11-09 07:01:26,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135678023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:01:26,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189476154] [2024-11-09 07:01:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:01:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:01:26,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:01:26,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:01:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:26,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:01:26,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:01:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 23 proven. 55 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:01:26,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:01:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 07:01:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189476154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:01:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [41537017] [2024-11-09 07:01:27,413 INFO L159 IcfgInterpreter]: Started Sifa with 81 locations of interest [2024-11-09 07:01:27,413 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:01:27,413 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:01:27,413 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:01:27,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:01:38,656 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 16 for LOIs [2024-11-09 07:01:38,670 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:01:38,671 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 44 for LOIs [2024-11-09 07:01:38,718 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 146 for LOIs [2024-11-09 07:01:39,282 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 76 for LOIs [2024-11-09 07:01:39,346 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 20 for LOIs [2024-11-09 07:01:39,351 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:01:56,698 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '251139#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_34| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~manual_selection_History_1~0 127) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (not (= 2 ~active_side_History_0~0)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_34| 0) (<= 0 (+ ~manual_selection_History_1~0 128)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_45| Int) (|v_ULTIMATE.start_check_#t~ret16#1_50| Int)) (and (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_69| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_58| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_69| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_69| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_69|) (= |v_ULTIMATE.start_check_~tmp___7~0#1_58| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_50| 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_45| 0))) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 07:01:56,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:01:56,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:01:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 31 [2024-11-09 07:01:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220912796] [2024-11-09 07:01:56,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:01:56,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:01:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:01:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:01:56,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=8334, Unknown=0, NotChecked=0, Total=8742 [2024-11-09 07:01:56,703 INFO L87 Difference]: Start difference. First operand 9198 states and 11046 transitions. Second operand has 31 states, 30 states have (on average 7.633333333333334) internal successors, (229), 28 states have internal predecessors, (229), 11 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (50), 13 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:02:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:02:06,975 INFO L93 Difference]: Finished difference Result 22400 states and 26729 transitions. [2024-11-09 07:02:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-09 07:02:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 7.633333333333334) internal successors, (229), 28 states have internal predecessors, (229), 11 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (50), 13 states have call predecessors, (50), 11 states have call successors, (50) Word has length 148 [2024-11-09 07:02:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:02:07,031 INFO L225 Difference]: With dead ends: 22400 [2024-11-09 07:02:07,031 INFO L226 Difference]: Without dead ends: 14891 [2024-11-09 07:02:07,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 369 SyntacticMatches, 9 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8551 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=1815, Invalid=23945, Unknown=0, NotChecked=0, Total=25760 [2024-11-09 07:02:07,050 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 1512 mSDsluCounter, 8680 mSDsCounter, 0 mSdLazyCounter, 5159 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 9334 SdHoareTripleChecker+Invalid, 5672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 5159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:02:07,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 9334 Invalid, 5672 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [513 Valid, 5159 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 07:02:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2024-11-09 07:02:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 7838. [2024-11-09 07:02:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7838 states, 5749 states have (on average 1.1805531396764655) internal successors, (6787), 5818 states have internal predecessors, (6787), 1281 states have call successors, (1281), 807 states have call predecessors, (1281), 807 states have return successors, (1281), 1212 states have call predecessors, (1281), 1281 states have call successors, (1281) [2024-11-09 07:02:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 9349 transitions. [2024-11-09 07:02:08,682 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 9349 transitions. Word has length 148 [2024-11-09 07:02:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:02:08,683 INFO L471 AbstractCegarLoop]: Abstraction has 7838 states and 9349 transitions. [2024-11-09 07:02:08,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 7.633333333333334) internal successors, (229), 28 states have internal predecessors, (229), 11 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (50), 13 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:02:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 9349 transitions. [2024-11-09 07:02:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 07:02:08,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:02:08,692 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:08,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:02:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 07:02:08,893 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:02:08,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -23323221, now seen corresponding path program 1 times [2024-11-09 07:02:08,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:02:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129001706] [2024-11-09 07:02:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 07:02:09,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:02:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129001706] [2024-11-09 07:02:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129001706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:02:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514114133] [2024-11-09 07:02:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:02:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:02:09,625 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:02:09,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:02:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:09,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:02:09,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:02:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 59 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:02:10,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:02:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 07:02:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514114133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:02:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1405742779] [2024-11-09 07:02:11,170 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2024-11-09 07:02:11,170 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:02:11,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:02:11,171 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:02:11,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:02:35,030 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 6 for LOIs [2024-11-09 07:02:35,039 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 1 for LOIs [2024-11-09 07:02:35,039 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 6 for LOIs [2024-11-09 07:02:35,049 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 130 for LOIs [2024-11-09 07:02:35,423 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 57 for LOIs [2024-11-09 07:02:35,462 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 89 for LOIs [2024-11-09 07:02:35,907 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:02:55,666 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '293692#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_45| Int)) (and (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (not (= 2 ~active_side_History_0~0)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_45| 0) (exists ((|v_ULTIMATE.start_check_#t~ret16#1_58| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_52| Int)) (and (= |v_ULTIMATE.start_check_#t~ret16#1_58| 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_68| Int) (|v_ULTIMATE.start_check_#t~ret15#1_81| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_81| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_81| 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_68| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_81|))) (= (mod ~side2Failed_History_1~0 256) 0) (= |v_ULTIMATE.start_check_~tmp___8~0#1_52| 0))) (<= 0 (+ ~active_side_History_0~0 128))))' at error location [2024-11-09 07:02:55,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:02:55,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:02:55,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 24 [2024-11-09 07:02:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119662787] [2024-11-09 07:02:55,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:02:55,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:02:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:02:55,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:02:55,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=7135, Unknown=0, NotChecked=0, Total=7482 [2024-11-09 07:02:55,670 INFO L87 Difference]: Start difference. First operand 7838 states and 9349 transitions. Second operand has 24 states, 24 states have (on average 7.75) internal successors, (186), 23 states have internal predecessors, (186), 8 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 9 states have call predecessors, (37), 8 states have call successors, (37) [2024-11-09 07:03:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:00,182 INFO L93 Difference]: Finished difference Result 19343 states and 23195 transitions. [2024-11-09 07:03:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 07:03:00,183 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 23 states have internal predecessors, (186), 8 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 9 states have call predecessors, (37), 8 states have call successors, (37) Word has length 149 [2024-11-09 07:03:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:00,227 INFO L225 Difference]: With dead ends: 19343 [2024-11-09 07:03:00,227 INFO L226 Difference]: Without dead ends: 11790 [2024-11-09 07:03:00,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 368 SyntacticMatches, 9 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=685, Invalid=12197, Unknown=0, NotChecked=0, Total=12882 [2024-11-09 07:03:00,244 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 956 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:00,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 2766 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:03:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2024-11-09 07:03:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11630. [2024-11-09 07:03:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11630 states, 8594 states have (on average 1.1880381661624388) internal successors, (10210), 8692 states have internal predecessors, (10210), 1846 states have call successors, (1846), 1189 states have call predecessors, (1846), 1189 states have return successors, (1846), 1748 states have call predecessors, (1846), 1846 states have call successors, (1846) [2024-11-09 07:03:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11630 states to 11630 states and 13902 transitions. [2024-11-09 07:03:02,714 INFO L78 Accepts]: Start accepts. Automaton has 11630 states and 13902 transitions. Word has length 149 [2024-11-09 07:03:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:02,714 INFO L471 AbstractCegarLoop]: Abstraction has 11630 states and 13902 transitions. [2024-11-09 07:03:02,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 23 states have internal predecessors, (186), 8 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 9 states have call predecessors, (37), 8 states have call successors, (37) [2024-11-09 07:03:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11630 states and 13902 transitions. [2024-11-09 07:03:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 07:03:02,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:02,728 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:02,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:03:02,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:02,932 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:03:02,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1537252102, now seen corresponding path program 1 times [2024-11-09 07:03:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:02,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706776070] [2024-11-09 07:03:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 07:03:03,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:03:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706776070] [2024-11-09 07:03:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706776070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:03:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024695566] [2024-11-09 07:03:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:03,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:03,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:03:03,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:03:03,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:03:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:04,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 07:03:04,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:03:05,094 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 07:03:05,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:03:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-09 07:03:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024695566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:03:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [782608818] [2024-11-09 07:03:06,537 INFO L159 IcfgInterpreter]: Started Sifa with 81 locations of interest [2024-11-09 07:03:06,537 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:03:06,537 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:03:06,538 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:03:06,538 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:03:23,817 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 19 for LOIs [2024-11-09 07:03:23,833 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:03:23,834 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 21 for LOIs [2024-11-09 07:03:23,851 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 142 for LOIs [2024-11-09 07:03:24,433 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 72 for LOIs [2024-11-09 07:03:24,494 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 72 for LOIs [2024-11-09 07:03:24,645 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:03:43,148 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '336986#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_56| Int)) (and (exists ((|v_ULTIMATE.start_check_#t~ret16#1_66| Int) (|v_ULTIMATE.start_check_~tmp___8~0#1_59| Int)) (and (= |v_ULTIMATE.start_check_~tmp___8~0#1_59| 0) (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_78| Int) (|v_ULTIMATE.start_check_#t~ret15#1_93| Int)) (and (<= |v_ULTIMATE.start_check_#t~ret15#1_93| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_93|) (not (= |v_ULTIMATE.start_check_#t~ret15#1_93| 0)) (= |v_ULTIMATE.start_check_~tmp___7~0#1_78| 1))) (= |v_ULTIMATE.start_check_#t~ret16#1_66| 0))) (<= 0 ~side2Failed_History_0~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_56| 0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~active_side_History_1~0 127) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (not (= 2 ~active_side_History_0~0)) (<= 0 (+ ~active_side_History_1~0 128)) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 07:03:43,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:03:43,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:03:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 18] total 35 [2024-11-09 07:03:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174940254] [2024-11-09 07:03:43,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:03:43,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:03:43,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:03:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:03:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=8599, Unknown=0, NotChecked=0, Total=9120 [2024-11-09 07:03:43,153 INFO L87 Difference]: Start difference. First operand 11630 states and 13902 transitions. Second operand has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 34 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:03:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:03:54,562 INFO L93 Difference]: Finished difference Result 25736 states and 30807 transitions. [2024-11-09 07:03:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-09 07:03:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 34 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) Word has length 149 [2024-11-09 07:03:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:03:54,614 INFO L225 Difference]: With dead ends: 25736 [2024-11-09 07:03:54,614 INFO L226 Difference]: Without dead ends: 14614 [2024-11-09 07:03:54,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 369 SyntacticMatches, 10 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10200 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=1686, Invalid=24720, Unknown=0, NotChecked=0, Total=26406 [2024-11-09 07:03:54,640 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 1817 mSDsluCounter, 6210 mSDsCounter, 0 mSdLazyCounter, 3988 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 6616 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 3988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:03:54,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 6616 Invalid, 4624 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [636 Valid, 3988 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 07:03:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14614 states. [2024-11-09 07:03:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14614 to 12905. [2024-11-09 07:03:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12905 states, 9527 states have (on average 1.1848430775690144) internal successors, (11288), 9638 states have internal predecessors, (11288), 2053 states have call successors, (2053), 1324 states have call predecessors, (2053), 1324 states have return successors, (2053), 1942 states have call predecessors, (2053), 2053 states have call successors, (2053) [2024-11-09 07:03:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12905 states to 12905 states and 15394 transitions. [2024-11-09 07:03:57,511 INFO L78 Accepts]: Start accepts. Automaton has 12905 states and 15394 transitions. Word has length 149 [2024-11-09 07:03:57,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:03:57,512 INFO L471 AbstractCegarLoop]: Abstraction has 12905 states and 15394 transitions. [2024-11-09 07:03:57,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.142857142857143) internal successors, (215), 34 states have internal predecessors, (215), 11 states have call successors, (51), 5 states have call predecessors, (51), 7 states have return successors, (50), 12 states have call predecessors, (50), 11 states have call successors, (50) [2024-11-09 07:03:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 12905 states and 15394 transitions. [2024-11-09 07:03:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 07:03:57,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:03:57,520 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:57,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:03:57,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:03:57,721 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:03:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2045782017, now seen corresponding path program 1 times [2024-11-09 07:03:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:03:57,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750210006] [2024-11-09 07:03:57,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 07:04:00,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:04:00,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750210006] [2024-11-09 07:04:00,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750210006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:04:00,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823608927] [2024-11-09 07:04:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:04:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:04:00,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:04:00,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:04:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:00,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:04:00,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:04:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 79 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 07:04:01,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:04:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 07:04:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823608927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:04:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812523099] [2024-11-09 07:04:02,566 INFO L159 IcfgInterpreter]: Started Sifa with 81 locations of interest [2024-11-09 07:04:02,566 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:04:02,566 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:04:02,567 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:04:02,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:04:11,373 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 66 for LOIs [2024-11-09 07:04:11,558 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:04:11,559 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-09 07:04:11,575 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 140 for LOIs [2024-11-09 07:04:12,094 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 68 for LOIs [2024-11-09 07:04:12,149 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 07:04:12,292 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:04:35,462 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '390836#(exists ((|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_65| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (exists ((|v_ULTIMATE.start_check_~tmp___8~0#1_66| Int) (|v_ULTIMATE.start_check_#t~ret16#1_74| Int)) (and (= |v_ULTIMATE.start_check_~tmp___8~0#1_66| 0) (= |v_ULTIMATE.start_check_#t~ret16#1_74| 0) (= ~side2Failed_History_1~0 0) (exists ((|v_ULTIMATE.start_check_#t~ret15#1_104| Int) (|v_ULTIMATE.start_check_~tmp___7~0#1_87| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_87| 1) (<= |v_ULTIMATE.start_check_#t~ret15#1_104| 1) (not (= |v_ULTIMATE.start_check_#t~ret15#1_104| 0)) (<= 0 |v_ULTIMATE.start_check_#t~ret15#1_104|))))) (= ~side2_written~0 0) (not (= 2 ~active_side_History_0~0)) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_65| 0) (<= 0 (+ ~active_side_History_0~0 128)) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 07:04:35,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:04:35,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:04:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 16] total 33 [2024-11-09 07:04:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566737564] [2024-11-09 07:04:35,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:04:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:04:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:04:35,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:04:35,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=555, Invalid=8757, Unknown=0, NotChecked=0, Total=9312 [2024-11-09 07:04:35,465 INFO L87 Difference]: Start difference. First operand 12905 states and 15394 transitions. Second operand has 33 states, 33 states have (on average 5.787878787878788) internal successors, (191), 32 states have internal predecessors, (191), 10 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 07:04:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:04:52,193 INFO L93 Difference]: Finished difference Result 33844 states and 40446 transitions. [2024-11-09 07:04:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2024-11-09 07:04:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.787878787878788) internal successors, (191), 32 states have internal predecessors, (191), 10 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) Word has length 151 [2024-11-09 07:04:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:04:52,264 INFO L225 Difference]: With dead ends: 33844 [2024-11-09 07:04:52,265 INFO L226 Difference]: Without dead ends: 21353 [2024-11-09 07:04:52,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 393 SyntacticMatches, 7 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20422 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=3417, Invalid=47885, Unknown=0, NotChecked=0, Total=51302 [2024-11-09 07:04:52,295 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 2515 mSDsluCounter, 4697 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 882 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2517 SdHoareTripleChecker+Valid, 5046 SdHoareTripleChecker+Invalid, 4561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:04:52,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2517 Valid, 5046 Invalid, 4561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [882 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 07:04:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21353 states. [2024-11-09 07:04:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21353 to 13493. [2024-11-09 07:04:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 9985 states have (on average 1.183174762143215) internal successors, (11814), 10099 states have internal predecessors, (11814), 2126 states have call successors, (2126), 1381 states have call predecessors, (2126), 1381 states have return successors, (2126), 2012 states have call predecessors, (2126), 2126 states have call successors, (2126) [2024-11-09 07:04:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 16066 transitions. [2024-11-09 07:04:55,841 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 16066 transitions. Word has length 151 [2024-11-09 07:04:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:04:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 16066 transitions. [2024-11-09 07:04:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.787878787878788) internal successors, (191), 32 states have internal predecessors, (191), 10 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-09 07:04:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 16066 transitions. [2024-11-09 07:04:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 07:04:55,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:04:55,849 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:04:55,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:04:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:04:56,050 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:04:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:04:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 628497683, now seen corresponding path program 1 times [2024-11-09 07:04:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:04:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137044803] [2024-11-09 07:04:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:04:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:04:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:04:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 07:04:56,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:04:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137044803] [2024-11-09 07:04:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137044803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:04:56,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:04:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:04:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089939566] [2024-11-09 07:04:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:04:56,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:04:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:04:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:04:56,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:04:56,268 INFO L87 Difference]: Start difference. First operand 13493 states and 16066 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 07:05:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:01,434 INFO L93 Difference]: Finished difference Result 35110 states and 41858 transitions. [2024-11-09 07:05:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:05:01,435 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-09 07:05:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:01,500 INFO L225 Difference]: With dead ends: 35110 [2024-11-09 07:05:01,500 INFO L226 Difference]: Without dead ends: 22098 [2024-11-09 07:05:01,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:05:01,521 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 191 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:01,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1954 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:05:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22098 states. [2024-11-09 07:05:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22098 to 20114. [2024-11-09 07:05:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20114 states, 14782 states have (on average 1.1733865512109323) internal successors, (17345), 14962 states have internal predecessors, (17345), 3251 states have call successors, (3251), 2080 states have call predecessors, (3251), 2080 states have return successors, (3251), 3071 states have call predecessors, (3251), 3251 states have call successors, (3251) [2024-11-09 07:05:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20114 states to 20114 states and 23847 transitions. [2024-11-09 07:05:06,514 INFO L78 Accepts]: Start accepts. Automaton has 20114 states and 23847 transitions. Word has length 154 [2024-11-09 07:05:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:06,514 INFO L471 AbstractCegarLoop]: Abstraction has 20114 states and 23847 transitions. [2024-11-09 07:05:06,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 07:05:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20114 states and 23847 transitions. [2024-11-09 07:05:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 07:05:06,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:06,522 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 07:05:06,522 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1699400876, now seen corresponding path program 1 times [2024-11-09 07:05:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059899304] [2024-11-09 07:05:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-09 07:05:07,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059899304] [2024-11-09 07:05:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059899304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576411904] [2024-11-09 07:05:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:07,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:07,477 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:07,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:05:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:07,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:05:07,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 07:05:07,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:05:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576411904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:05:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:05:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-11-09 07:05:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658501540] [2024-11-09 07:05:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:05:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:05:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:05:07,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:05:07,948 INFO L87 Difference]: Start difference. First operand 20114 states and 23847 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 07:05:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:13,489 INFO L93 Difference]: Finished difference Result 40021 states and 47474 transitions. [2024-11-09 07:05:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:05:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 155 [2024-11-09 07:05:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:13,555 INFO L225 Difference]: With dead ends: 40021 [2024-11-09 07:05:13,555 INFO L226 Difference]: Without dead ends: 20116 [2024-11-09 07:05:13,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:05:13,581 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 337 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:13,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1912 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:05:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20116 states. [2024-11-09 07:05:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20116 to 20114. [2024-11-09 07:05:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20114 states, 14782 states have (on average 1.1689216614801785) internal successors, (17279), 14962 states have internal predecessors, (17279), 3251 states have call successors, (3251), 2080 states have call predecessors, (3251), 2080 states have return successors, (3251), 3071 states have call predecessors, (3251), 3251 states have call successors, (3251) [2024-11-09 07:05:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20114 states to 20114 states and 23781 transitions. [2024-11-09 07:05:18,470 INFO L78 Accepts]: Start accepts. Automaton has 20114 states and 23781 transitions. Word has length 155 [2024-11-09 07:05:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:05:18,470 INFO L471 AbstractCegarLoop]: Abstraction has 20114 states and 23781 transitions. [2024-11-09 07:05:18,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (15), 3 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 07:05:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20114 states and 23781 transitions. [2024-11-09 07:05:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 07:05:18,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:05:18,476 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:05:18,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:05:18,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 07:05:18,677 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:05:18,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:05:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 559170021, now seen corresponding path program 1 times [2024-11-09 07:05:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:05:18,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857542005] [2024-11-09 07:05:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:18,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:05:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 07:05:19,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:05:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857542005] [2024-11-09 07:05:19,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857542005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:05:19,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374749254] [2024-11-09 07:05:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:05:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:05:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:05:19,636 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:05:19,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:05:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:05:19,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:05:19,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:05:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 32 proven. 76 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 07:05:20,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:05:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 07:05:20,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374749254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:05:20,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1881377674] [2024-11-09 07:05:20,621 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2024-11-09 07:05:20,621 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:05:20,621 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:05:20,622 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:05:20,622 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:05:27,568 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 07:05:27,574 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-09 07:05:31,861 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 18 for LOIs [2024-11-09 07:05:31,879 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 8 for LOIs [2024-11-09 07:05:31,880 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 17 for LOIs [2024-11-09 07:05:31,899 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 122 for LOIs [2024-11-09 07:05:32,823 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 49 for LOIs [2024-11-09 07:05:32,860 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 68 for LOIs [2024-11-09 07:05:33,024 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:05:52,855 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '614793#(exists ((|v_ULTIMATE.start_check_~tmp~3#1_87| Int) (|v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_70| Int)) (and (<= 0 ~side2Failed_History_0~0) (<= ~active_side_History_0~0 127) (= |assert_#in~arg| 0) (not (= ~active_side_History_0~0 1)) (<= 0 ~side2Failed_History_1~0) (<= ~side2Failed_History_1~0 1) (<= ~side2Failed_History_0~0 1) (<= 0 ~side2Failed_History_2~0) (= |v_ULTIMATE.start_main_~c1~0#1_BEFORE_CALL_70| 0) (= ~side2_written~0 0) (exists ((|v_ULTIMATE.start_check_~tmp___12~0#1_80| Int) (|v_ULTIMATE.start_check_#t~ret20#1_88| Int)) (and (not (= |v_ULTIMATE.start_check_#t~ret20#1_88| 0)) (exists ((|v_ULTIMATE.start_check_~tmp___7~0#1_96| Int) (|v_ULTIMATE.start_check_#t~ret15#1_115| Int)) (and (= |v_ULTIMATE.start_check_~tmp___7~0#1_96| 0) (= |v_ULTIMATE.start_check_#t~ret15#1_115| 0))) (<= |v_ULTIMATE.start_check_#t~ret20#1_88| 1) (<= 0 |v_ULTIMATE.start_check_#t~ret20#1_88|) (exists ((|v_ULTIMATE.start_check_#t~ret19#1_91| Int) (|v_ULTIMATE.start_check_~tmp___11~0#1_80| Int)) (and (= |v_ULTIMATE.start_check_#t~ret19#1_91| 0) (= |v_ULTIMATE.start_check_~tmp___11~0#1_80| 0))) (= |v_ULTIMATE.start_check_~tmp___12~0#1_80| 1) (not (= ~side2Failed_History_1~0 0)))) (<= 0 (+ ~active_side_History_0~0 128)) (= |v_ULTIMATE.start_check_~tmp~3#1_87| 1) (<= ~side2Failed_History_2~0 1)))' at error location [2024-11-09 07:05:52,855 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:05:52,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:05:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 8] total 23 [2024-11-09 07:05:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537919262] [2024-11-09 07:05:52,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:05:52,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:05:52,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:05:52,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:05:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=6864, Unknown=0, NotChecked=0, Total=7310 [2024-11-09 07:05:52,858 INFO L87 Difference]: Start difference. First operand 20114 states and 23781 transitions. Second operand has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 20 states have internal predecessors, (223), 9 states have call successors, (46), 4 states have call predecessors, (46), 8 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) [2024-11-09 07:05:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:05:58,932 INFO L93 Difference]: Finished difference Result 35719 states and 42025 transitions. [2024-11-09 07:05:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:05:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 20 states have internal predecessors, (223), 9 states have call successors, (46), 4 states have call predecessors, (46), 8 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) Word has length 159 [2024-11-09 07:05:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:05:58,997 INFO L225 Difference]: With dead ends: 35719 [2024-11-09 07:05:58,997 INFO L226 Difference]: Without dead ends: 15782 [2024-11-09 07:05:59,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 402 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4232 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=728, Invalid=11044, Unknown=0, NotChecked=0, Total=11772 [2024-11-09 07:05:59,041 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1195 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:05:59,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 3224 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:05:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15782 states. [2024-11-09 07:06:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15782 to 12989. [2024-11-09 07:06:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12989 states, 9625 states have (on average 1.1471168831168832) internal successors, (11041), 9748 states have internal predecessors, (11041), 1958 states have call successors, (1958), 1405 states have call predecessors, (1958), 1405 states have return successors, (1958), 1835 states have call predecessors, (1958), 1958 states have call successors, (1958) [2024-11-09 07:06:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12989 states to 12989 states and 14957 transitions. [2024-11-09 07:06:02,594 INFO L78 Accepts]: Start accepts. Automaton has 12989 states and 14957 transitions. Word has length 159 [2024-11-09 07:06:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:06:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 12989 states and 14957 transitions. [2024-11-09 07:06:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.695652173913043) internal successors, (223), 20 states have internal predecessors, (223), 9 states have call successors, (46), 4 states have call predecessors, (46), 8 states have return successors, (45), 12 states have call predecessors, (45), 9 states have call successors, (45) [2024-11-09 07:06:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12989 states and 14957 transitions. [2024-11-09 07:06:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 07:06:02,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:06:02,601 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 07:06:02,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:06:02,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 07:06:02,802 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:06:02,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:06:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1588602310, now seen corresponding path program 1 times [2024-11-09 07:06:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:06:02,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024296632] [2024-11-09 07:06:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:06:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:06:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:03,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:06:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:06:03,286 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:06:03,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:06:03,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:06:03,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 07:06:03,298 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:06:03,520 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:06:03,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:06:03 BoogieIcfgContainer [2024-11-09 07:06:03,526 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:06:03,527 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:06:03,527 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:06:03,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:06:03,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:29" (3/4) ... [2024-11-09 07:06:03,529 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:06:03,731 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 07:06:03,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:06:03,733 INFO L158 Benchmark]: Toolchain (without parser) took 636498.50ms. Allocated memory was 180.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 146.5MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-09 07:06:03,733 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:06:03,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.04ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 138.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 07:06:03,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.06ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 134.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:06:03,738 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 131.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:06:03,738 INFO L158 Benchmark]: RCFGBuilder took 1237.02ms. Allocated memory is still 180.4MB. Free memory was 131.1MB in the beginning and 122.8MB in the end (delta: 8.3MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-09 07:06:03,739 INFO L158 Benchmark]: TraceAbstraction took 634403.12ms. Allocated memory was 180.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 121.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 07:06:03,739 INFO L158 Benchmark]: Witness Printer took 204.67ms. Allocated memory is still 4.1GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 07:06:03,740 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.28ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.04ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 138.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.06ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 134.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.47ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 131.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1237.02ms. Allocated memory is still 180.4MB. Free memory was 131.1MB in the beginning and 122.8MB in the end (delta: 8.3MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 634403.12ms. Allocated memory was 180.4MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 121.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 204.67ms. Allocated memory is still 4.1GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: 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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND FALSE !(i2 < 10) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=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=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE i2 < 10 [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_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, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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, 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_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] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [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, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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, 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] [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, 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] [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] [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=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] [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] [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] [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, 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] [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] [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, 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] [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] [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, 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] [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] [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, 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] [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] [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] [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] [L617] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L606] i2 ++ 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=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] [L582] COND FALSE !(i2 < 10) 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=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] [L582] COND TRUE i2 < 10 [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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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] [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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=-1, manual_selection_History_0=0, 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, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection=-1, manual_selection_History_0=0, 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, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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] [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=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=-1, manual_selection_History_0=0, 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, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND FALSE !(! side1Failed) [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, 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=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, index=1, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [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=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=0, cs2=0, cs2_new=-1, cs2_old=0, manual_selection_History_0=0, 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, 152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 634.1s, OverallIterations: 40, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 93.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20093 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20015 mSDsluCounter, 81518 SdHoareTripleChecker+Invalid, 25.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70174 mSDsCounter, 5726 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29901 IncrementalHoareTripleChecker+Invalid, 35627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5726 mSolverCounterUnsat, 11344 mSDtfsCounter, 29901 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5825 GetRequests, 4076 SyntacticMatches, 95 SemanticMatches, 1654 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80708 ImplicationChecksByTransitivity, 316.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20114occurred in iteration=37, InterpolantAutomatonStates: 707, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 31254 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 5543 NumberOfCodeBlocks, 5543 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 6865 ConstructedInterpolants, 0 QuantifiedInterpolants, 27319 SizeOfPredicates, 119 NumberOfNonLiveVariables, 8121 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 65 InterpolantComputations, 27 PerfectInterpolantSequences, 3583/4169 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 07:06:03,963 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 07:06:04,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e4f629a-f8f1-4bdf-b5c8-4086c16e2d68/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE