./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 22:54:14,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 22:54:14,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 22:54:14,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 22:54:14,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 22:54:14,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 22:54:14,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 22:54:14,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 22:54:14,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 22:54:14,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 22:54:14,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 22:54:14,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 22:54:14,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 22:54:14,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 22:54:14,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 22:54:14,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 22:54:14,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:54:14,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:54:14,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 22:54:14,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 22:54:14,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2024-11-23 22:54:14,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 22:54:14,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 22:54:14,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 22:54:14,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 22:54:14,906 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 22:54:14,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-23 22:54:18,063 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/data/8bddb1fa1/527815374a0544c7ad99d4d6e6bfbb57/FLAG05a3b1845 [2024-11-23 22:54:18,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 22:54:18,449 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-23 22:54:18,471 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/data/8bddb1fa1/527815374a0544c7ad99d4d6e6bfbb57/FLAG05a3b1845 [2024-11-23 22:54:18,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/data/8bddb1fa1/527815374a0544c7ad99d4d6e6bfbb57 [2024-11-23 22:54:18,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 22:54:18,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 22:54:18,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 22:54:18,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 22:54:18,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 22:54:18,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:18" (1/1) ... [2024-11-23 22:54:18,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f443def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:18, skipping insertion in model container [2024-11-23 22:54:18,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:18" (1/1) ... [2024-11-23 22:54:18,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 22:54:19,000 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_41fbf8fa-4d1b-454a-a730-19006840521a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-11-23 22:54:19,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:54:19,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 22:54:19,090 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_41fbf8fa-4d1b-454a-a730-19006840521a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-11-23 22:54:19,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:54:19,115 INFO L204 MainTranslator]: Completed translation [2024-11-23 22:54:19,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19 WrapperNode [2024-11-23 22:54:19,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 22:54:19,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 22:54:19,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 22:54:19,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 22:54:19,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,199 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 501 [2024-11-23 22:54:19,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 22:54:19,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 22:54:19,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 22:54:19,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 22:54:19,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 22:54:19,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 22:54:19,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 22:54:19,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 22:54:19,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 22:54:19,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (1/1) ... [2024-11-23 22:54:19,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:54:19,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:54:19,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 22:54:19,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 22:54:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-23 22:54:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-23 22:54:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 22:54:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-23 22:54:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-23 22:54:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-23 22:54:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 22:54:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-23 22:54:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-23 22:54:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 22:54:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 22:54:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-23 22:54:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-23 22:54:19,574 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 22:54:19,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 22:54:20,484 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-23 22:54:20,484 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 22:54:20,512 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 22:54:20,513 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 22:54:20,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:20 BoogieIcfgContainer [2024-11-23 22:54:20,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 22:54:20,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 22:54:20,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 22:54:20,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 22:54:20,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:18" (1/3) ... [2024-11-23 22:54:20,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e684df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:20, skipping insertion in model container [2024-11-23 22:54:20,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:19" (2/3) ... [2024-11-23 22:54:20,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e684df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:20, skipping insertion in model container [2024-11-23 22:54:20,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:20" (3/3) ... [2024-11-23 22:54:20,530 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-23 22:54:20,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 22:54:20,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c that has 8 procedures, 178 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-23 22:54:20,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:54:20,670 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=PETRI_NET, 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;@51cc4593, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:54:20,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 22:54:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 140 states have internal predecessors, (214), 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-23 22:54:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-23 22:54:20,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:20,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:20,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:20,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -131107926, now seen corresponding path program 1 times [2024-11-23 22:54:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:20,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318309190] [2024-11-23 22:54:20,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:21,150 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-23 22:54:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318309190] [2024-11-23 22:54:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318309190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:21,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:21,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:54:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971049847] [2024-11-23 22:54:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:21,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 22:54:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:21,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 22:54:21,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 22:54:21,194 INFO L87 Difference]: Start difference. First operand has 178 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 140 states have internal predecessors, (214), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 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-23 22:54:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:21,258 INFO L93 Difference]: Finished difference Result 336 states and 549 transitions. [2024-11-23 22:54:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 22:54:21,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 28 [2024-11-23 22:54:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:21,274 INFO L225 Difference]: With dead ends: 336 [2024-11-23 22:54:21,274 INFO L226 Difference]: Without dead ends: 174 [2024-11-23 22:54:21,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 22:54:21,283 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:21,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-23 22:54:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-23 22:54:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.5333333333333334) internal successors, (207), 136 states have internal predecessors, (207), 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-23 22:54:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 269 transitions. [2024-11-23 22:54:21,351 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 269 transitions. Word has length 28 [2024-11-23 22:54:21,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:21,351 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 269 transitions. [2024-11-23 22:54:21,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 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-23 22:54:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 269 transitions. [2024-11-23 22:54:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-23 22:54:21,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:21,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 22:54:21,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash 87746792, now seen corresponding path program 1 times [2024-11-23 22:54:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557702497] [2024-11-23 22:54:21,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:21,859 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-23 22:54:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557702497] [2024-11-23 22:54:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557702497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 22:54:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706520840] [2024-11-23 22:54:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:54:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:21,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:54:21,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:54:21,864 INFO L87 Difference]: Start difference. First operand 174 states and 269 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 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-23 22:54:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:22,051 INFO L93 Difference]: Finished difference Result 334 states and 512 transitions. [2024-11-23 22:54:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:54:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 28 [2024-11-23 22:54:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:22,057 INFO L225 Difference]: With dead ends: 334 [2024-11-23 22:54:22,057 INFO L226 Difference]: Without dead ends: 174 [2024-11-23 22:54:22,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:54:22,062 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:22,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-23 22:54:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-23 22:54:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.4444444444444444) internal successors, (195), 136 states have internal predecessors, (195), 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-23 22:54:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2024-11-23 22:54:22,093 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 28 [2024-11-23 22:54:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:22,094 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-23 22:54:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 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-23 22:54:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2024-11-23 22:54:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-23 22:54:22,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:22,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 22:54:22,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:22,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash -475299443, now seen corresponding path program 1 times [2024-11-23 22:54:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281551521] [2024-11-23 22:54:22,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:22,515 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-23 22:54:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:22,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281551521] [2024-11-23 22:54:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281551521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:22,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412077409] [2024-11-23 22:54:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:22,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:22,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:22,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:22,520 INFO L87 Difference]: Start difference. First operand 174 states and 257 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-23 22:54:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:22,632 INFO L93 Difference]: Finished difference Result 335 states and 504 transitions. [2024-11-23 22:54:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2024-11-23 22:54:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:22,636 INFO L225 Difference]: With dead ends: 335 [2024-11-23 22:54:22,637 INFO L226 Difference]: Without dead ends: 178 [2024-11-23 22:54:22,639 INFO L434 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-23 22:54:22,641 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:22,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 743 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-23 22:54:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-23 22:54:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.434782608695652) internal successors, (198), 139 states have internal predecessors, (198), 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-23 22:54:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 260 transitions. [2024-11-23 22:54:22,682 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 260 transitions. Word has length 39 [2024-11-23 22:54:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 260 transitions. [2024-11-23 22:54:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-23 22:54:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 260 transitions. [2024-11-23 22:54:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-23 22:54:22,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:22,687 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-23 22:54:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 22:54:22,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:22,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1731358847, now seen corresponding path program 1 times [2024-11-23 22:54:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340571905] [2024-11-23 22:54:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340571905] [2024-11-23 22:54:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340571905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:54:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075404610] [2024-11-23 22:54:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:54:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:54:22,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:54:22,895 INFO L87 Difference]: Start difference. First operand 178 states and 260 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (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-23 22:54:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:22,970 INFO L93 Difference]: Finished difference Result 488 states and 723 transitions. [2024-11-23 22:54:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:54:22,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (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 55 [2024-11-23 22:54:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:22,979 INFO L225 Difference]: With dead ends: 488 [2024-11-23 22:54:22,979 INFO L226 Difference]: Without dead ends: 327 [2024-11-23 22:54:22,980 INFO L434 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-23 22:54:22,981 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 208 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:22,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 515 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-23 22:54:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2024-11-23 22:54:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.453061224489796) internal successors, (356), 247 states have internal predecessors, (356), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-23 22:54:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 476 transitions. [2024-11-23 22:54:23,045 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 476 transitions. Word has length 55 [2024-11-23 22:54:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:23,046 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 476 transitions. [2024-11-23 22:54:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (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-23 22:54:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 476 transitions. [2024-11-23 22:54:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 22:54:23,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:23,048 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:23,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 22:54:23,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:23,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1025460899, now seen corresponding path program 1 times [2024-11-23 22:54:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:23,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057890695] [2024-11-23 22:54:23,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057890695] [2024-11-23 22:54:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057890695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:54:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125910058] [2024-11-23 22:54:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:54:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:23,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:54:23,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:54:23,248 INFO L87 Difference]: Start difference. First operand 322 states and 476 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-23 22:54:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:23,362 INFO L93 Difference]: Finished difference Result 905 states and 1349 transitions. [2024-11-23 22:54:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:54:23,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 56 [2024-11-23 22:54:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:23,373 INFO L225 Difference]: With dead ends: 905 [2024-11-23 22:54:23,374 INFO L226 Difference]: Without dead ends: 600 [2024-11-23 22:54:23,376 INFO L434 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-23 22:54:23,377 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 210 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:23,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 537 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:23,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-23 22:54:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 594. [2024-11-23 22:54:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 445 states have (on average 1.4629213483146069) internal successors, (651), 449 states have internal predecessors, (651), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-23 22:54:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 885 transitions. [2024-11-23 22:54:23,493 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 885 transitions. Word has length 56 [2024-11-23 22:54:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:23,493 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 885 transitions. [2024-11-23 22:54:23,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-23 22:54:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 885 transitions. [2024-11-23 22:54:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-23 22:54:23,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:23,499 INFO L218 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, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 22:54:23,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1989642719, now seen corresponding path program 1 times [2024-11-23 22:54:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321076605] [2024-11-23 22:54:23,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321076605] [2024-11-23 22:54:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321076605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:54:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043692576] [2024-11-23 22:54:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:54:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:23,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:54:23,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:54:23,815 INFO L87 Difference]: Start difference. First operand 594 states and 885 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-23 22:54:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:24,163 INFO L93 Difference]: Finished difference Result 1271 states and 1888 transitions. [2024-11-23 22:54:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 56 [2024-11-23 22:54:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:24,174 INFO L225 Difference]: With dead ends: 1271 [2024-11-23 22:54:24,175 INFO L226 Difference]: Without dead ends: 694 [2024-11-23 22:54:24,177 INFO L434 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-23 22:54:24,180 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 355 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:24,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 665 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:54:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-23 22:54:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-23 22:54:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.448076923076923) internal successors, (753), 523 states have internal predecessors, (753), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1001 transitions. [2024-11-23 22:54:24,322 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1001 transitions. Word has length 56 [2024-11-23 22:54:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:24,323 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1001 transitions. [2024-11-23 22:54:24,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-23 22:54:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1001 transitions. [2024-11-23 22:54:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-23 22:54:24,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:24,325 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:24,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 22:54:24,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash -138082030, now seen corresponding path program 1 times [2024-11-23 22:54:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:24,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856358332] [2024-11-23 22:54:24,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:24,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:24,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:24,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856358332] [2024-11-23 22:54:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856358332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:24,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:54:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470172545] [2024-11-23 22:54:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:24,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:54:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:24,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:54:24,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:54:24,618 INFO L87 Difference]: Start difference. First operand 682 states and 1001 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-23 22:54:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:24,947 INFO L93 Difference]: Finished difference Result 1271 states and 1880 transitions. [2024-11-23 22:54:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2024-11-23 22:54:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:24,957 INFO L225 Difference]: With dead ends: 1271 [2024-11-23 22:54:24,957 INFO L226 Difference]: Without dead ends: 694 [2024-11-23 22:54:24,960 INFO L434 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-23 22:54:24,961 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 352 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:24,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 668 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:54:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-23 22:54:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-23 22:54:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4403846153846154) internal successors, (749), 523 states have internal predecessors, (749), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 997 transitions. [2024-11-23 22:54:25,077 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 997 transitions. Word has length 57 [2024-11-23 22:54:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:25,078 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 997 transitions. [2024-11-23 22:54:25,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-23 22:54:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 997 transitions. [2024-11-23 22:54:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-23 22:54:25,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:25,081 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:25,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 22:54:25,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:25,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1602179858, now seen corresponding path program 1 times [2024-11-23 22:54:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868507670] [2024-11-23 22:54:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868507670] [2024-11-23 22:54:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868507670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:25,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:25,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081269356] [2024-11-23 22:54:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:25,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:25,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:25,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:25,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:25,455 INFO L87 Difference]: Start difference. First operand 682 states and 997 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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-23 22:54:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:25,569 INFO L93 Difference]: Finished difference Result 1279 states and 1892 transitions. [2024-11-23 22:54:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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 58 [2024-11-23 22:54:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:25,575 INFO L225 Difference]: With dead ends: 1279 [2024-11-23 22:54:25,575 INFO L226 Difference]: Without dead ends: 702 [2024-11-23 22:54:25,578 INFO L434 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-23 22:54:25,578 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 4 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:25,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 755 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-23 22:54:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2024-11-23 22:54:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 536 states have (on average 1.4272388059701493) internal successors, (765), 539 states have internal predecessors, (765), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2024-11-23 22:54:25,656 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 58 [2024-11-23 22:54:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:25,656 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2024-11-23 22:54:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (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-23 22:54:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2024-11-23 22:54:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-23 22:54:25,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:25,659 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:25,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 22:54:25,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1495777117, now seen corresponding path program 1 times [2024-11-23 22:54:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135719788] [2024-11-23 22:54:25,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:25,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:25,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135719788] [2024-11-23 22:54:25,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135719788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:25,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432987670] [2024-11-23 22:54:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:25,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:25,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:25,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:25,957 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-23 22:54:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:26,076 INFO L93 Difference]: Finished difference Result 1319 states and 1936 transitions. [2024-11-23 22:54:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 66 [2024-11-23 22:54:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:26,084 INFO L225 Difference]: With dead ends: 1319 [2024-11-23 22:54:26,084 INFO L226 Difference]: Without dead ends: 722 [2024-11-23 22:54:26,087 INFO L434 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-23 22:54:26,087 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:26,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 741 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-23 22:54:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-11-23 22:54:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 552 states have (on average 1.414855072463768) internal successors, (781), 555 states have internal predecessors, (781), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1029 transitions. [2024-11-23 22:54:26,164 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1029 transitions. Word has length 66 [2024-11-23 22:54:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:26,166 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1029 transitions. [2024-11-23 22:54:26,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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-23 22:54:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1029 transitions. [2024-11-23 22:54:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 22:54:26,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:26,169 INFO L218 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, 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-23 22:54:26,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 22:54:26,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:26,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:26,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1186649897, now seen corresponding path program 1 times [2024-11-23 22:54:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702169425] [2024-11-23 22:54:26,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702169425] [2024-11-23 22:54:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702169425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430808565] [2024-11-23 22:54:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:26,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:26,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:26,493 INFO L87 Difference]: Start difference. First operand 722 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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-23 22:54:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:26,622 INFO L93 Difference]: Finished difference Result 1359 states and 1968 transitions. [2024-11-23 22:54:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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 74 [2024-11-23 22:54:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:26,631 INFO L225 Difference]: With dead ends: 1359 [2024-11-23 22:54:26,631 INFO L226 Difference]: Without dead ends: 742 [2024-11-23 22:54:26,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:54:26,634 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:26,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 741 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-23 22:54:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2024-11-23 22:54:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 568 states have (on average 1.403169014084507) internal successors, (797), 571 states have internal predecessors, (797), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1045 transitions. [2024-11-23 22:54:26,711 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1045 transitions. Word has length 74 [2024-11-23 22:54:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:26,712 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1045 transitions. [2024-11-23 22:54:26,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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-23 22:54:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1045 transitions. [2024-11-23 22:54:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 22:54:26,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:26,716 INFO L218 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-23 22:54:26,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 22:54:26,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:26,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1209809406, now seen corresponding path program 1 times [2024-11-23 22:54:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724028897] [2024-11-23 22:54:26,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-23 22:54:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724028897] [2024-11-23 22:54:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724028897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:26,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:26,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426259838] [2024-11-23 22:54:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:26,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:26,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:26,951 INFO L87 Difference]: Start difference. First operand 742 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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-23 22:54:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:27,068 INFO L93 Difference]: Finished difference Result 1395 states and 1984 transitions. [2024-11-23 22:54:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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 74 [2024-11-23 22:54:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:27,076 INFO L225 Difference]: With dead ends: 1395 [2024-11-23 22:54:27,076 INFO L226 Difference]: Without dead ends: 758 [2024-11-23 22:54:27,078 INFO L434 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-23 22:54:27,079 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:27,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 751 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-23 22:54:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2024-11-23 22:54:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 580 states have (on average 1.3948275862068966) internal successors, (809), 583 states have internal predecessors, (809), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1057 transitions. [2024-11-23 22:54:27,161 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1057 transitions. Word has length 74 [2024-11-23 22:54:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:27,162 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1057 transitions. [2024-11-23 22:54:27,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (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-23 22:54:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1057 transitions. [2024-11-23 22:54:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-23 22:54:27,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:27,166 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 22:54:27,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -203434871, now seen corresponding path program 1 times [2024-11-23 22:54:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115568281] [2024-11-23 22:54:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 22:54:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115568281] [2024-11-23 22:54:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115568281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491259913] [2024-11-23 22:54:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:27,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:27,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:27,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:27,467 INFO L87 Difference]: Start difference. First operand 758 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-23 22:54:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:27,601 INFO L93 Difference]: Finished difference Result 1435 states and 2020 transitions. [2024-11-23 22:54:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 82 [2024-11-23 22:54:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:27,610 INFO L225 Difference]: With dead ends: 1435 [2024-11-23 22:54:27,611 INFO L226 Difference]: Without dead ends: 782 [2024-11-23 22:54:27,613 INFO L434 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-23 22:54:27,614 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 5 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:27,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-23 22:54:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2024-11-23 22:54:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 600 states have (on average 1.3816666666666666) internal successors, (829), 603 states have internal predecessors, (829), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-23 22:54:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1077 transitions. [2024-11-23 22:54:27,694 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1077 transitions. Word has length 82 [2024-11-23 22:54:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1077 transitions. [2024-11-23 22:54:27,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-23 22:54:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1077 transitions. [2024-11-23 22:54:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-23 22:54:27,699 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:27,699 INFO L218 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, 1, 1, 1, 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-23 22:54:27,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 22:54:27,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1273158516, now seen corresponding path program 1 times [2024-11-23 22:54:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315722304] [2024-11-23 22:54:27,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-23 22:54:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315722304] [2024-11-23 22:54:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315722304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:28,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:28,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:54:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790488991] [2024-11-23 22:54:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:28,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:54:28,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:28,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:54:28,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:54:28,636 INFO L87 Difference]: Start difference. First operand 782 states and 1077 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:54:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:29,162 INFO L93 Difference]: Finished difference Result 2029 states and 2783 transitions. [2024-11-23 22:54:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:54:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 85 [2024-11-23 22:54:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:29,174 INFO L225 Difference]: With dead ends: 2029 [2024-11-23 22:54:29,174 INFO L226 Difference]: Without dead ends: 1352 [2024-11-23 22:54:29,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:54:29,178 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 196 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:29,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1452 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 22:54:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-23 22:54:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1066. [2024-11-23 22:54:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 811 states have (on average 1.369913686806412) internal successors, (1111), 816 states have internal predecessors, (1111), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-23 22:54:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1455 transitions. [2024-11-23 22:54:29,356 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1455 transitions. Word has length 85 [2024-11-23 22:54:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:29,356 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1455 transitions. [2024-11-23 22:54:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:54:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1455 transitions. [2024-11-23 22:54:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 22:54:29,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:29,363 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-23 22:54:29,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 22:54:29,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:29,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 754951298, now seen corresponding path program 1 times [2024-11-23 22:54:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:29,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768316425] [2024-11-23 22:54:29,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-23 22:54:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:30,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768316425] [2024-11-23 22:54:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768316425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:54:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336207772] [2024-11-23 22:54:30,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:30,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:54:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:54:30,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:54:30,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 22:54:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:30,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 22:54:30,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:54:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 22:54:30,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:54:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336207772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:54:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2024-11-23 22:54:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207564016] [2024-11-23 22:54:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:30,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 22:54:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 22:54:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-23 22:54:30,461 INFO L87 Difference]: Start difference. First operand 1066 states and 1455 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 22:54:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:30,837 INFO L93 Difference]: Finished difference Result 2299 states and 3249 transitions. [2024-11-23 22:54:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 22:54:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 88 [2024-11-23 22:54:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:30,850 INFO L225 Difference]: With dead ends: 2299 [2024-11-23 22:54:30,850 INFO L226 Difference]: Without dead ends: 1486 [2024-11-23 22:54:30,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-23 22:54:30,855 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 135 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:30,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2814 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:54:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-23 22:54:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1074. [2024-11-23 22:54:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 815 states have (on average 1.3607361963190183) internal successors, (1109), 822 states have internal predecessors, (1109), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-23 22:54:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1457 transitions. [2024-11-23 22:54:31,012 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1457 transitions. Word has length 88 [2024-11-23 22:54:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1457 transitions. [2024-11-23 22:54:31,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 22:54:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1457 transitions. [2024-11-23 22:54:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-23 22:54:31,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:31,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:31,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 22:54:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-23 22:54:31,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1891908626, now seen corresponding path program 1 times [2024-11-23 22:54:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876250784] [2024-11-23 22:54:31,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-23 22:54:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876250784] [2024-11-23 22:54:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876250784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:31,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:31,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152355997] [2024-11-23 22:54:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:31,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:31,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:31,477 INFO L87 Difference]: Start difference. First operand 1074 states and 1457 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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-23 22:54:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:31,679 INFO L93 Difference]: Finished difference Result 1999 states and 2732 transitions. [2024-11-23 22:54:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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 89 [2024-11-23 22:54:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:31,690 INFO L225 Difference]: With dead ends: 1999 [2024-11-23 22:54:31,690 INFO L226 Difference]: Without dead ends: 1098 [2024-11-23 22:54:31,693 INFO L434 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-23 22:54:31,693 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:31,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 751 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-23 22:54:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-11-23 22:54:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 833 states have (on average 1.3529411764705883) internal successors, (1127), 840 states have internal predecessors, (1127), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-23 22:54:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1475 transitions. [2024-11-23 22:54:31,857 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1475 transitions. Word has length 89 [2024-11-23 22:54:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:31,858 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1475 transitions. [2024-11-23 22:54:31,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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-23 22:54:31,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1475 transitions. [2024-11-23 22:54:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 22:54:31,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:31,861 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:54:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 22:54:31,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:31,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash -103126629, now seen corresponding path program 1 times [2024-11-23 22:54:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662328419] [2024-11-23 22:54:31,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-23 22:54:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662328419] [2024-11-23 22:54:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662328419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:54:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518362445] [2024-11-23 22:54:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:54:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:32,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:54:32,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:54:32,092 INFO L87 Difference]: Start difference. First operand 1098 states and 1475 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:54:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:32,428 INFO L93 Difference]: Finished difference Result 1978 states and 2660 transitions. [2024-11-23 22:54:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:54:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2024-11-23 22:54:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:32,439 INFO L225 Difference]: With dead ends: 1978 [2024-11-23 22:54:32,440 INFO L226 Difference]: Without dead ends: 1135 [2024-11-23 22:54:32,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:54:32,444 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 249 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:32,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1461 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:54:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-23 22:54:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1101. [2024-11-23 22:54:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 847 states have (on average 1.345926800472255) internal successors, (1140), 859 states have internal predecessors, (1140), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-23 22:54:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1464 transitions. [2024-11-23 22:54:32,574 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1464 transitions. Word has length 91 [2024-11-23 22:54:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:32,574 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1464 transitions. [2024-11-23 22:54:32,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:54:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1464 transitions. [2024-11-23 22:54:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-23 22:54:32,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:32,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:32,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 22:54:32,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 940479954, now seen corresponding path program 1 times [2024-11-23 22:54:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:32,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141070847] [2024-11-23 22:54:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-23 22:54:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141070847] [2024-11-23 22:54:33,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141070847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:33,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:33,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:54:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43851780] [2024-11-23 22:54:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:33,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:54:33,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:33,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:54:33,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:54:33,456 INFO L87 Difference]: Start difference. First operand 1101 states and 1464 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 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-23 22:54:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:33,838 INFO L93 Difference]: Finished difference Result 1965 states and 2621 transitions. [2024-11-23 22:54:33,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:54:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 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 93 [2024-11-23 22:54:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:33,852 INFO L225 Difference]: With dead ends: 1965 [2024-11-23 22:54:33,852 INFO L226 Difference]: Without dead ends: 1099 [2024-11-23 22:54:33,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:54:33,856 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 183 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:33,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1445 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:54:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-11-23 22:54:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 992. [2024-11-23 22:54:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 765 states have (on average 1.3477124183006537) internal successors, (1031), 775 states have internal predecessors, (1031), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-23 22:54:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1321 transitions. [2024-11-23 22:54:33,985 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1321 transitions. Word has length 93 [2024-11-23 22:54:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:33,986 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1321 transitions. [2024-11-23 22:54:33,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 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-23 22:54:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1321 transitions. [2024-11-23 22:54:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-23 22:54:33,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:33,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:33,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 22:54:33,988 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:33,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash -393724703, now seen corresponding path program 1 times [2024-11-23 22:54:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:33,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723070163] [2024-11-23 22:54:33,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-23 22:54:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723070163] [2024-11-23 22:54:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723070163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:34,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:34,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:54:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394398117] [2024-11-23 22:54:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:54:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:54:34,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:54:34,812 INFO L87 Difference]: Start difference. First operand 992 states and 1321 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 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-23 22:54:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:35,535 INFO L93 Difference]: Finished difference Result 1896 states and 2508 transitions. [2024-11-23 22:54:35,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:54:35,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 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 94 [2024-11-23 22:54:35,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:35,545 INFO L225 Difference]: With dead ends: 1896 [2024-11-23 22:54:35,545 INFO L226 Difference]: Without dead ends: 1059 [2024-11-23 22:54:35,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:54:35,549 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 403 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:35,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1242 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 22:54:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-23 22:54:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1008. [2024-11-23 22:54:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 773 states have (on average 1.3247089262613196) internal successors, (1024), 784 states have internal predecessors, (1024), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-23 22:54:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1320 transitions. [2024-11-23 22:54:35,694 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1320 transitions. Word has length 94 [2024-11-23 22:54:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:35,694 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1320 transitions. [2024-11-23 22:54:35,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 3 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-23 22:54:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1320 transitions. [2024-11-23 22:54:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-23 22:54:35,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:35,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:35,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 22:54:35,697 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -284174634, now seen corresponding path program 1 times [2024-11-23 22:54:35,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:35,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659990903] [2024-11-23 22:54:35,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:35,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:35,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659990903] [2024-11-23 22:54:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659990903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:35,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:35,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442943047] [2024-11-23 22:54:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:35,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:35,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:35,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:35,846 INFO L87 Difference]: Start difference. First operand 1008 states and 1320 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-23 22:54:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:36,171 INFO L93 Difference]: Finished difference Result 2661 states and 3506 transitions. [2024-11-23 22:54:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 95 [2024-11-23 22:54:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:36,187 INFO L225 Difference]: With dead ends: 2661 [2024-11-23 22:54:36,188 INFO L226 Difference]: Without dead ends: 1859 [2024-11-23 22:54:36,191 INFO L434 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-23 22:54:36,191 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 199 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:36,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1131 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-11-23 22:54:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1744. [2024-11-23 22:54:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1319 states have (on average 1.3176648976497347) internal successors, (1738), 1338 states have internal predecessors, (1738), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-11-23 22:54:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2282 transitions. [2024-11-23 22:54:36,544 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2282 transitions. Word has length 95 [2024-11-23 22:54:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:36,545 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2282 transitions. [2024-11-23 22:54:36,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-23 22:54:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2282 transitions. [2024-11-23 22:54:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-23 22:54:36,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:36,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:36,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 22:54:36,548 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:36,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1869830197, now seen corresponding path program 1 times [2024-11-23 22:54:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583266629] [2024-11-23 22:54:36,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-23 22:54:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583266629] [2024-11-23 22:54:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583266629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:37,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:54:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491868261] [2024-11-23 22:54:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:54:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:54:37,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:54:37,377 INFO L87 Difference]: Start difference. First operand 1744 states and 2282 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 22:54:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:38,334 INFO L93 Difference]: Finished difference Result 3400 states and 4444 transitions. [2024-11-23 22:54:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:54:38,335 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-11-23 22:54:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:38,348 INFO L225 Difference]: With dead ends: 3400 [2024-11-23 22:54:38,348 INFO L226 Difference]: Without dead ends: 1940 [2024-11-23 22:54:38,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:54:38,358 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 513 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:38,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1407 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 22:54:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-23 22:54:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1771. [2024-11-23 22:54:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1333 states have (on average 1.3113278319579895) internal successors, (1748), 1353 states have internal predecessors, (1748), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-23 22:54:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2308 transitions. [2024-11-23 22:54:38,652 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2308 transitions. Word has length 97 [2024-11-23 22:54:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:38,653 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2308 transitions. [2024-11-23 22:54:38,653 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 22:54:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2308 transitions. [2024-11-23 22:54:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-23 22:54:38,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:38,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:38,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 22:54:38,657 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1876171216, now seen corresponding path program 1 times [2024-11-23 22:54:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626436893] [2024-11-23 22:54:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626436893] [2024-11-23 22:54:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626436893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558193995] [2024-11-23 22:54:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:38,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:38,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:38,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:38,818 INFO L87 Difference]: Start difference. First operand 1771 states and 2308 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-23 22:54:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:39,380 INFO L93 Difference]: Finished difference Result 4501 states and 5898 transitions. [2024-11-23 22:54:39,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:39,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2024-11-23 22:54:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:39,400 INFO L225 Difference]: With dead ends: 4501 [2024-11-23 22:54:39,400 INFO L226 Difference]: Without dead ends: 3057 [2024-11-23 22:54:39,404 INFO L434 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-23 22:54:39,405 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 205 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:39,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1169 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-11-23 22:54:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2782. [2024-11-23 22:54:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2069 states have (on average 1.3015949734171097) internal successors, (2693), 2100 states have internal predecessors, (2693), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-11-23 22:54:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3613 transitions. [2024-11-23 22:54:39,857 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3613 transitions. Word has length 99 [2024-11-23 22:54:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:39,858 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 3613 transitions. [2024-11-23 22:54:39,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-23 22:54:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3613 transitions. [2024-11-23 22:54:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-23 22:54:39,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:39,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:39,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 22:54:39,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:39,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1671410112, now seen corresponding path program 1 times [2024-11-23 22:54:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403322701] [2024-11-23 22:54:39,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:40,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403322701] [2024-11-23 22:54:40,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403322701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:40,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064968854] [2024-11-23 22:54:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:40,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:40,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:40,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:40,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:40,024 INFO L87 Difference]: Start difference. First operand 2782 states and 3613 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-23 22:54:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:40,747 INFO L93 Difference]: Finished difference Result 6508 states and 8489 transitions. [2024-11-23 22:54:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:40,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2024-11-23 22:54:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:40,780 INFO L225 Difference]: With dead ends: 6508 [2024-11-23 22:54:40,781 INFO L226 Difference]: Without dead ends: 4169 [2024-11-23 22:54:40,789 INFO L434 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-23 22:54:40,792 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 198 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:40,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1181 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-11-23 22:54:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3988. [2024-11-23 22:54:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 2951 states have (on average 1.2978651304642495) internal successors, (3830), 2995 states have internal predecessors, (3830), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-23 22:54:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5174 transitions. [2024-11-23 22:54:41,569 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5174 transitions. Word has length 99 [2024-11-23 22:54:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:41,570 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5174 transitions. [2024-11-23 22:54:41,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-23 22:54:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5174 transitions. [2024-11-23 22:54:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-23 22:54:41,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:41,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 22:54:41,575 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -275000023, now seen corresponding path program 1 times [2024-11-23 22:54:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255660574] [2024-11-23 22:54:41,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255660574] [2024-11-23 22:54:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255660574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:54:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904848106] [2024-11-23 22:54:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:54:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:41,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:54:41,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:54:41,697 INFO L87 Difference]: Start difference. First operand 3988 states and 5174 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-23 22:54:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:42,431 INFO L93 Difference]: Finished difference Result 7667 states and 9991 transitions. [2024-11-23 22:54:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:54:42,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 100 [2024-11-23 22:54:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:42,476 INFO L225 Difference]: With dead ends: 7667 [2024-11-23 22:54:42,478 INFO L226 Difference]: Without dead ends: 4021 [2024-11-23 22:54:42,490 INFO L434 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-23 22:54:42,491 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 481 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-23 22:54:42,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 481 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2024-11-23 22:54:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3994. [2024-11-23 22:54:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 2957 states have (on average 1.2972607372336828) internal successors, (3836), 3001 states have internal predecessors, (3836), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-23 22:54:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5180 transitions. [2024-11-23 22:54:43,130 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5180 transitions. Word has length 100 [2024-11-23 22:54:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:43,130 INFO L471 AbstractCegarLoop]: Abstraction has 3994 states and 5180 transitions. [2024-11-23 22:54:43,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-23 22:54:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5180 transitions. [2024-11-23 22:54:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-23 22:54:43,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:43,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 22:54:43,135 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:43,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2124726715, now seen corresponding path program 1 times [2024-11-23 22:54:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538410880] [2024-11-23 22:54:43,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538410880] [2024-11-23 22:54:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538410880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:43,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:43,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812700637] [2024-11-23 22:54:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:43,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:43,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:43,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:43,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:43,327 INFO L87 Difference]: Start difference. First operand 3994 states and 5180 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-23 22:54:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:43,803 INFO L93 Difference]: Finished difference Result 7632 states and 9918 transitions. [2024-11-23 22:54:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 101 [2024-11-23 22:54:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:43,836 INFO L225 Difference]: With dead ends: 7632 [2024-11-23 22:54:43,836 INFO L226 Difference]: Without dead ends: 3710 [2024-11-23 22:54:43,849 INFO L434 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-23 22:54:43,850 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 79 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:43,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 730 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-11-23 22:54:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3647. [2024-11-23 22:54:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2693 states have (on average 1.305607129595247) internal successors, (3516), 2727 states have internal predecessors, (3516), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-23 22:54:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4756 transitions. [2024-11-23 22:54:44,414 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4756 transitions. Word has length 101 [2024-11-23 22:54:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:44,415 INFO L471 AbstractCegarLoop]: Abstraction has 3647 states and 4756 transitions. [2024-11-23 22:54:44,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-23 22:54:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4756 transitions. [2024-11-23 22:54:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-23 22:54:44,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:44,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:44,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-23 22:54:44,419 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:44,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -425938695, now seen corresponding path program 1 times [2024-11-23 22:54:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261098532] [2024-11-23 22:54:44,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:44,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:44,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261098532] [2024-11-23 22:54:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261098532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:54:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574818226] [2024-11-23 22:54:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:54:44,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:44,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:54:44,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:54:44,503 INFO L87 Difference]: Start difference. First operand 3647 states and 4756 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-23 22:54:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:45,072 INFO L93 Difference]: Finished difference Result 7170 states and 9388 transitions. [2024-11-23 22:54:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:54:45,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 102 [2024-11-23 22:54:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:45,096 INFO L225 Difference]: With dead ends: 7170 [2024-11-23 22:54:45,097 INFO L226 Difference]: Without dead ends: 3698 [2024-11-23 22:54:45,106 INFO L434 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-23 22:54:45,106 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 481 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-23 22:54:45,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 481 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:54:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2024-11-23 22:54:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3657. [2024-11-23 22:54:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 2703 states have (on average 1.3044765075841658) internal successors, (3526), 2737 states have internal predecessors, (3526), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-23 22:54:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4766 transitions. [2024-11-23 22:54:45,586 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4766 transitions. Word has length 102 [2024-11-23 22:54:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 4766 transitions. [2024-11-23 22:54:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-23 22:54:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4766 transitions. [2024-11-23 22:54:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-23 22:54:45,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:45,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:54:45,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-23 22:54:45,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:45,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1786405918, now seen corresponding path program 1 times [2024-11-23 22:54:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910411715] [2024-11-23 22:54:45,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-23 22:54:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910411715] [2024-11-23 22:54:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910411715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:54:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:54:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409424498] [2024-11-23 22:54:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:54:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:45,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:54:45,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:54:45,780 INFO L87 Difference]: Start difference. First operand 3657 states and 4766 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-23 22:54:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:46,381 INFO L93 Difference]: Finished difference Result 7121 states and 9299 transitions. [2024-11-23 22:54:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:54:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 102 [2024-11-23 22:54:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:46,409 INFO L225 Difference]: With dead ends: 7121 [2024-11-23 22:54:46,409 INFO L226 Difference]: Without dead ends: 3579 [2024-11-23 22:54:46,421 INFO L434 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-23 22:54:46,422 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 60 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:46,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 740 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2024-11-23 22:54:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 2751. [2024-11-23 22:54:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2031 states have (on average 1.2968980797636631) internal successors, (2634), 2050 states have internal predecessors, (2634), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-11-23 22:54:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3572 transitions. [2024-11-23 22:54:47,055 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3572 transitions. Word has length 102 [2024-11-23 22:54:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:47,056 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3572 transitions. [2024-11-23 22:54:47,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-23 22:54:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3572 transitions. [2024-11-23 22:54:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-23 22:54:47,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:47,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-23 22:54:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 22:54:47,067 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:47,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1492707530, now seen corresponding path program 1 times [2024-11-23 22:54:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237708656] [2024-11-23 22:54:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:54:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237708656] [2024-11-23 22:54:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237708656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:54:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620916275] [2024-11-23 22:54:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:47,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:54:47,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:54:47,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:54:47,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 22:54:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:48,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-23 22:54:48,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:54:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-23 22:54:48,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:54:48,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620916275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:54:48,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:54:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-23 22:54:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668392323] [2024-11-23 22:54:48,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:54:48,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:54:48,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:48,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:54:48,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 22:54:48,230 INFO L87 Difference]: Start difference. First operand 2751 states and 3572 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-23 22:54:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:48,602 INFO L93 Difference]: Finished difference Result 5180 states and 6763 transitions. [2024-11-23 22:54:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:54:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 151 [2024-11-23 22:54:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:48,624 INFO L225 Difference]: With dead ends: 5180 [2024-11-23 22:54:48,624 INFO L226 Difference]: Without dead ends: 2584 [2024-11-23 22:54:48,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-23 22:54:48,633 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1004 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:54:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2024-11-23 22:54:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2569. [2024-11-23 22:54:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 1894 states have (on average 1.2930306230200634) internal successors, (2449), 1911 states have internal predecessors, (2449), 440 states have call successors, (440), 234 states have call predecessors, (440), 234 states have return successors, (440), 423 states have call predecessors, (440), 440 states have call successors, (440) [2024-11-23 22:54:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3329 transitions. [2024-11-23 22:54:49,043 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3329 transitions. Word has length 151 [2024-11-23 22:54:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:54:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 3329 transitions. [2024-11-23 22:54:49,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-23 22:54:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3329 transitions. [2024-11-23 22:54:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-23 22:54:49,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:54:49,051 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-23 22:54:49,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 22:54:49,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-23 22:54:49,252 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:54:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:54:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash 433320110, now seen corresponding path program 1 times [2024-11-23 22:54:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:54:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928692497] [2024-11-23 22:54:49,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:49,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:54:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:54:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:54:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928692497] [2024-11-23 22:54:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928692497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:54:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921183169] [2024-11-23 22:54:50,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:54:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:54:50,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:54:50,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:54:50,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 22:54:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:54:50,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-23 22:54:50,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:54:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 22:54:50,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:54:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:54:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921183169] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:54:51,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:54:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-23 22:54:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863916112] [2024-11-23 22:54:51,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:54:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-23 22:54:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:54:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-23 22:54:51,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2024-11-23 22:54:51,427 INFO L87 Difference]: Start difference. First operand 2569 states and 3329 transitions. Second operand has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 22 states have internal predecessors, (254), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-11-23 22:54:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:54:59,675 INFO L93 Difference]: Finished difference Result 7507 states and 9755 transitions. [2024-11-23 22:54:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-23 22:54:59,676 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 22 states have internal predecessors, (254), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 153 [2024-11-23 22:54:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:54:59,708 INFO L225 Difference]: With dead ends: 7507 [2024-11-23 22:54:59,708 INFO L226 Difference]: Without dead ends: 5174 [2024-11-23 22:54:59,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1036, Invalid=6104, Unknown=0, NotChecked=0, Total=7140 [2024-11-23 22:54:59,719 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 2854 mSDsluCounter, 6380 mSDsCounter, 0 mSdLazyCounter, 3816 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2854 SdHoareTripleChecker+Valid, 7020 SdHoareTripleChecker+Invalid, 4886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 3816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-23 22:54:59,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2854 Valid, 7020 Invalid, 4886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1070 Valid, 3816 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-23 22:54:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2024-11-23 22:55:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4492. [2024-11-23 22:55:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 3312 states have (on average 1.2958937198067633) internal successors, (4292), 3341 states have internal predecessors, (4292), 765 states have call successors, (765), 414 states have call predecessors, (765), 414 states have return successors, (765), 736 states have call predecessors, (765), 765 states have call successors, (765) [2024-11-23 22:55:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 5822 transitions. [2024-11-23 22:55:00,602 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 5822 transitions. Word has length 153 [2024-11-23 22:55:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:00,603 INFO L471 AbstractCegarLoop]: Abstraction has 4492 states and 5822 transitions. [2024-11-23 22:55:00,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.583333333333334) internal successors, (254), 22 states have internal predecessors, (254), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-11-23 22:55:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 5822 transitions. [2024-11-23 22:55:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-23 22:55:00,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:00,613 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 22:55:00,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 22:55:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-23 22:55:00,817 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1655848050, now seen corresponding path program 1 times [2024-11-23 22:55:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497077705] [2024-11-23 22:55:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497077705] [2024-11-23 22:55:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497077705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:55:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813802683] [2024-11-23 22:55:02,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:02,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:55:02,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:55:02,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 22:55:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:02,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-23 22:55:02,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:55:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 22:55:03,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:55:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:04,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813802683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:04,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:04,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-23 22:55:04,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842073821] [2024-11-23 22:55:04,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:04,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-23 22:55:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:04,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-23 22:55:04,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2024-11-23 22:55:04,467 INFO L87 Difference]: Start difference. First operand 4492 states and 5822 transitions. Second operand has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 27 states have internal predecessors, (238), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2024-11-23 22:55:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:55:10,383 INFO L93 Difference]: Finished difference Result 9897 states and 12810 transitions. [2024-11-23 22:55:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-23 22:55:10,384 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 27 states have internal predecessors, (238), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) Word has length 154 [2024-11-23 22:55:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:55:10,412 INFO L225 Difference]: With dead ends: 9897 [2024-11-23 22:55:10,413 INFO L226 Difference]: Without dead ends: 5652 [2024-11-23 22:55:10,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1979 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1147, Invalid=5173, Unknown=0, NotChecked=0, Total=6320 [2024-11-23 22:55:10,425 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 2593 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:55:10,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2593 Valid, 3477 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [889 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-23 22:55:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2024-11-23 22:55:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5216. [2024-11-23 22:55:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5216 states, 3855 states have (on average 1.2897535667963684) internal successors, (4972), 3888 states have internal predecessors, (4972), 876 states have call successors, (876), 484 states have call predecessors, (876), 484 states have return successors, (876), 843 states have call predecessors, (876), 876 states have call successors, (876) [2024-11-23 22:55:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 6724 transitions. [2024-11-23 22:55:11,543 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 6724 transitions. Word has length 154 [2024-11-23 22:55:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:11,545 INFO L471 AbstractCegarLoop]: Abstraction has 5216 states and 6724 transitions. [2024-11-23 22:55:11,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 27 states have internal predecessors, (238), 10 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 10 states have call predecessors, (37), 10 states have call successors, (37) [2024-11-23 22:55:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 6724 transitions. [2024-11-23 22:55:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-23 22:55:11,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:11,555 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 22:55:11,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 22:55:11,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-23 22:55:11,758 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1261954953, now seen corresponding path program 1 times [2024-11-23 22:55:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798136253] [2024-11-23 22:55:11,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-23 22:55:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798136253] [2024-11-23 22:55:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798136253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:55:12,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:55:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:55:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499251475] [2024-11-23 22:55:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:55:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:55:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:12,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:55:12,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:55:12,049 INFO L87 Difference]: Start difference. First operand 5216 states and 6724 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-23 22:55:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:55:14,187 INFO L93 Difference]: Finished difference Result 14904 states and 19316 transitions. [2024-11-23 22:55:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:55:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 156 [2024-11-23 22:55:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:55:14,243 INFO L225 Difference]: With dead ends: 14904 [2024-11-23 22:55:14,244 INFO L226 Difference]: Without dead ends: 10147 [2024-11-23 22:55:14,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:55:14,260 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 219 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:55:14,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2531 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:55:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10147 states. [2024-11-23 22:55:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10147 to 7591. [2024-11-23 22:55:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 5566 states have (on average 1.2896155228171038) internal successors, (7178), 5616 states have internal predecessors, (7178), 1319 states have call successors, (1319), 705 states have call predecessors, (1319), 705 states have return successors, (1319), 1269 states have call predecessors, (1319), 1319 states have call successors, (1319) [2024-11-23 22:55:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 9816 transitions. [2024-11-23 22:55:15,602 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 9816 transitions. Word has length 156 [2024-11-23 22:55:15,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:15,603 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 9816 transitions. [2024-11-23 22:55:15,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-23 22:55:15,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 9816 transitions. [2024-11-23 22:55:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-23 22:55:15,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:15,620 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 22:55:15,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-23 22:55:15,621 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2005359977, now seen corresponding path program 1 times [2024-11-23 22:55:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726829572] [2024-11-23 22:55:15,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726829572] [2024-11-23 22:55:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726829572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:55:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158162220] [2024-11-23 22:55:17,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:55:17,419 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:55:17,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 22:55:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:17,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 22:55:17,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:55:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 59 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 22:55:18,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:55:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158162220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:19,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 32 [2024-11-23 22:55:19,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125564979] [2024-11-23 22:55:19,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-23 22:55:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:19,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 22:55:19,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2024-11-23 22:55:19,910 INFO L87 Difference]: Start difference. First operand 7591 states and 9816 transitions. Second operand has 32 states, 32 states have (on average 8.125) internal successors, (260), 32 states have internal predecessors, (260), 11 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 11 states have call predecessors, (37), 11 states have call successors, (37) [2024-11-23 22:55:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:55:28,392 INFO L93 Difference]: Finished difference Result 16958 states and 21972 transitions. [2024-11-23 22:55:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-11-23 22:55:28,393 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.125) internal successors, (260), 32 states have internal predecessors, (260), 11 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 11 states have call predecessors, (37), 11 states have call successors, (37) Word has length 156 [2024-11-23 22:55:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:55:28,439 INFO L225 Difference]: With dead ends: 16958 [2024-11-23 22:55:28,440 INFO L226 Difference]: Without dead ends: 9779 [2024-11-23 22:55:28,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4414 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2004, Invalid=10878, Unknown=0, NotChecked=0, Total=12882 [2024-11-23 22:55:28,458 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 4358 mSDsluCounter, 4972 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 1539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 5517 SdHoareTripleChecker+Invalid, 4294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1539 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:55:28,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 5517 Invalid, 4294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1539 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-23 22:55:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2024-11-23 22:55:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 9176. [2024-11-23 22:55:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9176 states, 6740 states have (on average 1.2875370919881306) internal successors, (8678), 6802 states have internal predecessors, (8678), 1584 states have call successors, (1584), 851 states have call predecessors, (1584), 851 states have return successors, (1584), 1522 states have call predecessors, (1584), 1584 states have call successors, (1584) [2024-11-23 22:55:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 11846 transitions. [2024-11-23 22:55:30,003 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 11846 transitions. Word has length 156 [2024-11-23 22:55:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:30,004 INFO L471 AbstractCegarLoop]: Abstraction has 9176 states and 11846 transitions. [2024-11-23 22:55:30,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.125) internal successors, (260), 32 states have internal predecessors, (260), 11 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 11 states have call predecessors, (37), 11 states have call successors, (37) [2024-11-23 22:55:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 11846 transitions. [2024-11-23 22:55:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-23 22:55:30,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:30,018 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-23 22:55:30,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 22:55:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-23 22:55:30,222 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:30,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1846912646, now seen corresponding path program 1 times [2024-11-23 22:55:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802832207] [2024-11-23 22:55:30,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802832207] [2024-11-23 22:55:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802832207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:55:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445915278] [2024-11-23 22:55:31,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:31,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:31,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:55:31,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:55:31,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 22:55:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:31,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 22:55:31,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:55:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-23 22:55:32,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:55:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 22:55:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445915278] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:33,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 27 [2024-11-23 22:55:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175039079] [2024-11-23 22:55:33,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-23 22:55:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:33,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-23 22:55:33,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-23 22:55:33,490 INFO L87 Difference]: Start difference. First operand 9176 states and 11846 transitions. Second operand has 27 states, 27 states have (on average 8.37037037037037) internal successors, (226), 27 states have internal predecessors, (226), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-11-23 22:55:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:55:37,591 INFO L93 Difference]: Finished difference Result 17957 states and 23259 transitions. [2024-11-23 22:55:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 22:55:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.37037037037037) internal successors, (226), 27 states have internal predecessors, (226), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) Word has length 157 [2024-11-23 22:55:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:55:37,641 INFO L225 Difference]: With dead ends: 17957 [2024-11-23 22:55:37,641 INFO L226 Difference]: Without dead ends: 9178 [2024-11-23 22:55:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2024-11-23 22:55:37,660 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1094 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 3888 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:55:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 3888 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-23 22:55:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2024-11-23 22:55:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 9112. [2024-11-23 22:55:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 6684 states have (on average 1.2881508078994615) internal successors, (8610), 6746 states have internal predecessors, (8610), 1580 states have call successors, (1580), 847 states have call predecessors, (1580), 847 states have return successors, (1580), 1518 states have call predecessors, (1580), 1580 states have call successors, (1580) [2024-11-23 22:55:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 11770 transitions. [2024-11-23 22:55:40,523 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 11770 transitions. Word has length 157 [2024-11-23 22:55:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:40,523 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 11770 transitions. [2024-11-23 22:55:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.37037037037037) internal successors, (226), 27 states have internal predecessors, (226), 8 states have call successors, (30), 5 states have call predecessors, (30), 6 states have return successors, (29), 8 states have call predecessors, (29), 8 states have call successors, (29) [2024-11-23 22:55:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 11770 transitions. [2024-11-23 22:55:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-23 22:55:40,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:40,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-23 22:55:40,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-23 22:55:40,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:40,765 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 783351040, now seen corresponding path program 1 times [2024-11-23 22:55:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142321578] [2024-11-23 22:55:40,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-23 22:55:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142321578] [2024-11-23 22:55:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142321578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:55:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789052657] [2024-11-23 22:55:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:43,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:55:43,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:55:43,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 22:55:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:43,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-23 22:55:43,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:55:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 65 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 22:55:44,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:55:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-23 22:55:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789052657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:44,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 22 [2024-11-23 22:55:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579441664] [2024-11-23 22:55:44,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-23 22:55:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:44,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 22:55:44,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-23 22:55:44,577 INFO L87 Difference]: Start difference. First operand 9112 states and 11770 transitions. Second operand has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 17 states have internal predecessors, (169), 4 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-23 22:55:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:55:53,386 INFO L93 Difference]: Finished difference Result 24326 states and 31327 transitions. [2024-11-23 22:55:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-23 22:55:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 17 states have internal predecessors, (169), 4 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) Word has length 158 [2024-11-23 22:55:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:55:53,474 INFO L225 Difference]: With dead ends: 24326 [2024-11-23 22:55:53,475 INFO L226 Difference]: Without dead ends: 15486 [2024-11-23 22:55:53,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2024-11-23 22:55:53,501 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 929 mSDsluCounter, 4647 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 5078 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:55:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 5078 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-23 22:55:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15486 states. [2024-11-23 22:55:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15486 to 10278. [2024-11-23 22:55:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10278 states, 7524 states have (on average 1.2880116959064327) internal successors, (9691), 7598 states have internal predecessors, (9691), 1782 states have call successors, (1782), 971 states have call predecessors, (1782), 971 states have return successors, (1782), 1708 states have call predecessors, (1782), 1782 states have call successors, (1782) [2024-11-23 22:55:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 13255 transitions. [2024-11-23 22:55:57,243 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 13255 transitions. Word has length 158 [2024-11-23 22:55:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:55:57,244 INFO L471 AbstractCegarLoop]: Abstraction has 10278 states and 13255 transitions. [2024-11-23 22:55:57,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 17 states have internal predecessors, (169), 4 states have call successors, (24), 4 states have call predecessors, (24), 8 states have return successors, (27), 8 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-23 22:55:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 13255 transitions. [2024-11-23 22:55:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-23 22:55:57,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:55:57,258 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-23 22:55:57,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 22:55:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:57,463 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:55:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:55:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1346805712, now seen corresponding path program 1 times [2024-11-23 22:55:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:55:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121683646] [2024-11-23 22:55:57,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:55:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-23 22:55:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:55:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121683646] [2024-11-23 22:55:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121683646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:55:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842876972] [2024-11-23 22:55:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:55:57,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:55:57,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:55:57,933 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:55:57,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 22:55:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:55:58,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 22:55:58,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:55:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-23 22:55:58,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:55:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-23 22:55:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842876972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:55:58,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:55:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-11-23 22:55:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725381998] [2024-11-23 22:55:58,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:55:58,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 22:55:58,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:55:58,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 22:55:58,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-23 22:55:58,583 INFO L87 Difference]: Start difference. First operand 10278 states and 13255 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-23 22:56:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:56:02,387 INFO L93 Difference]: Finished difference Result 20510 states and 26444 transitions. [2024-11-23 22:56:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 22:56:02,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 166 [2024-11-23 22:56:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:56:02,451 INFO L225 Difference]: With dead ends: 20510 [2024-11-23 22:56:02,451 INFO L226 Difference]: Without dead ends: 10440 [2024-11-23 22:56:02,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-23 22:56:02,473 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 73 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:56:02,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1454 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:56:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2024-11-23 22:56:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10278. [2024-11-23 22:56:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10278 states, 7524 states have (on average 1.2874800637958532) internal successors, (9687), 7598 states have internal predecessors, (9687), 1782 states have call successors, (1782), 971 states have call predecessors, (1782), 971 states have return successors, (1782), 1708 states have call predecessors, (1782), 1782 states have call successors, (1782) [2024-11-23 22:56:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 13251 transitions. [2024-11-23 22:56:04,755 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 13251 transitions. Word has length 166 [2024-11-23 22:56:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:56:04,756 INFO L471 AbstractCegarLoop]: Abstraction has 10278 states and 13251 transitions. [2024-11-23 22:56:04,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-23 22:56:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 13251 transitions. [2024-11-23 22:56:04,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-23 22:56:04,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:56:04,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 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-23 22:56:04,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 22:56:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-23 22:56:04,967 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:56:04,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:56:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -511519232, now seen corresponding path program 1 times [2024-11-23 22:56:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:56:04,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272748408] [2024-11-23 22:56:04,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:56:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:56:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:56:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-23 22:56:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:56:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272748408] [2024-11-23 22:56:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272748408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:56:06,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147834142] [2024-11-23 22:56:06,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:56:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:56:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:56:06,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:56:06,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 22:56:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:56:06,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 22:56:06,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:56:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-23 22:56:06,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:56:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-23 22:56:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147834142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:56:07,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:56:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 22 [2024-11-23 22:56:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609007066] [2024-11-23 22:56:07,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:56:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-23 22:56:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:56:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-23 22:56:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-23 22:56:07,145 INFO L87 Difference]: Start difference. First operand 10278 states and 13251 transitions. Second operand has 22 states, 22 states have (on average 8.0) internal successors, (176), 17 states have internal predecessors, (176), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-23 22:56:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:56:12,865 INFO L93 Difference]: Finished difference Result 28807 states and 38222 transitions. [2024-11-23 22:56:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-23 22:56:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 17 states have internal predecessors, (176), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) Word has length 174 [2024-11-23 22:56:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:56:12,974 INFO L225 Difference]: With dead ends: 28807 [2024-11-23 22:56:12,975 INFO L226 Difference]: Without dead ends: 18737 [2024-11-23 22:56:13,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2024-11-23 22:56:13,005 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 476 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 4782 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:56:13,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 4782 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-23 22:56:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18737 states. [2024-11-23 22:56:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18737 to 12390. [2024-11-23 22:56:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12390 states, 9038 states have (on average 1.2857933171055542) internal successors, (11621), 9134 states have internal predecessors, (11621), 2166 states have call successors, (2166), 1185 states have call predecessors, (2166), 1185 states have return successors, (2166), 2070 states have call predecessors, (2166), 2166 states have call successors, (2166) [2024-11-23 22:56:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 15953 transitions. [2024-11-23 22:56:16,054 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 15953 transitions. Word has length 174 [2024-11-23 22:56:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:56:16,054 INFO L471 AbstractCegarLoop]: Abstraction has 12390 states and 15953 transitions. [2024-11-23 22:56:16,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 17 states have internal predecessors, (176), 4 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-23 22:56:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 15953 transitions. [2024-11-23 22:56:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-23 22:56:16,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:56:16,060 INFO L218 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, 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] [2024-11-23 22:56:16,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 22:56:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:56:16,261 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:56:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:56:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1832391060, now seen corresponding path program 1 times [2024-11-23 22:56:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:56:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692002484] [2024-11-23 22:56:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:56:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:56:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:56:16,390 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 22:56:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:56:16,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 22:56:16,655 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 22:56:16,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 22:56:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-23 22:56:16,678 INFO L422 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] [2024-11-23 22:56:17,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 22:56:17,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:56:17 BoogieIcfgContainer [2024-11-23 22:56:17,045 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 22:56:17,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 22:56:17,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 22:56:17,050 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 22:56:17,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:20" (3/4) ... [2024-11-23 22:56:17,052 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 22:56:17,377 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 142. [2024-11-23 22:56:17,524 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 22:56:17,525 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 22:56:17,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 22:56:17,526 INFO L158 Benchmark]: Toolchain (without parser) took 118889.84ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 130.6MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-23 22:56:17,527 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:56:17,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 112.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 22:56:17,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.84ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:56:17,527 INFO L158 Benchmark]: Boogie Preprocessor took 129.84ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:56:17,528 INFO L158 Benchmark]: RCFGBuilder took 1185.77ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 65.0MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-23 22:56:17,528 INFO L158 Benchmark]: TraceAbstraction took 116526.14ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 64.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-23 22:56:17,528 INFO L158 Benchmark]: Witness Printer took 479.10ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-23 22:56:17,530 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.50ms. Allocated memory is still 167.8MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.51ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 112.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.84ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 109.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 129.84ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1185.77ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 65.0MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 116526.14ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 64.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 479.10ms. Allocated memory is still 3.0GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. 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: 610]: 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 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, 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=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L203] COND FALSE !((int )active_side_History_0 != -2) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L215] COND FALSE !((int )active_side_History_1 != -2) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L227] COND FALSE !((int )active_side_History_2 != -2) 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, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L576] 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 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=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L576] RET Console_task_each_pals_period() [L577] 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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=127, 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] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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) [L407] 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=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L409] 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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-1, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L442] COND TRUE ! side2Failed [L443] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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) 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L447] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L448] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L450] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L452] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L478] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L494] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L496] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L510] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, index=2, manual_selection_History_0=127, 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L510] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L529] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L596] RET, EXPR check() [L596] c1 = check() [L597] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L608] 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=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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] [L597] 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=127, cs2=0, cs2_new=-1, cs2_old=127, i2=1, manual_selection_History_0=127, 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] [L576] 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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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] [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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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] [L576] RET Console_task_each_pals_period() [L577] 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 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=127, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=0, side1Failed_History_0=0, 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] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_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=127, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, 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] [L290] 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=127, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, 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] [L293] 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=127, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, 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] [L294] COND TRUE (int )side2 != (int )nomsg [L295] 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=127, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, 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=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, 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] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_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=127, manual_selection=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=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=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L409] 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 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=-1, cs2=0, cs2_new=0, cs2_old=127, manual_selection_History_0=0, manual_selection_History_1=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=127, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [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=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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L608] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L610] reach_error() VAL [\old(arg)=0, active_side_History_0=0, 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=127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.1s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 58.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16240 SdHoareTripleChecker+Valid, 19.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16179 mSDsluCounter, 59677 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48403 mSDsCounter, 4413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14824 IncrementalHoareTripleChecker+Invalid, 19237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4413 mSolverCounterUnsat, 11274 mSDtfsCounter, 14824 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3076 GetRequests, 2544 SyntacticMatches, 0 SemanticMatches, 532 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9248 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred in iteration=35, InterpolantAutomatonStates: 428, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 18699 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 4971 NumberOfCodeBlocks, 4971 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 5857 ConstructedInterpolants, 0 QuantifiedInterpolants, 16466 SizeOfPredicates, 31 NumberOfNonLiveVariables, 6633 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 51 InterpolantComputations, 28 PerfectInterpolantSequences, 2121/2343 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 22:56:17,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_41fbf8fa-4d1b-454a-a730-19006840521a/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE