./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya --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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:25:17,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:25:17,473 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:25:17,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:25:17,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:25:17,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:25:17,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:25:17,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:25:17,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:25:17,504 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:25:17,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:25:17,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:25:17,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:25:17,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:25:17,507 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:25:17,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:25:17,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:25:17,508 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:25:17,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:25:17,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:25:17,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:25:17,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:25:17,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:25:17,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:25:17,511 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:25:17,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:25:17,512 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:25:17,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:25:17,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:25:17,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:25:17,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:25:17,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:17,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:25:17,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:25:17,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:25:17,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:25:17,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:25:17,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:25:17,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:25:17,516 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:25:17,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:25:17,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:25:17,517 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2023-11-29 05:25:17,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:25:17,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:25:17,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:25:17,765 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:25:17,766 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:25:17,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2023-11-29 05:25:20,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:25:20,721 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:25:20,721 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2023-11-29 05:25:20,735 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/data/1d1e10d61/0391ea70343742df9e615aee63b73f4c/FLAGb7fa29740 [2023-11-29 05:25:21,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/data/1d1e10d61/0391ea70343742df9e615aee63b73f4c [2023-11-29 05:25:21,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:25:21,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:25:21,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:21,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:25:21,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:25:21,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae4da67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21, skipping insertion in model container [2023-11-29 05:25:21,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,115 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:25:21,325 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2023-11-29 05:25:21,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:21,341 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:25:21,402 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2023-11-29 05:25:21,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:21,419 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:25:21,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21 WrapperNode [2023-11-29 05:25:21,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:21,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:21,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:25:21,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:25:21,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,474 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 495 [2023-11-29 05:25:21,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:21,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:25:21,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:25:21,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:25:21,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,511 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]. [2023-11-29 05:25:21,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:25:21,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:25:21,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:25:21,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:25:21,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (1/1) ... [2023-11-29 05:25:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:21,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:25:21,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:25:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2023-11-29 05:25:21,611 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2023-11-29 05:25:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:25:21,611 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2023-11-29 05:25:21,612 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2023-11-29 05:25:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-11-29 05:25:21,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-11-29 05:25:21,612 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2023-11-29 05:25:21,613 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2023-11-29 05:25:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:25:21,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:25:21,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:25:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2023-11-29 05:25:21,614 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2023-11-29 05:25:21,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:25:21,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:25:21,615 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2023-11-29 05:25:21,615 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2023-11-29 05:25:21,716 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:25:21,718 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:25:22,174 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:25:22,220 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:25:22,220 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:25:22,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:22 BoogieIcfgContainer [2023-11-29 05:25:22,221 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:25:22,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:25:22,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:25:22,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:25:22,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:25:21" (1/3) ... [2023-11-29 05:25:22,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e426eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:22, skipping insertion in model container [2023-11-29 05:25:22,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:21" (2/3) ... [2023-11-29 05:25:22,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e426eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:22, skipping insertion in model container [2023-11-29 05:25:22,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:22" (3/3) ... [2023-11-29 05:25:22,229 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2023-11-29 05:25:22,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:25:22,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:25:22,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:25:22,296 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@25ee5612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:25:22,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:25:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 05:25:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:25:22,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:22,310 INFO L195 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] [2023-11-29 05:25:22,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:22,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1825629780, now seen corresponding path program 1 times [2023-11-29 05:25:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:22,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97792301] [2023-11-29 05:25:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:25:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97792301] [2023-11-29 05:25:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97792301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:25:22,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207775668] [2023-11-29 05:25:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:22,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:25:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:25:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:25:22,562 INFO L87 Difference]: Start difference. First operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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) [2023-11-29 05:25:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:22,620 INFO L93 Difference]: Finished difference Result 323 states and 535 transitions. [2023-11-29 05:25:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:25:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2023-11-29 05:25:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:22,632 INFO L225 Difference]: With dead ends: 323 [2023-11-29 05:25:22,632 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 05:25:22,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:25:22,640 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:22,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 05:25:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-11-29 05:25:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.5625) internal successors, (200), 128 states have internal predecessors, (200), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 05:25:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 262 transitions. [2023-11-29 05:25:22,691 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 262 transitions. Word has length 23 [2023-11-29 05:25:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:22,692 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 262 transitions. [2023-11-29 05:25:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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) [2023-11-29 05:25:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 262 transitions. [2023-11-29 05:25:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:25:22,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:22,694 INFO L195 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] [2023-11-29 05:25:22,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:25:22,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:22,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash -168514926, now seen corresponding path program 1 times [2023-11-29 05:25:22,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:22,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055528685] [2023-11-29 05:25:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:25:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055528685] [2023-11-29 05:25:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055528685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:22,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:25:22,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898851006] [2023-11-29 05:25:22,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:25:22,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:25:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:25:22,875 INFO L87 Difference]: Start difference. First operand 167 states and 262 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-11-29 05:25:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:23,013 INFO L93 Difference]: Finished difference Result 426 states and 676 transitions. [2023-11-29 05:25:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:25:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2023-11-29 05:25:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:23,018 INFO L225 Difference]: With dead ends: 426 [2023-11-29 05:25:23,018 INFO L226 Difference]: Without dead ends: 272 [2023-11-29 05:25:23,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:25:23,021 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 127 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:23,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1238 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-29 05:25:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 167. [2023-11-29 05:25:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.46875) internal successors, (188), 128 states have internal predecessors, (188), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 05:25:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2023-11-29 05:25:23,047 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 23 [2023-11-29 05:25:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:23,048 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2023-11-29 05:25:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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) [2023-11-29 05:25:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2023-11-29 05:25:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:25:23,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:23,050 INFO L195 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] [2023-11-29 05:25:23,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:25:23,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:23,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1006236297, now seen corresponding path program 1 times [2023-11-29 05:25:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516829693] [2023-11-29 05:25:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:23,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516829693] [2023-11-29 05:25:23,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516829693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:23,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782083571] [2023-11-29 05:25:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:23,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:23,219 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:25:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:23,284 INFO L93 Difference]: Finished difference Result 322 states and 491 transitions. [2023-11-29 05:25:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:23,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (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 34 [2023-11-29 05:25:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:23,287 INFO L225 Difference]: With dead ends: 322 [2023-11-29 05:25:23,287 INFO L226 Difference]: Without dead ends: 171 [2023-11-29 05:25:23,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:23,289 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 5 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:23,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 707 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-29 05:25:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-29 05:25:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 131 states have internal predecessors, (191), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 05:25:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2023-11-29 05:25:23,305 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 34 [2023-11-29 05:25:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:23,306 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2023-11-29 05:25:23,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:25:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2023-11-29 05:25:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 05:25:23,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:23,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:23,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:25:23,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:23,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 960217751, now seen corresponding path program 1 times [2023-11-29 05:25:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052957556] [2023-11-29 05:25:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:25:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052957556] [2023-11-29 05:25:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052957556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:23,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002857587] [2023-11-29 05:25:23,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:23,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:23,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:23,399 INFO L87 Difference]: Start difference. First operand 171 states and 253 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:23,453 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2023-11-29 05:25:23,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 48 [2023-11-29 05:25:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:23,457 INFO L225 Difference]: With dead ends: 470 [2023-11-29 05:25:23,457 INFO L226 Difference]: Without dead ends: 315 [2023-11-29 05:25:23,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:23,459 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 206 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:23,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-29 05:25:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2023-11-29 05:25:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 234 states have (on average 1.4743589743589745) internal successors, (345), 235 states have internal predecessors, (345), 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) [2023-11-29 05:25:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 465 transitions. [2023-11-29 05:25:23,492 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 465 transitions. Word has length 48 [2023-11-29 05:25:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:23,492 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 465 transitions. [2023-11-29 05:25:23,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 465 transitions. [2023-11-29 05:25:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:25:23,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:23,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:23,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:25:23,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:23,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1818036195, now seen corresponding path program 1 times [2023-11-29 05:25:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252475828] [2023-11-29 05:25:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:25:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252475828] [2023-11-29 05:25:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252475828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86937107] [2023-11-29 05:25:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:23,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:23,574 INFO L87 Difference]: Start difference. First operand 311 states and 465 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:23,649 INFO L93 Difference]: Finished difference Result 877 states and 1321 transitions. [2023-11-29 05:25:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:23,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (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 49 [2023-11-29 05:25:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:23,656 INFO L225 Difference]: With dead ends: 877 [2023-11-29 05:25:23,656 INFO L226 Difference]: Without dead ends: 582 [2023-11-29 05:25:23,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:23,658 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 207 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:23,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 509 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-11-29 05:25:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 576. [2023-11-29 05:25:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 427 states have (on average 1.4824355971896956) internal successors, (633), 430 states have internal predecessors, (633), 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) [2023-11-29 05:25:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 867 transitions. [2023-11-29 05:25:23,713 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 867 transitions. Word has length 49 [2023-11-29 05:25:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:23,714 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 867 transitions. [2023-11-29 05:25:23,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 867 transitions. [2023-11-29 05:25:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:25:23,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:23,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:23,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:25:23,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:23,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash 538172517, now seen corresponding path program 1 times [2023-11-29 05:25:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740737051] [2023-11-29 05:25:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:25:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740737051] [2023-11-29 05:25:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740737051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566320008] [2023-11-29 05:25:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:23,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:23,844 INFO L87 Difference]: Start difference. First operand 576 states and 867 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:24,063 INFO L93 Difference]: Finished difference Result 1221 states and 1838 transitions. [2023-11-29 05:25:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 49 [2023-11-29 05:25:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:24,069 INFO L225 Difference]: With dead ends: 1221 [2023-11-29 05:25:24,070 INFO L226 Difference]: Without dead ends: 661 [2023-11-29 05:25:24,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:24,073 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 336 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:24,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 644 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-29 05:25:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2023-11-29 05:25:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4707070707070706) internal successors, (728), 498 states have internal predecessors, (728), 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) [2023-11-29 05:25:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 976 transitions. [2023-11-29 05:25:24,143 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 976 transitions. Word has length 49 [2023-11-29 05:25:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:24,143 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 976 transitions. [2023-11-29 05:25:24,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 976 transitions. [2023-11-29 05:25:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:25:24,146 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:24,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:24,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:25:24,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:24,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1226003250, now seen corresponding path program 1 times [2023-11-29 05:25:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193701334] [2023-11-29 05:25:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:25:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:24,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193701334] [2023-11-29 05:25:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193701334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:24,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:25:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774263783] [2023-11-29 05:25:24,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:24,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:24,262 INFO L87 Difference]: Start difference. First operand 657 states and 976 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:24,449 INFO L93 Difference]: Finished difference Result 1221 states and 1830 transitions. [2023-11-29 05:25:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 50 [2023-11-29 05:25:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:24,455 INFO L225 Difference]: With dead ends: 1221 [2023-11-29 05:25:24,456 INFO L226 Difference]: Without dead ends: 661 [2023-11-29 05:25:24,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:24,459 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 332 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:24,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 647 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-29 05:25:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2023-11-29 05:25:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4626262626262627) internal successors, (724), 498 states have internal predecessors, (724), 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) [2023-11-29 05:25:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 972 transitions. [2023-11-29 05:25:24,529 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 972 transitions. Word has length 50 [2023-11-29 05:25:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:24,529 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 972 transitions. [2023-11-29 05:25:24,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 972 transitions. [2023-11-29 05:25:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:25:24,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:24,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:25:24,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:24,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -157915880, now seen corresponding path program 1 times [2023-11-29 05:25:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419243963] [2023-11-29 05:25:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419243963] [2023-11-29 05:25:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419243963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569998097] [2023-11-29 05:25:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:24,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:24,723 INFO L87 Difference]: Start difference. First operand 657 states and 972 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:25:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:24,822 INFO L93 Difference]: Finished difference Result 1237 states and 1850 transitions. [2023-11-29 05:25:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 51 [2023-11-29 05:25:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:24,828 INFO L225 Difference]: With dead ends: 1237 [2023-11-29 05:25:24,828 INFO L226 Difference]: Without dead ends: 677 [2023-11-29 05:25:24,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:24,831 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 6 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:24,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 719 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2023-11-29 05:25:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2023-11-29 05:25:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 511 states have (on average 1.4481409001956946) internal successors, (740), 514 states have internal predecessors, (740), 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) [2023-11-29 05:25:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 988 transitions. [2023-11-29 05:25:24,892 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 988 transitions. Word has length 51 [2023-11-29 05:25:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:24,892 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 988 transitions. [2023-11-29 05:25:24,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:25:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 988 transitions. [2023-11-29 05:25:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:25:24,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:24,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:24,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:25:24,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:24,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash -957591869, now seen corresponding path program 1 times [2023-11-29 05:25:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:24,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470898320] [2023-11-29 05:25:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:25,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470898320] [2023-11-29 05:25:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470898320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345447964] [2023-11-29 05:25:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:25,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:25,044 INFO L87 Difference]: Start difference. First operand 677 states and 988 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:25:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:25,148 INFO L93 Difference]: Finished difference Result 1277 states and 1894 transitions. [2023-11-29 05:25:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 59 [2023-11-29 05:25:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:25,154 INFO L225 Difference]: With dead ends: 1277 [2023-11-29 05:25:25,155 INFO L226 Difference]: Without dead ends: 697 [2023-11-29 05:25:25,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:25,158 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 6 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:25,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-11-29 05:25:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2023-11-29 05:25:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 527 states have (on average 1.4345351043643264) internal successors, (756), 530 states have internal predecessors, (756), 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) [2023-11-29 05:25:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1004 transitions. [2023-11-29 05:25:25,231 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1004 transitions. Word has length 59 [2023-11-29 05:25:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:25,232 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1004 transitions. [2023-11-29 05:25:25,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:25:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1004 transitions. [2023-11-29 05:25:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 05:25:25,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:25,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:25,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:25:25,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:25,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1844870161, now seen corresponding path program 1 times [2023-11-29 05:25:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763793386] [2023-11-29 05:25:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:25,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:25,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763793386] [2023-11-29 05:25:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763793386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:25,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:25,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244373934] [2023-11-29 05:25:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:25,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:25,396 INFO L87 Difference]: Start difference. First operand 697 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:25:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:25,500 INFO L93 Difference]: Finished difference Result 1317 states and 1926 transitions. [2023-11-29 05:25:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2023-11-29 05:25:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:25,506 INFO L225 Difference]: With dead ends: 1317 [2023-11-29 05:25:25,506 INFO L226 Difference]: Without dead ends: 717 [2023-11-29 05:25:25,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:25,509 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 6 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:25,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 705 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-29 05:25:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2023-11-29 05:25:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 543 states have (on average 1.4217311233885819) internal successors, (772), 546 states have internal predecessors, (772), 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) [2023-11-29 05:25:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1020 transitions. [2023-11-29 05:25:25,569 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1020 transitions. Word has length 67 [2023-11-29 05:25:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:25,569 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1020 transitions. [2023-11-29 05:25:25,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:25:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1020 transitions. [2023-11-29 05:25:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 05:25:25,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:25,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:25,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:25:25,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:25,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 53637832, now seen corresponding path program 1 times [2023-11-29 05:25:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345704598] [2023-11-29 05:25:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:25:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345704598] [2023-11-29 05:25:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345704598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008109977] [2023-11-29 05:25:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:25,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:25,715 INFO L87 Difference]: Start difference. First operand 717 states and 1020 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:25:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:25,807 INFO L93 Difference]: Finished difference Result 1353 states and 1942 transitions. [2023-11-29 05:25:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2023-11-29 05:25:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:25,813 INFO L225 Difference]: With dead ends: 1353 [2023-11-29 05:25:25,813 INFO L226 Difference]: Without dead ends: 733 [2023-11-29 05:25:25,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:25,816 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:25,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 714 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-11-29 05:25:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2023-11-29 05:25:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 555 states have (on average 1.4126126126126126) internal successors, (784), 558 states have internal predecessors, (784), 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) [2023-11-29 05:25:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1032 transitions. [2023-11-29 05:25:25,875 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1032 transitions. Word has length 67 [2023-11-29 05:25:25,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:25,875 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1032 transitions. [2023-11-29 05:25:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:25:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1032 transitions. [2023-11-29 05:25:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 05:25:25,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:25,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:25,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:25:25,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:25,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -343959825, now seen corresponding path program 1 times [2023-11-29 05:25:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689681417] [2023-11-29 05:25:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:25:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689681417] [2023-11-29 05:25:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689681417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997105340] [2023-11-29 05:25:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:26,045 INFO L87 Difference]: Start difference. First operand 733 states and 1032 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:25:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:26,125 INFO L93 Difference]: Finished difference Result 1393 states and 1978 transitions. [2023-11-29 05:25:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:26,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (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 75 [2023-11-29 05:25:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:26,130 INFO L225 Difference]: With dead ends: 1393 [2023-11-29 05:25:26,130 INFO L226 Difference]: Without dead ends: 757 [2023-11-29 05:25:26,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:26,133 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 7 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:26,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 716 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-11-29 05:25:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2023-11-29 05:25:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 575 states have (on average 1.3982608695652174) internal successors, (804), 578 states have internal predecessors, (804), 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) [2023-11-29 05:25:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1052 transitions. [2023-11-29 05:25:26,172 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1052 transitions. Word has length 75 [2023-11-29 05:25:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:26,172 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 1052 transitions. [2023-11-29 05:25:26,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:25:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1052 transitions. [2023-11-29 05:25:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-29 05:25:26,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:26,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:26,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:25:26,175 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:26,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash -946423420, now seen corresponding path program 1 times [2023-11-29 05:25:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579717915] [2023-11-29 05:25:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:25:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579717915] [2023-11-29 05:25:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579717915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:25:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800794302] [2023-11-29 05:25:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:26,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:26,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:26,402 INFO L87 Difference]: Start difference. First operand 757 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (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) [2023-11-29 05:25:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:26,712 INFO L93 Difference]: Finished difference Result 2125 states and 2971 transitions. [2023-11-29 05:25:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (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 78 [2023-11-29 05:25:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:26,721 INFO L225 Difference]: With dead ends: 2125 [2023-11-29 05:25:26,721 INFO L226 Difference]: Without dead ends: 1465 [2023-11-29 05:25:26,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:25:26,723 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 260 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1342 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:25:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2023-11-29 05:25:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1033. [2023-11-29 05:25:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 778 states have (on average 1.3856041131105399) internal successors, (1078), 783 states have internal predecessors, (1078), 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) [2023-11-29 05:25:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1422 transitions. [2023-11-29 05:25:26,824 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1422 transitions. Word has length 78 [2023-11-29 05:25:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:26,824 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1422 transitions. [2023-11-29 05:25:26,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (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) [2023-11-29 05:25:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1422 transitions. [2023-11-29 05:25:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:25:26,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:26,826 INFO L195 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] [2023-11-29 05:25:26,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:25:26,826 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:26,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -767138360, now seen corresponding path program 1 times [2023-11-29 05:25:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203137950] [2023-11-29 05:25:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:25:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203137950] [2023-11-29 05:25:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203137950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:25:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681728852] [2023-11-29 05:25:27,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:27,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:25:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:25:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:25:27,088 INFO L87 Difference]: Start difference. First operand 1033 states and 1422 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:25:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:27,417 INFO L93 Difference]: Finished difference Result 1441 states and 2082 transitions. [2023-11-29 05:25:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:25:27,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2023-11-29 05:25:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:27,427 INFO L225 Difference]: With dead ends: 1441 [2023-11-29 05:25:27,427 INFO L226 Difference]: Without dead ends: 1439 [2023-11-29 05:25:27,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:27,428 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 302 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:27,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 2398 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:25:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2023-11-29 05:25:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1041. [2023-11-29 05:25:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 782 states have (on average 1.3836317135549872) internal successors, (1082), 789 states have internal predecessors, (1082), 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) [2023-11-29 05:25:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2023-11-29 05:25:27,546 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1430 transitions. Word has length 81 [2023-11-29 05:25:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:27,546 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2023-11-29 05:25:27,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:25:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1430 transitions. [2023-11-29 05:25:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 05:25:27,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:27,548 INFO L195 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] [2023-11-29 05:25:27,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:25:27,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:27,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash -56029754, now seen corresponding path program 1 times [2023-11-29 05:25:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152432201] [2023-11-29 05:25:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:25:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 05:25:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152432201] [2023-11-29 05:25:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152432201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656865970] [2023-11-29 05:25:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:27,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:27,700 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:25:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:27,824 INFO L93 Difference]: Finished difference Result 1949 states and 2694 transitions. [2023-11-29 05:25:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:27,825 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, (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 82 [2023-11-29 05:25:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:27,832 INFO L225 Difference]: With dead ends: 1949 [2023-11-29 05:25:27,832 INFO L226 Difference]: Without dead ends: 1065 [2023-11-29 05:25:27,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:27,835 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:27,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 714 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2023-11-29 05:25:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2023-11-29 05:25:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 800 states have (on average 1.375) internal successors, (1100), 807 states have internal predecessors, (1100), 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) [2023-11-29 05:25:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1448 transitions. [2023-11-29 05:25:27,991 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1448 transitions. Word has length 82 [2023-11-29 05:25:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:27,991 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1448 transitions. [2023-11-29 05:25:27,992 INFO L496 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-29 05:25:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1448 transitions. [2023-11-29 05:25:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 05:25:27,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:27,994 INFO L195 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] [2023-11-29 05:25:27,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:25:27,994 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:27,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1106345292, now seen corresponding path program 1 times [2023-11-29 05:25:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407321601] [2023-11-29 05:25:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 05:25:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407321601] [2023-11-29 05:25:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407321601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:28,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:25:28,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361635712] [2023-11-29 05:25:28,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:28,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:28,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:28,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:28,155 INFO L87 Difference]: Start difference. First operand 1065 states and 1448 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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) [2023-11-29 05:25:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:28,385 INFO L93 Difference]: Finished difference Result 1923 states and 2615 transitions. [2023-11-29 05:25:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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 84 [2023-11-29 05:25:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:28,392 INFO L225 Difference]: With dead ends: 1923 [2023-11-29 05:25:28,393 INFO L226 Difference]: Without dead ends: 1097 [2023-11-29 05:25:28,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:25:28,396 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 242 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:28,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1407 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2023-11-29 05:25:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1059. [2023-11-29 05:25:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 805 states have (on average 1.368944099378882) internal successors, (1102), 817 states have internal predecessors, (1102), 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) [2023-11-29 05:25:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1426 transitions. [2023-11-29 05:25:28,504 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1426 transitions. Word has length 84 [2023-11-29 05:25:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:28,504 INFO L495 AbstractCegarLoop]: Abstraction has 1059 states and 1426 transitions. [2023-11-29 05:25:28,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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) [2023-11-29 05:25:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1426 transitions. [2023-11-29 05:25:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 05:25:28,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:28,506 INFO L195 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] [2023-11-29 05:25:28,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:25:28,506 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:28,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 263672170, now seen corresponding path program 1 times [2023-11-29 05:25:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735843569] [2023-11-29 05:25:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:25:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 05:25:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735843569] [2023-11-29 05:25:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735843569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:25:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559374542] [2023-11-29 05:25:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:28,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:28,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:28,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:28,694 INFO L87 Difference]: Start difference. First operand 1059 states and 1426 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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) [2023-11-29 05:25:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:28,940 INFO L93 Difference]: Finished difference Result 1997 states and 2719 transitions. [2023-11-29 05:25:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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 86 [2023-11-29 05:25:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:28,947 INFO L225 Difference]: With dead ends: 1997 [2023-11-29 05:25:28,947 INFO L226 Difference]: Without dead ends: 1157 [2023-11-29 05:25:28,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:25:28,949 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 198 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:28,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1570 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-11-29 05:25:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 951. [2023-11-29 05:25:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 724 states have (on average 1.37292817679558) internal successors, (994), 734 states have internal predecessors, (994), 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) [2023-11-29 05:25:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1284 transitions. [2023-11-29 05:25:29,028 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1284 transitions. Word has length 86 [2023-11-29 05:25:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:29,029 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1284 transitions. [2023-11-29 05:25:29,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 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) [2023-11-29 05:25:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1284 transitions. [2023-11-29 05:25:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 05:25:29,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:29,030 INFO L195 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] [2023-11-29 05:25:29,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:25:29,030 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:29,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 966578310, now seen corresponding path program 1 times [2023-11-29 05:25:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879621851] [2023-11-29 05:25:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:25:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:25:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:25:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879621851] [2023-11-29 05:25:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879621851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:25:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303436817] [2023-11-29 05:25:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:29,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:25:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:25:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:25:29,250 INFO L87 Difference]: Start difference. First operand 951 states and 1284 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:25:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:29,900 INFO L93 Difference]: Finished difference Result 2056 states and 2814 transitions. [2023-11-29 05:25:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:25:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2023-11-29 05:25:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:29,909 INFO L225 Difference]: With dead ends: 2056 [2023-11-29 05:25:29,909 INFO L226 Difference]: Without dead ends: 1243 [2023-11-29 05:25:29,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:29,912 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 500 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:29,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1630 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:25:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-11-29 05:25:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 967. [2023-11-29 05:25:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 732 states have (on average 1.348360655737705) internal successors, (987), 743 states have internal predecessors, (987), 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) [2023-11-29 05:25:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1283 transitions. [2023-11-29 05:25:30,043 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1283 transitions. Word has length 87 [2023-11-29 05:25:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:30,043 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1283 transitions. [2023-11-29 05:25:30,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:25:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1283 transitions. [2023-11-29 05:25:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 05:25:30,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:30,045 INFO L195 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] [2023-11-29 05:25:30,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:25:30,045 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:30,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash 67600567, now seen corresponding path program 1 times [2023-11-29 05:25:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829483713] [2023-11-29 05:25:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:25:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:25:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:25:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:25:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:25:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:30,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:30,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829483713] [2023-11-29 05:25:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829483713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:30,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:30,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807806330] [2023-11-29 05:25:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:30,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:30,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:30,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:30,153 INFO L87 Difference]: Start difference. First operand 967 states and 1283 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-11-29 05:25:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:30,422 INFO L93 Difference]: Finished difference Result 2574 states and 3431 transitions. [2023-11-29 05:25:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 88 [2023-11-29 05:25:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:30,435 INFO L225 Difference]: With dead ends: 2574 [2023-11-29 05:25:30,435 INFO L226 Difference]: Without dead ends: 1796 [2023-11-29 05:25:30,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:30,438 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 197 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:30,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1079 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2023-11-29 05:25:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1687. [2023-11-29 05:25:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1262 states have (on average 1.338351822503962) internal successors, (1689), 1281 states have internal predecessors, (1689), 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) [2023-11-29 05:25:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2233 transitions. [2023-11-29 05:25:30,669 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2233 transitions. Word has length 88 [2023-11-29 05:25:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:30,670 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2233 transitions. [2023-11-29 05:25:30,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-11-29 05:25:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2233 transitions. [2023-11-29 05:25:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 05:25:30,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:30,671 INFO L195 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] [2023-11-29 05:25:30,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:25:30,672 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:30,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1150089516, now seen corresponding path program 1 times [2023-11-29 05:25:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576541058] [2023-11-29 05:25:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:30,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:25:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:25:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:25:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:25:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:25:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:25:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576541058] [2023-11-29 05:25:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576541058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:30,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:25:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718749782] [2023-11-29 05:25:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:30,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:30,949 INFO L87 Difference]: Start difference. First operand 1687 states and 2233 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, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:25:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:31,782 INFO L93 Difference]: Finished difference Result 3546 states and 4750 transitions. [2023-11-29 05:25:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:25:31,782 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, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-11-29 05:25:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:31,797 INFO L225 Difference]: With dead ends: 3546 [2023-11-29 05:25:31,797 INFO L226 Difference]: Without dead ends: 2120 [2023-11-29 05:25:31,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:31,802 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 566 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:31,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1579 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:25:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2023-11-29 05:25:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1716. [2023-11-29 05:25:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1278 states have (on average 1.3309859154929577) internal successors, (1701), 1298 states have internal predecessors, (1701), 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) [2023-11-29 05:25:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2261 transitions. [2023-11-29 05:25:32,064 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2261 transitions. Word has length 90 [2023-11-29 05:25:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:32,064 INFO L495 AbstractCegarLoop]: Abstraction has 1716 states and 2261 transitions. [2023-11-29 05:25:32,065 INFO L496 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, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:25:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2261 transitions. [2023-11-29 05:25:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-29 05:25:32,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:32,067 INFO L195 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] [2023-11-29 05:25:32,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:25:32,067 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:32,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1157902383, now seen corresponding path program 1 times [2023-11-29 05:25:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548711046] [2023-11-29 05:25:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:25:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:25:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:25:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:25:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:25:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:25:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:25:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548711046] [2023-11-29 05:25:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548711046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:32,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086984803] [2023-11-29 05:25:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:32,175 INFO L87 Difference]: Start difference. First operand 1716 states and 2261 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-29 05:25:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:32,566 INFO L93 Difference]: Finished difference Result 4378 states and 5797 transitions. [2023-11-29 05:25:32,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:32,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2023-11-29 05:25:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:32,584 INFO L225 Difference]: With dead ends: 4378 [2023-11-29 05:25:32,584 INFO L226 Difference]: Without dead ends: 2968 [2023-11-29 05:25:32,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:32,589 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 202 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:32,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1115 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2023-11-29 05:25:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2717. [2023-11-29 05:25:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2004 states have (on average 1.318363273453094) internal successors, (2642), 2035 states have internal predecessors, (2642), 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) [2023-11-29 05:25:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3562 transitions. [2023-11-29 05:25:32,977 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3562 transitions. Word has length 92 [2023-11-29 05:25:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:32,978 INFO L495 AbstractCegarLoop]: Abstraction has 2717 states and 3562 transitions. [2023-11-29 05:25:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-29 05:25:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3562 transitions. [2023-11-29 05:25:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-29 05:25:32,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:32,981 INFO L195 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] [2023-11-29 05:25:32,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:25:32,981 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:32,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1853622775, now seen corresponding path program 1 times [2023-11-29 05:25:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687774917] [2023-11-29 05:25:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:25:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:25:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:25:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:25:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:25:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:25:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687774917] [2023-11-29 05:25:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687774917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996069728] [2023-11-29 05:25:33,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:33,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:33,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:33,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:33,091 INFO L87 Difference]: Start difference. First operand 2717 states and 3562 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-29 05:25:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:33,560 INFO L93 Difference]: Finished difference Result 6377 states and 8393 transitions. [2023-11-29 05:25:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2023-11-29 05:25:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:33,582 INFO L225 Difference]: With dead ends: 6377 [2023-11-29 05:25:33,583 INFO L226 Difference]: Without dead ends: 4078 [2023-11-29 05:25:33,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:33,590 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 196 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:33,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1131 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2023-11-29 05:25:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3905. [2023-11-29 05:25:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 2868 states have (on average 1.3138075313807531) internal successors, (3768), 2912 states have internal predecessors, (3768), 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) [2023-11-29 05:25:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5112 transitions. [2023-11-29 05:25:34,013 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5112 transitions. Word has length 92 [2023-11-29 05:25:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:34,013 INFO L495 AbstractCegarLoop]: Abstraction has 3905 states and 5112 transitions. [2023-11-29 05:25:34,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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) [2023-11-29 05:25:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5112 transitions. [2023-11-29 05:25:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 05:25:34,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:34,017 INFO L195 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] [2023-11-29 05:25:34,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:25:34,017 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:34,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 117513798, now seen corresponding path program 1 times [2023-11-29 05:25:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616352121] [2023-11-29 05:25:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:25:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:25:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:25:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:25:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:25:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:25:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616352121] [2023-11-29 05:25:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616352121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:34,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:34,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307202570] [2023-11-29 05:25:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:34,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:34,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:34,083 INFO L87 Difference]: Start difference. First operand 3905 states and 5112 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2023-11-29 05:25:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:34,460 INFO L93 Difference]: Finished difference Result 7523 states and 9889 transitions. [2023-11-29 05:25:34,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 93 [2023-11-29 05:25:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:34,480 INFO L225 Difference]: With dead ends: 7523 [2023-11-29 05:25:34,480 INFO L226 Difference]: Without dead ends: 3938 [2023-11-29 05:25:34,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:34,490 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:34,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 460 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2023-11-29 05:25:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3911. [2023-11-29 05:25:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 2874 states have (on average 1.313152400835073) internal successors, (3774), 2918 states have internal predecessors, (3774), 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) [2023-11-29 05:25:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 5118 transitions. [2023-11-29 05:25:35,029 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 5118 transitions. Word has length 93 [2023-11-29 05:25:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:35,030 INFO L495 AbstractCegarLoop]: Abstraction has 3911 states and 5118 transitions. [2023-11-29 05:25:35,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2023-11-29 05:25:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 5118 transitions. [2023-11-29 05:25:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 05:25:35,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:35,034 INFO L195 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] [2023-11-29 05:25:35,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:25:35,034 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:35,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 923535218, now seen corresponding path program 1 times [2023-11-29 05:25:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224601641] [2023-11-29 05:25:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:25:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:25:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:25:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:25:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:25:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:25:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224601641] [2023-11-29 05:25:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224601641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:35,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050747182] [2023-11-29 05:25:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:35,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:35,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:35,171 INFO L87 Difference]: Start difference. First operand 3911 states and 5118 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2023-11-29 05:25:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:35,589 INFO L93 Difference]: Finished difference Result 7493 states and 9821 transitions. [2023-11-29 05:25:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 94 [2023-11-29 05:25:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:35,601 INFO L225 Difference]: With dead ends: 7493 [2023-11-29 05:25:35,601 INFO L226 Difference]: Without dead ends: 3644 [2023-11-29 05:25:35,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:35,611 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 80 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:35,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 697 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2023-11-29 05:25:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3577. [2023-11-29 05:25:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 2623 states have (on average 1.321768966831872) internal successors, (3467), 2657 states have internal predecessors, (3467), 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) [2023-11-29 05:25:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4707 transitions. [2023-11-29 05:25:35,987 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4707 transitions. Word has length 94 [2023-11-29 05:25:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:35,987 INFO L495 AbstractCegarLoop]: Abstraction has 3577 states and 4707 transitions. [2023-11-29 05:25:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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) [2023-11-29 05:25:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4707 transitions. [2023-11-29 05:25:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 05:25:35,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:35,989 INFO L195 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] [2023-11-29 05:25:35,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:25:35,990 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:35,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1269679630, now seen corresponding path program 1 times [2023-11-29 05:25:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126644301] [2023-11-29 05:25:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:25:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:25:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:25:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:25:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:25:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:25:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126644301] [2023-11-29 05:25:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126644301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:36,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:36,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:36,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415515526] [2023-11-29 05:25:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:36,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:36,060 INFO L87 Difference]: Start difference. First operand 3577 states and 4707 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2023-11-29 05:25:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:36,399 INFO L93 Difference]: Finished difference Result 7042 states and 9302 transitions. [2023-11-29 05:25:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 95 [2023-11-29 05:25:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:36,413 INFO L225 Difference]: With dead ends: 7042 [2023-11-29 05:25:36,413 INFO L226 Difference]: Without dead ends: 3628 [2023-11-29 05:25:36,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:36,421 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:36,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 462 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2023-11-29 05:25:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3587. [2023-11-29 05:25:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2633 states have (on average 1.3205469046714775) internal successors, (3477), 2667 states have internal predecessors, (3477), 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) [2023-11-29 05:25:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4717 transitions. [2023-11-29 05:25:36,834 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4717 transitions. Word has length 95 [2023-11-29 05:25:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:36,834 INFO L495 AbstractCegarLoop]: Abstraction has 3587 states and 4717 transitions. [2023-11-29 05:25:36,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2023-11-29 05:25:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4717 transitions. [2023-11-29 05:25:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 05:25:36,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:36,837 INFO L195 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] [2023-11-29 05:25:36,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:25:36,838 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:36,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1910272599, now seen corresponding path program 1 times [2023-11-29 05:25:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852614942] [2023-11-29 05:25:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:25:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:25:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:25:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:25:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:25:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:25:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:25:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852614942] [2023-11-29 05:25:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852614942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263173507] [2023-11-29 05:25:36,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:36,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:36,969 INFO L87 Difference]: Start difference. First operand 3587 states and 4717 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2023-11-29 05:25:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:37,353 INFO L93 Difference]: Finished difference Result 7002 states and 9222 transitions. [2023-11-29 05:25:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:37,353 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), 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 95 [2023-11-29 05:25:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:37,365 INFO L225 Difference]: With dead ends: 7002 [2023-11-29 05:25:37,365 INFO L226 Difference]: Without dead ends: 3520 [2023-11-29 05:25:37,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:25:37,372 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 62 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:37,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 702 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2023-11-29 05:25:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 2699. [2023-11-29 05:25:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1979 states have (on average 1.3127842344618494) internal successors, (2598), 1998 states have internal predecessors, (2598), 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) [2023-11-29 05:25:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3536 transitions. [2023-11-29 05:25:37,738 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3536 transitions. Word has length 95 [2023-11-29 05:25:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:37,739 INFO L495 AbstractCegarLoop]: Abstraction has 2699 states and 3536 transitions. [2023-11-29 05:25:37,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2023-11-29 05:25:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3536 transitions. [2023-11-29 05:25:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 05:25:37,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:37,745 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:37,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 05:25:37,745 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:37,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1619272197, now seen corresponding path program 1 times [2023-11-29 05:25:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451613666] [2023-11-29 05:25:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 05:25:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 05:25:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:25:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 05:25:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:25:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 05:25:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 05:25:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 05:25:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451613666] [2023-11-29 05:25:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451613666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514831188] [2023-11-29 05:25:38,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:38,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:25:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:38,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:25:38,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:25:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:38,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:25:38,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:25:38,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 05:25:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514831188] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:25:38,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:25:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 05:25:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200479468] [2023-11-29 05:25:38,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:38,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:25:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:25:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:38,624 INFO L87 Difference]: Start difference. First operand 2699 states and 3536 transitions. Second operand has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 12 states have internal predecessors, (172), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2023-11-29 05:25:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:40,337 INFO L93 Difference]: Finished difference Result 6462 states and 8605 transitions. [2023-11-29 05:25:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:25:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 12 states have internal predecessors, (172), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 139 [2023-11-29 05:25:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:40,351 INFO L225 Difference]: With dead ends: 6462 [2023-11-29 05:25:40,351 INFO L226 Difference]: Without dead ends: 3991 [2023-11-29 05:25:40,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 05:25:40,357 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1376 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:40,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1811 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:25:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3991 states. [2023-11-29 05:25:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 3434. [2023-11-29 05:25:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3434 states, 2525 states have (on average 1.304950495049505) internal successors, (3295), 2549 states have internal predecessors, (3295), 585 states have call successors, (585), 323 states have call predecessors, (585), 323 states have return successors, (585), 561 states have call predecessors, (585), 585 states have call successors, (585) [2023-11-29 05:25:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4465 transitions. [2023-11-29 05:25:40,968 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4465 transitions. Word has length 139 [2023-11-29 05:25:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:40,968 INFO L495 AbstractCegarLoop]: Abstraction has 3434 states and 4465 transitions. [2023-11-29 05:25:40,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.23076923076923) internal successors, (172), 12 states have internal predecessors, (172), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2023-11-29 05:25:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4465 transitions. [2023-11-29 05:25:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:25:40,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:40,977 INFO L195 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] [2023-11-29 05:25:40,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:25:41,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:25:41,178 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:41,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1333955302, now seen corresponding path program 1 times [2023-11-29 05:25:41,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:41,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985215447] [2023-11-29 05:25:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:41,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:25:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:25:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:25:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 05:25:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:25:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:25:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:25:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 05:25:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 05:25:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:25:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 05:25:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:25:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 05:25:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:25:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:25:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985215447] [2023-11-29 05:25:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985215447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:25:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812129820] [2023-11-29 05:25:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:41,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:25:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:25:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:25:41,429 INFO L87 Difference]: Start difference. First operand 3434 states and 4465 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 05:25:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:42,708 INFO L93 Difference]: Finished difference Result 11136 states and 15043 transitions. [2023-11-29 05:25:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:25:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148 [2023-11-29 05:25:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:42,728 INFO L225 Difference]: With dead ends: 11136 [2023-11-29 05:25:42,728 INFO L226 Difference]: Without dead ends: 8028 [2023-11-29 05:25:42,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:25:42,735 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 325 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:42,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 2088 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8028 states. [2023-11-29 05:25:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8028 to 6160. [2023-11-29 05:25:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6160 states, 4483 states have (on average 1.306268124024091) internal successors, (5856), 4529 states have internal predecessors, (5856), 1095 states have call successors, (1095), 581 states have call predecessors, (1095), 581 states have return successors, (1095), 1049 states have call predecessors, (1095), 1095 states have call successors, (1095) [2023-11-29 05:25:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6160 states to 6160 states and 8046 transitions. [2023-11-29 05:25:43,615 INFO L78 Accepts]: Start accepts. Automaton has 6160 states and 8046 transitions. Word has length 148 [2023-11-29 05:25:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:43,615 INFO L495 AbstractCegarLoop]: Abstraction has 6160 states and 8046 transitions. [2023-11-29 05:25:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 05:25:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6160 states and 8046 transitions. [2023-11-29 05:25:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 05:25:43,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:43,627 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:25:43,627 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:43,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -6845380, now seen corresponding path program 1 times [2023-11-29 05:25:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781126621] [2023-11-29 05:25:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:25:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:25:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:25:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:25:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:25:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 05:25:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:25:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 05:25:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:25:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 05:25:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 05:25:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 05:25:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 05:25:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 05:25:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:25:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781126621] [2023-11-29 05:25:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781126621] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545928476] [2023-11-29 05:25:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:25:44,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:44,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:25:44,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:25:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:44,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:25:44,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 30 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:25:44,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-29 05:25:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545928476] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:25:44,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:25:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-11-29 05:25:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952447881] [2023-11-29 05:25:44,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:44,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:25:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:25:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:25:44,633 INFO L87 Difference]: Start difference. First operand 6160 states and 8046 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 14 states have internal predecessors, (180), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 05:25:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:52,537 INFO L93 Difference]: Finished difference Result 26269 states and 35192 transitions. [2023-11-29 05:25:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-11-29 05:25:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 14 states have internal predecessors, (180), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 148 [2023-11-29 05:25:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:52,605 INFO L225 Difference]: With dead ends: 26269 [2023-11-29 05:25:52,605 INFO L226 Difference]: Without dead ends: 20364 [2023-11-29 05:25:52,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 347 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1651, Invalid=10559, Unknown=0, NotChecked=0, Total=12210 [2023-11-29 05:25:52,626 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 4928 mSDsluCounter, 7381 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 2187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4928 SdHoareTripleChecker+Valid, 8350 SdHoareTripleChecker+Invalid, 4502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2187 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:52,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4928 Valid, 8350 Invalid, 4502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2187 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 05:25:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20364 states. [2023-11-29 05:25:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20364 to 8153. [2023-11-29 05:25:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8153 states, 5960 states have (on average 1.3043624161073826) internal successors, (7774), 6018 states have internal predecessors, (7774), 1423 states have call successors, (1423), 769 states have call predecessors, (1423), 769 states have return successors, (1423), 1365 states have call predecessors, (1423), 1423 states have call successors, (1423) [2023-11-29 05:25:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8153 states to 8153 states and 10620 transitions. [2023-11-29 05:25:53,951 INFO L78 Accepts]: Start accepts. Automaton has 8153 states and 10620 transitions. Word has length 148 [2023-11-29 05:25:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:53,951 INFO L495 AbstractCegarLoop]: Abstraction has 8153 states and 10620 transitions. [2023-11-29 05:25:53,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 14 states have internal predecessors, (180), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2023-11-29 05:25:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8153 states and 10620 transitions. [2023-11-29 05:25:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 05:25:53,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:53,961 INFO L195 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] [2023-11-29 05:25:53,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:25:54,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 05:25:54,162 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:54,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1875285967, now seen corresponding path program 1 times [2023-11-29 05:25:54,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848650302] [2023-11-29 05:25:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:25:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 05:25:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:25:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:25:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:25:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:25:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:25:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:25:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:25:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:25:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 05:25:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 05:25:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 05:25:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 05:25:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:25:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848650302] [2023-11-29 05:25:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848650302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819161612] [2023-11-29 05:25:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:25:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:54,467 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:25:54,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:25:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:54,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:25:54,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 05:25:54,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 05:25:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819161612] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:25:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2023-11-29 05:25:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41238848] [2023-11-29 05:25:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:54,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:25:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:25:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:54,782 INFO L87 Difference]: Start difference. First operand 8153 states and 10620 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 05:25:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:55,642 INFO L93 Difference]: Finished difference Result 13340 states and 17425 transitions. [2023-11-29 05:25:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2023-11-29 05:25:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:55,657 INFO L225 Difference]: With dead ends: 13340 [2023-11-29 05:25:55,657 INFO L226 Difference]: Without dead ends: 5372 [2023-11-29 05:25:55,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:25:55,667 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:55,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 718 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2023-11-29 05:25:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 5148. [2023-11-29 05:25:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 3766 states have (on average 1.3040361125862985) internal successors, (4911), 3800 states have internal predecessors, (4911), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2023-11-29 05:25:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 6713 transitions. [2023-11-29 05:25:56,367 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 6713 transitions. Word has length 151 [2023-11-29 05:25:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:56,368 INFO L495 AbstractCegarLoop]: Abstraction has 5148 states and 6713 transitions. [2023-11-29 05:25:56,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-29 05:25:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 6713 transitions. [2023-11-29 05:25:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:25:56,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:56,375 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:56,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:25:56,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:25:56,576 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:56,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1799095590, now seen corresponding path program 1 times [2023-11-29 05:25:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:25:56,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488284212] [2023-11-29 05:25:56,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:25:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:25:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:25:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 05:25:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:25:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:25:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:25:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:25:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:25:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:25:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 05:25:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 05:25:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:25:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 05:25:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 05:25:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 05:25:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 05:25:57,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:25:57,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488284212] [2023-11-29 05:25:57,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488284212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:57,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206338780] [2023-11-29 05:25:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:57,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:25:57,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:57,505 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:25:57,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:25:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:57,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 05:25:57,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:25:58,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 05:25:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206338780] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:25:59,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:25:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2023-11-29 05:25:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504037135] [2023-11-29 05:25:59,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:59,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:25:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:25:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:25:59,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:25:59,065 INFO L87 Difference]: Start difference. First operand 5148 states and 6713 transitions. Second operand has 26 states, 26 states have (on average 8.538461538461538) internal successors, (222), 26 states have internal predecessors, (222), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-29 05:26:04,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:26:04,490 INFO L93 Difference]: Finished difference Result 11167 states and 14569 transitions. [2023-11-29 05:26:04,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-29 05:26:04,491 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.538461538461538) internal successors, (222), 26 states have internal predecessors, (222), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 152 [2023-11-29 05:26:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:26:04,503 INFO L225 Difference]: With dead ends: 11167 [2023-11-29 05:26:04,504 INFO L226 Difference]: Without dead ends: 6254 [2023-11-29 05:26:04,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1044, Invalid=5928, Unknown=0, NotChecked=0, Total=6972 [2023-11-29 05:26:04,510 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1775 mSDsluCounter, 2825 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:26:04,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 3131 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:26:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2023-11-29 05:26:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6007. [2023-11-29 05:26:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6007 states, 4405 states have (on average 1.302383654937571) internal successors, (5737), 4444 states have internal predecessors, (5737), 1037 states have call successors, (1037), 564 states have call predecessors, (1037), 564 states have return successors, (1037), 998 states have call predecessors, (1037), 1037 states have call successors, (1037) [2023-11-29 05:26:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6007 states to 6007 states and 7811 transitions. [2023-11-29 05:26:05,338 INFO L78 Accepts]: Start accepts. Automaton has 6007 states and 7811 transitions. Word has length 152 [2023-11-29 05:26:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:26:05,338 INFO L495 AbstractCegarLoop]: Abstraction has 6007 states and 7811 transitions. [2023-11-29 05:26:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.538461538461538) internal successors, (222), 26 states have internal predecessors, (222), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-29 05:26:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6007 states and 7811 transitions. [2023-11-29 05:26:05,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 05:26:05,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:26:05,343 INFO L195 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] [2023-11-29 05:26:05,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:26:05,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 05:26:05,543 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:26:05,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1892160728, now seen corresponding path program 1 times [2023-11-29 05:26:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030733641] [2023-11-29 05:26:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:26:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:26:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 05:26:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:26:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:26:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:26:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:26:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:26:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:26:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 05:26:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 05:26:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 05:26:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 05:26:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 05:26:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 05:26:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 05:26:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030733641] [2023-11-29 05:26:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030733641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:26:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157413064] [2023-11-29 05:26:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:26:06,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:26:06,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:26:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:06,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 05:26:06,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:26:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 05:26:07,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 05:26:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157413064] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:26:08,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:26:08,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 26 [2023-11-29 05:26:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889027704] [2023-11-29 05:26:08,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:26:08,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:26:08,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:08,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:26:08,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:26:08,064 INFO L87 Difference]: Start difference. First operand 6007 states and 7811 transitions. Second operand has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-29 05:26:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:26:13,022 INFO L93 Difference]: Finished difference Result 12062 states and 15711 transitions. [2023-11-29 05:26:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-11-29 05:26:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 153 [2023-11-29 05:26:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:26:13,035 INFO L225 Difference]: With dead ends: 12062 [2023-11-29 05:26:13,035 INFO L226 Difference]: Without dead ends: 6373 [2023-11-29 05:26:13,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=698, Invalid=4132, Unknown=0, NotChecked=0, Total=4830 [2023-11-29 05:26:13,043 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 1507 mSDsluCounter, 4661 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 5061 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:26:13,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 5061 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 05:26:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2023-11-29 05:26:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6167. [2023-11-29 05:26:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6167 states, 4547 states have (on average 1.3028370354079613) internal successors, (5924), 4586 states have internal predecessors, (5924), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2023-11-29 05:26:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 8016 transitions. [2023-11-29 05:26:14,080 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 8016 transitions. Word has length 153 [2023-11-29 05:26:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:26:14,081 INFO L495 AbstractCegarLoop]: Abstraction has 6167 states and 8016 transitions. [2023-11-29 05:26:14,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.653846153846153) internal successors, (225), 26 states have internal predecessors, (225), 10 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2023-11-29 05:26:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 8016 transitions. [2023-11-29 05:26:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 05:26:14,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:26:14,085 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:14,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:26:14,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:14,285 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:26:14,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1077055979, now seen corresponding path program 1 times [2023-11-29 05:26:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694373016] [2023-11-29 05:26:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:26:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:26:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 05:26:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:26:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:26:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:26:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:26:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:26:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 05:26:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 05:26:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 05:26:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 05:26:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:26:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 05:26:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:26:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:26:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694373016] [2023-11-29 05:26:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694373016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:26:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405388452] [2023-11-29 05:26:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:26:14,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:26:14,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:26:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:14,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:26:14,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:26:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:26:14,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:26:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405388452] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:26:14,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:26:14,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-11-29 05:26:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147929785] [2023-11-29 05:26:14,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:26:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:26:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:26:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:26:14,790 INFO L87 Difference]: Start difference. First operand 6167 states and 8016 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 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) [2023-11-29 05:26:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:26:16,307 INFO L93 Difference]: Finished difference Result 14019 states and 18798 transitions. [2023-11-29 05:26:16,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:26:16,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 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 154 [2023-11-29 05:26:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:26:16,322 INFO L225 Difference]: With dead ends: 14019 [2023-11-29 05:26:16,322 INFO L226 Difference]: Without dead ends: 8014 [2023-11-29 05:26:16,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:26:16,328 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 163 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:26:16,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1686 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:26:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2023-11-29 05:26:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 6167. [2023-11-29 05:26:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6167 states, 4547 states have (on average 1.3021772597316912) internal successors, (5921), 4586 states have internal predecessors, (5921), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2023-11-29 05:26:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 8013 transitions. [2023-11-29 05:26:17,371 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 8013 transitions. Word has length 154 [2023-11-29 05:26:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:26:17,372 INFO L495 AbstractCegarLoop]: Abstraction has 6167 states and 8013 transitions. [2023-11-29 05:26:17,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 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) [2023-11-29 05:26:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 8013 transitions. [2023-11-29 05:26:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 05:26:17,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:26:17,376 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:17,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:26:17,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:17,577 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:26:17,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 948328635, now seen corresponding path program 1 times [2023-11-29 05:26:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21847321] [2023-11-29 05:26:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:26:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:26:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 05:26:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 05:26:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 05:26:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:26:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:26:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:26:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:26:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:26:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 05:26:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 05:26:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:26:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 05:26:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:26:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 05:26:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 05:26:17,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21847321] [2023-11-29 05:26:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21847321] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:26:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260090325] [2023-11-29 05:26:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:17,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:26:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:26:17,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:26:17,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:26:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:17,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:26:17,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:26:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:26:18,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 05:26:18,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260090325] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:26:18,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:26:18,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-11-29 05:26:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014769866] [2023-11-29 05:26:18,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:26:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:26:18,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:26:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:26:18,212 INFO L87 Difference]: Start difference. First operand 6167 states and 8013 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 05:26:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:26:19,954 INFO L93 Difference]: Finished difference Result 14019 states and 18795 transitions. [2023-11-29 05:26:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:26:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 162 [2023-11-29 05:26:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:26:19,976 INFO L225 Difference]: With dead ends: 14019 [2023-11-29 05:26:19,976 INFO L226 Difference]: Without dead ends: 8014 [2023-11-29 05:26:19,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 348 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:26:19,985 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 151 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:26:19,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1679 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:26:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2023-11-29 05:26:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 6167. [2023-11-29 05:26:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6167 states, 4547 states have (on average 1.3015174840554211) internal successors, (5918), 4586 states have internal predecessors, (5918), 1046 states have call successors, (1046), 573 states have call predecessors, (1046), 573 states have return successors, (1046), 1007 states have call predecessors, (1046), 1046 states have call successors, (1046) [2023-11-29 05:26:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 8010 transitions. [2023-11-29 05:26:21,126 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 8010 transitions. Word has length 162 [2023-11-29 05:26:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:26:21,127 INFO L495 AbstractCegarLoop]: Abstraction has 6167 states and 8010 transitions. [2023-11-29 05:26:21,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 05:26:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 8010 transitions. [2023-11-29 05:26:21,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-29 05:26:21,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:26:21,132 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:21,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:26:21,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 05:26:21,333 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:26:21,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash -203491659, now seen corresponding path program 1 times [2023-11-29 05:26:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:21,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909960781] [2023-11-29 05:26:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:21,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:26:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:21,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:26:21,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:26:21,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:26:21,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 05:26:21,481 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:21,484 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:26:21,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:26:21,568 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:26:21,570 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-29 05:26:21,571 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 05:26:21,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:26:21,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated [2023-11-29 05:26:21,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-11-29 05:26:21,577 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-11-29 05:26:21,580 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:26:21,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:26:21,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:26:21,584 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-11-29 05:26:21,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-29 05:26:21,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:26:21 BoogieIcfgContainer [2023-11-29 05:26:21,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:26:21,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:26:21,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:26:21,625 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:26:21,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:22" (3/4) ... [2023-11-29 05:26:21,626 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:26:21,672 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:26:21,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:26:21,676 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-29 05:26:21,676 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 05:26:21,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:26:21,678 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated [2023-11-29 05:26:21,679 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-11-29 05:26:21,680 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-11-29 05:26:21,682 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:26:21,684 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:26:21,685 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:26:21,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-11-29 05:26:21,686 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-29 05:26:21,790 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:26:21,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:26:21,791 INFO L158 Benchmark]: Toolchain (without parser) took 60721.22ms. Allocated memory was 197.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 158.8MB in the beginning and 961.3MB in the end (delta: -802.6MB). Peak memory consumption was 713.5MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,791 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:26:21,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.26ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 140.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 197.1MB. Free memory was 140.6MB in the beginning and 136.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,792 INFO L158 Benchmark]: Boogie Preprocessor took 66.95ms. Allocated memory is still 197.1MB. Free memory was 136.9MB in the beginning and 132.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,792 INFO L158 Benchmark]: RCFGBuilder took 677.79ms. Allocated memory is still 197.1MB. Free memory was 132.7MB in the beginning and 92.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,793 INFO L158 Benchmark]: TraceAbstraction took 59400.22ms. Allocated memory was 197.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 91.8MB in the beginning and 991.0MB in the end (delta: -899.2MB). Peak memory consumption was 617.1MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,793 INFO L158 Benchmark]: Witness Printer took 166.32ms. Allocated memory is still 1.7GB. Free memory was 991.0MB in the beginning and 961.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 05:26:21,794 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.17ms. Allocated memory is still 151.0MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.26ms. Allocated memory is still 197.1MB. Free memory was 158.2MB in the beginning and 140.6MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 197.1MB. Free memory was 140.6MB in the beginning and 136.9MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.95ms. Allocated memory is still 197.1MB. Free memory was 136.9MB in the beginning and 132.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 677.79ms. Allocated memory is still 197.1MB. Free memory was 132.7MB in the beginning and 92.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59400.22ms. Allocated memory was 197.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 91.8MB in the beginning and 991.0MB in the end (delta: -899.2MB). Peak memory consumption was 617.1MB. Max. memory is 16.1GB. * Witness Printer took 166.32ms. Allocated memory is still 1.7GB. Free memory was 991.0MB in the beginning and 961.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 611]: 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 ; [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_History_0=0, side1_written=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_History_0=0, side1_written=0, side2Failed_History_0=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_History_0=0, side1_written=0, side2Failed_History_0=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_History_0=0, side1_written=0, side2Failed_History_0=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_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=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_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=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_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=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_History_0=0, side1Failed_History_1=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L574] COND TRUE i2 < 10 [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 [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 [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 [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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 [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=-2] [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 [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=2, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___20=-2, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0, tmp=1, tmp___0=0, tmp___11=0, tmp___12=0, tmp___1=0, tmp___20=-2, tmp___2=1, tmp___7=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L574] COND TRUE i2 < 10 [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 [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 [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 [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-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] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=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, side2=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 [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=0, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, side2=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp=0] [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=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp=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 [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, cond=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=1, tmp___8=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___7=1, tmp___8=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, tmp___0=-1, tmp___5=0, tmp___7=1, tmp___8=0] [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=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14440 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14292 mSDsluCounter, 48861 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38415 mSDsCounter, 4230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8925 IncrementalHoareTripleChecker+Invalid, 13155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4230 mSolverCounterUnsat, 10446 mSDtfsCounter, 8925 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3198 GetRequests, 2735 SyntacticMatches, 15 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8015 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8153occurred in iteration=29, InterpolantAutomatonStates: 417, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 22373 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 4267 NumberOfCodeBlocks, 4267 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5109 ConstructedInterpolants, 0 QuantifiedInterpolants, 14183 SizeOfPredicates, 23 NumberOfNonLiveVariables, 4608 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 48 InterpolantComputations, 28 PerfectInterpolantSequences, 1925/2096 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 05:26:21,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ba0c0ea-45dd-4aca-9e53-f3f49d38d376/bin/uautomizer-verify-BQ2R08f2Ya/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