./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:47:13,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:47:14,067 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:47:14,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:47:14,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:47:14,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:47:14,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:47:14,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:47:14,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:47:14,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:47:14,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:47:14,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:47:14,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:47:14,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:47:14,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:47:14,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:47:14,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:47:14,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:47:14,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:47:14,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:47:14,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:47:14,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:47:14,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:47:14,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:47:14,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:47:14,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:47:14,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:47:14,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:47:14,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:47:14,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:47:14,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:47:14,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:47:14,108 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2024-11-23 23:47:14,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:47:14,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:47:14,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:47:14,432 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:47:14,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:47:14,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-23 23:47:17,491 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/data/ac485ec82/f8c5a8bbf23d40cc8a8a2916515c7850/FLAG168009784 [2024-11-23 23:47:17,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:47:17,878 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-23 23:47:17,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/data/ac485ec82/f8c5a8bbf23d40cc8a8a2916515c7850/FLAG168009784 [2024-11-23 23:47:17,909 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/data/ac485ec82/f8c5a8bbf23d40cc8a8a2916515c7850 [2024-11-23 23:47:17,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:47:17,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:47:17,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:47:17,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:47:17,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:47:17,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:17" (1/1) ... [2024-11-23 23:47:17,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408c1fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:17, skipping insertion in model container [2024-11-23 23:47:17,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:17" (1/1) ... [2024-11-23 23:47:17,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:47:18,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-23 23:47:18,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:47:18,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:47:18,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-23 23:47:18,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:47:18,278 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:47:18,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18 WrapperNode [2024-11-23 23:47:18,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:47:18,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:47:18,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:47:18,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:47:18,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,345 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 423 [2024-11-23 23:47:18,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:47:18,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:47:18,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:47:18,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:47:18,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 23:47:18,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:47:18,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:47:18,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:47:18,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:47:18,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (1/1) ... [2024-11-23 23:47:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:47:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:18,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:47:18,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:47:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:47:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-23 23:47:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-23 23:47:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-23 23:47:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-23 23:47:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-23 23:47:18,513 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-23 23:47:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-23 23:47:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-23 23:47:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-23 23:47:18,514 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-23 23:47:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:47:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:47:18,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:47:18,650 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:47:18,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:47:19,335 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-23 23:47:19,335 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:47:19,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:47:19,350 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 23:47:19,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:19 BoogieIcfgContainer [2024-11-23 23:47:19,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:47:19,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:47:19,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:47:19,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:47:19,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:47:17" (1/3) ... [2024-11-23 23:47:19,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303c8453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:19, skipping insertion in model container [2024-11-23 23:47:19,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:18" (2/3) ... [2024-11-23 23:47:19,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303c8453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:19, skipping insertion in model container [2024-11-23 23:47:19,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:19" (3/3) ... [2024-11-23 23:47:19,362 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-23 23:47:19,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:47:19,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c that has 6 procedures, 175 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-23 23:47:19,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:47:19,495 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7916091e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:47:19,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:47:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 140 states have internal predecessors, (217), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-23 23:47:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-23 23:47:19,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:19,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:19,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:19,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:19,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1804268303, now seen corresponding path program 1 times [2024-11-23 23:47:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284648573] [2024-11-23 23:47:19,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:19,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284648573] [2024-11-23 23:47:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284648573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757205380] [2024-11-23 23:47:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:20,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:20,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:20,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:20,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:20,068 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 140 states have internal predecessors, (217), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:47:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:20,242 INFO L93 Difference]: Finished difference Result 353 states and 598 transitions. [2024-11-23 23:47:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-23 23:47:20,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:20,254 INFO L225 Difference]: With dead ends: 353 [2024-11-23 23:47:20,254 INFO L226 Difference]: Without dead ends: 177 [2024-11-23 23:47:20,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:20,264 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 7 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:20,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-23 23:47:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-23 23:47:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.536231884057971) internal successors, (212), 141 states have internal predecessors, (212), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-23 23:47:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 276 transitions. [2024-11-23 23:47:20,344 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 276 transitions. Word has length 15 [2024-11-23 23:47:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 276 transitions. [2024-11-23 23:47:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:47:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 276 transitions. [2024-11-23 23:47:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-23 23:47:20,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:20,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:20,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:47:20,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:20,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1396957548, now seen corresponding path program 1 times [2024-11-23 23:47:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766608493] [2024-11-23 23:47:20,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766608493] [2024-11-23 23:47:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766608493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:20,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:20,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065219474] [2024-11-23 23:47:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:20,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:20,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:20,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:20,535 INFO L87 Difference]: Start difference. First operand 177 states and 276 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:47:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:20,644 INFO L93 Difference]: Finished difference Result 367 states and 575 transitions. [2024-11-23 23:47:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:20,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-23 23:47:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:20,648 INFO L225 Difference]: With dead ends: 367 [2024-11-23 23:47:20,648 INFO L226 Difference]: Without dead ends: 193 [2024-11-23 23:47:20,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:20,654 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 25 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:20,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 795 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-23 23:47:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-23 23:47:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.516778523489933) internal successors, (226), 152 states have internal predecessors, (226), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-23 23:47:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 292 transitions. [2024-11-23 23:47:20,691 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 292 transitions. Word has length 16 [2024-11-23 23:47:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:20,691 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 292 transitions. [2024-11-23 23:47:20,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:47:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 292 transitions. [2024-11-23 23:47:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-23 23:47:20,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:20,692 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:20,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 23:47:20,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:20,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -426306321, now seen corresponding path program 1 times [2024-11-23 23:47:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67476904] [2024-11-23 23:47:20,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67476904] [2024-11-23 23:47:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67476904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884686595] [2024-11-23 23:47:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:20,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:20,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:20,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:20,888 INFO L87 Difference]: Start difference. First operand 190 states and 292 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:20,930 INFO L93 Difference]: Finished difference Result 399 states and 621 transitions. [2024-11-23 23:47:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-23 23:47:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:20,934 INFO L225 Difference]: With dead ends: 399 [2024-11-23 23:47:20,936 INFO L226 Difference]: Without dead ends: 219 [2024-11-23 23:47:20,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:20,938 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 22 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:20,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 538 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-23 23:47:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2024-11-23 23:47:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.509933774834437) internal successors, (228), 154 states have internal predecessors, (228), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-23 23:47:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 294 transitions. [2024-11-23 23:47:20,976 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 294 transitions. Word has length 24 [2024-11-23 23:47:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 294 transitions. [2024-11-23 23:47:20,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 23:47:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 294 transitions. [2024-11-23 23:47:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-23 23:47:20,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:20,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:20,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 23:47:20,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1391917794, now seen corresponding path program 1 times [2024-11-23 23:47:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397855915] [2024-11-23 23:47:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397855915] [2024-11-23 23:47:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397855915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:21,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:21,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944523996] [2024-11-23 23:47:21,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:21,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:21,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:21,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:21,171 INFO L87 Difference]: Start difference. First operand 192 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:21,245 INFO L93 Difference]: Finished difference Result 374 states and 577 transitions. [2024-11-23 23:47:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-23 23:47:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:21,248 INFO L225 Difference]: With dead ends: 374 [2024-11-23 23:47:21,249 INFO L226 Difference]: Without dead ends: 198 [2024-11-23 23:47:21,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:21,251 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:21,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-23 23:47:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-11-23 23:47:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.5) internal successors, (231), 157 states have internal predecessors, (231), 33 states have call successors, (33), 7 states have call predecessors, (33), 8 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2024-11-23 23:47:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 298 transitions. [2024-11-23 23:47:21,282 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 298 transitions. Word has length 32 [2024-11-23 23:47:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:21,283 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 298 transitions. [2024-11-23 23:47:21,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 298 transitions. [2024-11-23 23:47:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-23 23:47:21,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:21,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:21,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 23:47:21,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:21,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash -408496294, now seen corresponding path program 1 times [2024-11-23 23:47:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:21,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061237234] [2024-11-23 23:47:21,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061237234] [2024-11-23 23:47:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061237234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:21,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719853965] [2024-11-23 23:47:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:21,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:21,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:21,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:21,438 INFO L87 Difference]: Start difference. First operand 196 states and 298 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:21,503 INFO L93 Difference]: Finished difference Result 434 states and 679 transitions. [2024-11-23 23:47:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-23 23:47:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:21,506 INFO L225 Difference]: With dead ends: 434 [2024-11-23 23:47:21,508 INFO L226 Difference]: Without dead ends: 289 [2024-11-23 23:47:21,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:21,512 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 118 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:21,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 789 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-23 23:47:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2024-11-23 23:47:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.4768211920529801) internal successors, (223), 154 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-23 23:47:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 289 transitions. [2024-11-23 23:47:21,540 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 289 transitions. Word has length 32 [2024-11-23 23:47:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:21,541 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 289 transitions. [2024-11-23 23:47:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 289 transitions. [2024-11-23 23:47:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-23 23:47:21,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:21,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:21,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 23:47:21,546 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:21,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -998907749, now seen corresponding path program 1 times [2024-11-23 23:47:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:21,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345835584] [2024-11-23 23:47:21,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:21,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345835584] [2024-11-23 23:47:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345835584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93180197] [2024-11-23 23:47:21,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:21,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:21,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:47:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:21,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:47:21,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:21,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:47:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:47:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93180197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:47:21,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:47:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-23 23:47:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314020962] [2024-11-23 23:47:21,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:47:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:47:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:21,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:47:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:47:21,996 INFO L87 Difference]: Start difference. First operand 192 states and 289 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:47:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:22,080 INFO L93 Difference]: Finished difference Result 432 states and 665 transitions. [2024-11-23 23:47:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-11-23 23:47:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:22,084 INFO L225 Difference]: With dead ends: 432 [2024-11-23 23:47:22,084 INFO L226 Difference]: Without dead ends: 251 [2024-11-23 23:47:22,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:47:22,089 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 73 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:22,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 805 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-23 23:47:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2024-11-23 23:47:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.4536082474226804) internal successors, (282), 197 states have internal predecessors, (282), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-23 23:47:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 368 transitions. [2024-11-23 23:47:22,111 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 368 transitions. Word has length 35 [2024-11-23 23:47:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:22,112 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 368 transitions. [2024-11-23 23:47:22,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-23 23:47:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2024-11-23 23:47:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-23 23:47:22,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:22,114 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:22,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:47:22,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:22,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:22,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1787614235, now seen corresponding path program 2 times [2024-11-23 23:47:22,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:22,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795593484] [2024-11-23 23:47:22,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:47:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:22,341 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 23:47:22,342 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:47:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-23 23:47:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795593484] [2024-11-23 23:47:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795593484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406336030] [2024-11-23 23:47:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:22,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:22,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:22,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:22,394 INFO L87 Difference]: Start difference. First operand 245 states and 368 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:22,476 INFO L93 Difference]: Finished difference Result 468 states and 720 transitions. [2024-11-23 23:47:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-23 23:47:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:22,480 INFO L225 Difference]: With dead ends: 468 [2024-11-23 23:47:22,480 INFO L226 Difference]: Without dead ends: 252 [2024-11-23 23:47:22,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:22,482 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 8 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:22,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 769 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-23 23:47:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-23 23:47:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 200 states have (on average 1.45) internal successors, (290), 203 states have internal predecessors, (290), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-23 23:47:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2024-11-23 23:47:22,502 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 57 [2024-11-23 23:47:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:22,502 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2024-11-23 23:47:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2024-11-23 23:47:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-23 23:47:22,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:22,504 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:22,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 23:47:22,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:22,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -288950806, now seen corresponding path program 1 times [2024-11-23 23:47:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:22,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252479959] [2024-11-23 23:47:22,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 23:47:22,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252479959] [2024-11-23 23:47:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252479959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:22,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:22,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014689616] [2024-11-23 23:47:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:22,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:22,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:22,623 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:22,698 INFO L93 Difference]: Finished difference Result 514 states and 778 transitions. [2024-11-23 23:47:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-23 23:47:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:22,702 INFO L225 Difference]: With dead ends: 514 [2024-11-23 23:47:22,702 INFO L226 Difference]: Without dead ends: 291 [2024-11-23 23:47:22,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:22,705 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 24 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:22,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 787 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-23 23:47:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-23 23:47:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 235 states have internal predecessors, (327), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-23 23:47:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 419 transitions. [2024-11-23 23:47:22,730 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 419 transitions. Word has length 57 [2024-11-23 23:47:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:22,731 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 419 transitions. [2024-11-23 23:47:22,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 23:47:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 419 transitions. [2024-11-23 23:47:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-23 23:47:22,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:22,734 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 23:47:22,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 23:47:22,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1185734351, now seen corresponding path program 1 times [2024-11-23 23:47:22,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:22,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590480770] [2024-11-23 23:47:22,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-23 23:47:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590480770] [2024-11-23 23:47:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590480770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:22,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:22,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428404522] [2024-11-23 23:47:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:22,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:22,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:22,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:22,953 INFO L87 Difference]: Start difference. First operand 288 states and 419 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:23,005 INFO L93 Difference]: Finished difference Result 525 states and 777 transitions. [2024-11-23 23:47:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-23 23:47:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:23,010 INFO L225 Difference]: With dead ends: 525 [2024-11-23 23:47:23,010 INFO L226 Difference]: Without dead ends: 290 [2024-11-23 23:47:23,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:23,014 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:23,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1049 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-23 23:47:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2024-11-23 23:47:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.396551724137931) internal successors, (324), 235 states have internal predecessors, (324), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-23 23:47:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 416 transitions. [2024-11-23 23:47:23,048 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 416 transitions. Word has length 75 [2024-11-23 23:47:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:23,048 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 416 transitions. [2024-11-23 23:47:23,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 416 transitions. [2024-11-23 23:47:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-23 23:47:23,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:23,050 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:23,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 23:47:23,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:23,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash 976700524, now seen corresponding path program 1 times [2024-11-23 23:47:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543280425] [2024-11-23 23:47:23,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-23 23:47:23,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543280425] [2024-11-23 23:47:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543280425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:23,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209633755] [2024-11-23 23:47:23,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:23,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:23,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:23,267 INFO L87 Difference]: Start difference. First operand 288 states and 416 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:23,343 INFO L93 Difference]: Finished difference Result 562 states and 833 transitions. [2024-11-23 23:47:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:23,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-23 23:47:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:23,348 INFO L225 Difference]: With dead ends: 562 [2024-11-23 23:47:23,348 INFO L226 Difference]: Without dead ends: 332 [2024-11-23 23:47:23,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:23,350 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 25 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:23,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 787 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-23 23:47:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2024-11-23 23:47:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 272 states have internal predecessors, (366), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-23 23:47:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 464 transitions. [2024-11-23 23:47:23,388 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 464 transitions. Word has length 104 [2024-11-23 23:47:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:23,389 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 464 transitions. [2024-11-23 23:47:23,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 464 transitions. [2024-11-23 23:47:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-23 23:47:23,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:23,392 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:23,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 23:47:23,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:23,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2069141121, now seen corresponding path program 1 times [2024-11-23 23:47:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654914945] [2024-11-23 23:47:23,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-23 23:47:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654914945] [2024-11-23 23:47:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654914945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:23,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:23,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:23,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019962300] [2024-11-23 23:47:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:23,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:23,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:23,542 INFO L87 Difference]: Start difference. First operand 329 states and 464 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:23,635 INFO L93 Difference]: Finished difference Result 588 states and 853 transitions. [2024-11-23 23:47:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:23,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-23 23:47:23,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:23,638 INFO L225 Difference]: With dead ends: 588 [2024-11-23 23:47:23,638 INFO L226 Difference]: Without dead ends: 323 [2024-11-23 23:47:23,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:23,641 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 9 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:23,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 752 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-23 23:47:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-23 23:47:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3409090909090908) internal successors, (354), 267 states have internal predecessors, (354), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-23 23:47:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 450 transitions. [2024-11-23 23:47:23,665 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 450 transitions. Word has length 105 [2024-11-23 23:47:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 450 transitions. [2024-11-23 23:47:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-23 23:47:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 450 transitions. [2024-11-23 23:47:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 23:47:23,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:23,670 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:23,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 23:47:23,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:23,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash 905088881, now seen corresponding path program 1 times [2024-11-23 23:47:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:23,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71572183] [2024-11-23 23:47:23,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:23,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-23 23:47:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71572183] [2024-11-23 23:47:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71572183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507407768] [2024-11-23 23:47:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:23,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:23,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:23,837 INFO L87 Difference]: Start difference. First operand 323 states and 450 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-23 23:47:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:23,886 INFO L93 Difference]: Finished difference Result 563 states and 802 transitions. [2024-11-23 23:47:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-23 23:47:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:23,891 INFO L225 Difference]: With dead ends: 563 [2024-11-23 23:47:23,891 INFO L226 Difference]: Without dead ends: 325 [2024-11-23 23:47:23,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:23,893 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:23,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1033 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-23 23:47:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2024-11-23 23:47:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3295454545454546) internal successors, (351), 267 states have internal predecessors, (351), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-23 23:47:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 447 transitions. [2024-11-23 23:47:23,917 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 447 transitions. Word has length 124 [2024-11-23 23:47:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:23,918 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 447 transitions. [2024-11-23 23:47:23,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-23 23:47:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 447 transitions. [2024-11-23 23:47:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-23 23:47:23,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:23,920 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:23,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 23:47:23,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:23,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash -533916022, now seen corresponding path program 1 times [2024-11-23 23:47:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:23,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867522188] [2024-11-23 23:47:23,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-23 23:47:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867522188] [2024-11-23 23:47:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867522188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661595114] [2024-11-23 23:47:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:24,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:24,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:24,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:24,086 INFO L87 Difference]: Start difference. First operand 323 states and 447 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-23 23:47:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:24,159 INFO L93 Difference]: Finished difference Result 526 states and 762 transitions. [2024-11-23 23:47:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-23 23:47:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:24,162 INFO L225 Difference]: With dead ends: 526 [2024-11-23 23:47:24,163 INFO L226 Difference]: Without dead ends: 321 [2024-11-23 23:47:24,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:24,164 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 7 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:24,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 720 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-23 23:47:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-23 23:47:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 263 states have (on average 1.326996197718631) internal successors, (349), 266 states have internal predecessors, (349), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-23 23:47:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 443 transitions. [2024-11-23 23:47:24,184 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 443 transitions. Word has length 157 [2024-11-23 23:47:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:24,184 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 443 transitions. [2024-11-23 23:47:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-23 23:47:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 443 transitions. [2024-11-23 23:47:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-23 23:47:24,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:24,187 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:24,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 23:47:24,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:24,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 737899177, now seen corresponding path program 1 times [2024-11-23 23:47:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260055464] [2024-11-23 23:47:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-23 23:47:24,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260055464] [2024-11-23 23:47:24,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260055464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:24,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:24,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:24,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984547789] [2024-11-23 23:47:24,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:24,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:24,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:24,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:24,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:24,390 INFO L87 Difference]: Start difference. First operand 321 states and 443 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 23:47:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:24,472 INFO L93 Difference]: Finished difference Result 466 states and 658 transitions. [2024-11-23 23:47:24,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:24,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 173 [2024-11-23 23:47:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:24,476 INFO L225 Difference]: With dead ends: 466 [2024-11-23 23:47:24,477 INFO L226 Difference]: Without dead ends: 304 [2024-11-23 23:47:24,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:24,478 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 35 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:24,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 696 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-23 23:47:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-23 23:47:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 252 states have internal predecessors, (328), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-23 23:47:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 416 transitions. [2024-11-23 23:47:24,505 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 416 transitions. Word has length 173 [2024-11-23 23:47:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:24,506 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 416 transitions. [2024-11-23 23:47:24,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 23:47:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 416 transitions. [2024-11-23 23:47:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-23 23:47:24,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:24,511 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:24,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 23:47:24,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1146780960, now seen corresponding path program 1 times [2024-11-23 23:47:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634752595] [2024-11-23 23:47:24,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:24,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-23 23:47:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634752595] [2024-11-23 23:47:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634752595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:24,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:24,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174899259] [2024-11-23 23:47:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:24,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:24,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:24,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:24,749 INFO L87 Difference]: Start difference. First operand 304 states and 416 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 23:47:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:24,851 INFO L93 Difference]: Finished difference Result 449 states and 631 transitions. [2024-11-23 23:47:24,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:24,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 175 [2024-11-23 23:47:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:24,858 INFO L225 Difference]: With dead ends: 449 [2024-11-23 23:47:24,858 INFO L226 Difference]: Without dead ends: 285 [2024-11-23 23:47:24,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:24,859 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 30 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:24,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 700 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-23 23:47:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-23 23:47:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3090128755364807) internal successors, (305), 236 states have internal predecessors, (305), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-23 23:47:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 387 transitions. [2024-11-23 23:47:24,881 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 387 transitions. Word has length 175 [2024-11-23 23:47:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:24,882 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 387 transitions. [2024-11-23 23:47:24,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 23:47:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 387 transitions. [2024-11-23 23:47:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-23 23:47:24,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:24,885 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:24,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 23:47:24,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1690885571, now seen corresponding path program 1 times [2024-11-23 23:47:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222474298] [2024-11-23 23:47:24,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-23 23:47:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222474298] [2024-11-23 23:47:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222474298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105889658] [2024-11-23 23:47:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:25,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:25,091 INFO L87 Difference]: Start difference. First operand 285 states and 387 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-23 23:47:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:25,135 INFO L93 Difference]: Finished difference Result 429 states and 601 transitions. [2024-11-23 23:47:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 176 [2024-11-23 23:47:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:25,138 INFO L225 Difference]: With dead ends: 429 [2024-11-23 23:47:25,139 INFO L226 Difference]: Without dead ends: 285 [2024-11-23 23:47:25,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:25,141 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:25,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1011 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-23 23:47:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-23 23:47:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.2832618025751072) internal successors, (299), 236 states have internal predecessors, (299), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-23 23:47:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 381 transitions. [2024-11-23 23:47:25,161 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 381 transitions. Word has length 176 [2024-11-23 23:47:25,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:25,163 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 381 transitions. [2024-11-23 23:47:25,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-23 23:47:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 381 transitions. [2024-11-23 23:47:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-23 23:47:25,166 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:25,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:25,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 23:47:25,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 761958663, now seen corresponding path program 1 times [2024-11-23 23:47:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:25,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25130239] [2024-11-23 23:47:25,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:25,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-23 23:47:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25130239] [2024-11-23 23:47:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25130239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485541844] [2024-11-23 23:47:25,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:25,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:25,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:25,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:25,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:47:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:25,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:47:25,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-23 23:47:25,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:47:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-23 23:47:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485541844] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:47:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-23 23:47:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28347778] [2024-11-23 23:47:25,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:25,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:25,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:25,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:25,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:25,859 INFO L87 Difference]: Start difference. First operand 285 states and 381 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 23:47:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:25,953 INFO L93 Difference]: Finished difference Result 450 states and 623 transitions. [2024-11-23 23:47:25,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:25,954 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 183 [2024-11-23 23:47:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:25,956 INFO L225 Difference]: With dead ends: 450 [2024-11-23 23:47:25,956 INFO L226 Difference]: Without dead ends: 264 [2024-11-23 23:47:25,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:25,957 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 30 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:25,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 479 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-23 23:47:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-23 23:47:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 215 states have (on average 1.2744186046511627) internal successors, (274), 218 states have internal predecessors, (274), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-23 23:47:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 350 transitions. [2024-11-23 23:47:25,975 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 350 transitions. Word has length 183 [2024-11-23 23:47:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:25,975 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 350 transitions. [2024-11-23 23:47:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 23:47:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 350 transitions. [2024-11-23 23:47:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-23 23:47:25,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:25,979 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:25,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 23:47:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-23 23:47:26,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1010162700, now seen corresponding path program 1 times [2024-11-23 23:47:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615950566] [2024-11-23 23:47:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-23 23:47:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615950566] [2024-11-23 23:47:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615950566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439107964] [2024-11-23 23:47:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:26,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:26,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:26,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:26,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:26,337 INFO L87 Difference]: Start difference. First operand 264 states and 350 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-23 23:47:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:26,378 INFO L93 Difference]: Finished difference Result 405 states and 562 transitions. [2024-11-23 23:47:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 207 [2024-11-23 23:47:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:26,385 INFO L225 Difference]: With dead ends: 405 [2024-11-23 23:47:26,385 INFO L226 Difference]: Without dead ends: 268 [2024-11-23 23:47:26,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:26,386 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:26,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 740 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-23 23:47:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-23 23:47:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 218 states have (on average 1.2706422018348624) internal successors, (277), 221 states have internal predecessors, (277), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-23 23:47:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 353 transitions. [2024-11-23 23:47:26,404 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 353 transitions. Word has length 207 [2024-11-23 23:47:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:26,405 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 353 transitions. [2024-11-23 23:47:26,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-23 23:47:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 353 transitions. [2024-11-23 23:47:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-23 23:47:26,408 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:26,409 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 23:47:26,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 23:47:26,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:26,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1536356528, now seen corresponding path program 1 times [2024-11-23 23:47:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:26,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990947151] [2024-11-23 23:47:26,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-23 23:47:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990947151] [2024-11-23 23:47:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990947151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143887693] [2024-11-23 23:47:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:26,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:26,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:26,623 INFO L87 Difference]: Start difference. First operand 268 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-23 23:47:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:26,673 INFO L93 Difference]: Finished difference Result 414 states and 570 transitions. [2024-11-23 23:47:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 214 [2024-11-23 23:47:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:26,677 INFO L225 Difference]: With dead ends: 414 [2024-11-23 23:47:26,677 INFO L226 Difference]: Without dead ends: 273 [2024-11-23 23:47:26,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:26,679 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 742 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 [2024-11-23 23:47:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 742 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-23 23:47:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-23 23:47:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 225 states have internal predecessors, (281), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-23 23:47:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 357 transitions. [2024-11-23 23:47:26,697 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 357 transitions. Word has length 214 [2024-11-23 23:47:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 357 transitions. [2024-11-23 23:47:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-23 23:47:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 357 transitions. [2024-11-23 23:47:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-23 23:47:26,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:26,703 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:26,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 23:47:26,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:26,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash 245685125, now seen corresponding path program 1 times [2024-11-23 23:47:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715498263] [2024-11-23 23:47:26,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-23 23:47:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715498263] [2024-11-23 23:47:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715498263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508170553] [2024-11-23 23:47:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:26,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:26,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:26,909 INFO L87 Difference]: Start difference. First operand 273 states and 357 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-23 23:47:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:26,988 INFO L93 Difference]: Finished difference Result 418 states and 570 transitions. [2024-11-23 23:47:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:47:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 222 [2024-11-23 23:47:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:26,992 INFO L225 Difference]: With dead ends: 418 [2024-11-23 23:47:26,992 INFO L226 Difference]: Without dead ends: 272 [2024-11-23 23:47:26,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:26,993 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 5 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:26,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 732 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-23 23:47:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-23 23:47:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 224 states have internal predecessors, (278), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-23 23:47:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 352 transitions. [2024-11-23 23:47:27,012 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 352 transitions. Word has length 222 [2024-11-23 23:47:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:27,013 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 352 transitions. [2024-11-23 23:47:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-23 23:47:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 352 transitions. [2024-11-23 23:47:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-23 23:47:27,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:27,016 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 23:47:27,017 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:27,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 695122786, now seen corresponding path program 1 times [2024-11-23 23:47:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888965672] [2024-11-23 23:47:27,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-23 23:47:27,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:27,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888965672] [2024-11-23 23:47:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888965672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:27,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:27,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106538953] [2024-11-23 23:47:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:27,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:27,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:27,217 INFO L87 Difference]: Start difference. First operand 272 states and 352 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-23 23:47:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:27,242 INFO L93 Difference]: Finished difference Result 416 states and 559 transitions. [2024-11-23 23:47:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:27,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 230 [2024-11-23 23:47:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:27,247 INFO L225 Difference]: With dead ends: 416 [2024-11-23 23:47:27,247 INFO L226 Difference]: Without dead ends: 271 [2024-11-23 23:47:27,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:27,248 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:27,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-23 23:47:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-23 23:47:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.2477477477477477) internal successors, (277), 223 states have internal predecessors, (277), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-23 23:47:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 349 transitions. [2024-11-23 23:47:27,269 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 349 transitions. Word has length 230 [2024-11-23 23:47:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:27,270 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 349 transitions. [2024-11-23 23:47:27,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-23 23:47:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 349 transitions. [2024-11-23 23:47:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-23 23:47:27,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:27,273 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:27,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 23:47:27,273 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:27,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:27,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1330626470, now seen corresponding path program 1 times [2024-11-23 23:47:27,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:27,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143566410] [2024-11-23 23:47:27,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-23 23:47:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143566410] [2024-11-23 23:47:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143566410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696985691] [2024-11-23 23:47:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:27,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:27,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:27,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:27,636 INFO L87 Difference]: Start difference. First operand 271 states and 349 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-23 23:47:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:27,755 INFO L93 Difference]: Finished difference Result 623 states and 830 transitions. [2024-11-23 23:47:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 231 [2024-11-23 23:47:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:27,761 INFO L225 Difference]: With dead ends: 623 [2024-11-23 23:47:27,762 INFO L226 Difference]: Without dead ends: 479 [2024-11-23 23:47:27,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:27,764 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 314 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 695 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-23 23:47:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 424. [2024-11-23 23:47:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 345 states have (on average 1.2956521739130435) internal successors, (447), 347 states have internal predecessors, (447), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-23 23:47:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 555 transitions. [2024-11-23 23:47:27,821 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 555 transitions. Word has length 231 [2024-11-23 23:47:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 555 transitions. [2024-11-23 23:47:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-23 23:47:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 555 transitions. [2024-11-23 23:47:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-23 23:47:27,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:27,826 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 23:47:27,826 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 658201063, now seen corresponding path program 1 times [2024-11-23 23:47:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146629408] [2024-11-23 23:47:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-23 23:47:28,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146629408] [2024-11-23 23:47:28,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146629408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:28,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:28,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081429076] [2024-11-23 23:47:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:28,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:28,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:28,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,094 INFO L87 Difference]: Start difference. First operand 424 states and 555 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-23 23:47:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:28,169 INFO L93 Difference]: Finished difference Result 894 states and 1223 transitions. [2024-11-23 23:47:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 260 [2024-11-23 23:47:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:28,176 INFO L225 Difference]: With dead ends: 894 [2024-11-23 23:47:28,176 INFO L226 Difference]: Without dead ends: 666 [2024-11-23 23:47:28,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,178 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 168 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:28,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 509 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-23 23:47:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 503. [2024-11-23 23:47:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 414 states have (on average 1.3043478260869565) internal successors, (540), 417 states have internal predecessors, (540), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-23 23:47:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 658 transitions. [2024-11-23 23:47:28,233 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 658 transitions. Word has length 260 [2024-11-23 23:47:28,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:28,234 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 658 transitions. [2024-11-23 23:47:28,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-23 23:47:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 658 transitions. [2024-11-23 23:47:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-23 23:47:28,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:28,238 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:28,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 23:47:28,239 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:28,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 299871551, now seen corresponding path program 1 times [2024-11-23 23:47:28,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:28,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518979449] [2024-11-23 23:47:28,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-23 23:47:28,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:28,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518979449] [2024-11-23 23:47:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518979449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:28,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85892616] [2024-11-23 23:47:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:28,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:28,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:28,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,408 INFO L87 Difference]: Start difference. First operand 503 states and 658 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-23 23:47:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:28,489 INFO L93 Difference]: Finished difference Result 1065 states and 1448 transitions. [2024-11-23 23:47:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 261 [2024-11-23 23:47:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:28,495 INFO L225 Difference]: With dead ends: 1065 [2024-11-23 23:47:28,495 INFO L226 Difference]: Without dead ends: 787 [2024-11-23 23:47:28,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,497 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 170 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:28,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 526 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-23 23:47:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 611. [2024-11-23 23:47:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 510 states have (on average 1.3137254901960784) internal successors, (670), 515 states have internal predecessors, (670), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-23 23:47:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 800 transitions. [2024-11-23 23:47:28,550 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 800 transitions. Word has length 261 [2024-11-23 23:47:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:28,551 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 800 transitions. [2024-11-23 23:47:28,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-23 23:47:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 800 transitions. [2024-11-23 23:47:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-23 23:47:28,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:28,556 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:28,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-23 23:47:28,556 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash 615973954, now seen corresponding path program 1 times [2024-11-23 23:47:28,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:28,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577880657] [2024-11-23 23:47:28,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:28,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-23 23:47:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577880657] [2024-11-23 23:47:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577880657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:28,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275776163] [2024-11-23 23:47:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:28,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:28,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,726 INFO L87 Difference]: Start difference. First operand 611 states and 800 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:28,814 INFO L93 Difference]: Finished difference Result 1275 states and 1730 transitions. [2024-11-23 23:47:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2024-11-23 23:47:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:28,821 INFO L225 Difference]: With dead ends: 1275 [2024-11-23 23:47:28,821 INFO L226 Difference]: Without dead ends: 921 [2024-11-23 23:47:28,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:28,822 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 171 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:28,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-23 23:47:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 717. [2024-11-23 23:47:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 608 states have (on average 1.325657894736842) internal successors, (806), 617 states have internal predecessors, (806), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-23 23:47:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 944 transitions. [2024-11-23 23:47:28,913 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 944 transitions. Word has length 262 [2024-11-23 23:47:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 944 transitions. [2024-11-23 23:47:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 944 transitions. [2024-11-23 23:47:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-23 23:47:28,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:28,919 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:28,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-23 23:47:28,919 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 890733568, now seen corresponding path program 1 times [2024-11-23 23:47:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423345892] [2024-11-23 23:47:28,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-11-23 23:47:29,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423345892] [2024-11-23 23:47:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423345892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49694319] [2024-11-23 23:47:29,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:29,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:29,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:47:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:29,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:47:29,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-23 23:47:29,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49694319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-23 23:47:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788092008] [2024-11-23 23:47:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:29,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:29,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:29,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:29,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:47:29,666 INFO L87 Difference]: Start difference. First operand 717 states and 944 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:29,812 INFO L93 Difference]: Finished difference Result 1181 states and 1593 transitions. [2024-11-23 23:47:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2024-11-23 23:47:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:29,818 INFO L225 Difference]: With dead ends: 1181 [2024-11-23 23:47:29,818 INFO L226 Difference]: Without dead ends: 717 [2024-11-23 23:47:29,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:47:29,820 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 31 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:29,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 667 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-23 23:47:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-23 23:47:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 608 states have (on average 1.3157894736842106) internal successors, (800), 617 states have internal predecessors, (800), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-23 23:47:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 938 transitions. [2024-11-23 23:47:29,874 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 938 transitions. Word has length 262 [2024-11-23 23:47:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:29,875 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 938 transitions. [2024-11-23 23:47:29,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 938 transitions. [2024-11-23 23:47:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-23 23:47:29,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:29,879 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:29,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:47:30,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-23 23:47:30,083 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:30,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:30,084 INFO L85 PathProgramCache]: Analyzing trace with hash -372744847, now seen corresponding path program 1 times [2024-11-23 23:47:30,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:30,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724830380] [2024-11-23 23:47:30,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-23 23:47:30,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724830380] [2024-11-23 23:47:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724830380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360467403] [2024-11-23 23:47:30,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:30,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:30,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:47:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:30,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 23:47:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-23 23:47:30,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360467403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:30,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:30,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-23 23:47:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118725579] [2024-11-23 23:47:30,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:30,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:30,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:47:30,784 INFO L87 Difference]: Start difference. First operand 717 states and 938 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:30,911 INFO L93 Difference]: Finished difference Result 1181 states and 1579 transitions. [2024-11-23 23:47:30,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:30,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 263 [2024-11-23 23:47:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:30,917 INFO L225 Difference]: With dead ends: 1181 [2024-11-23 23:47:30,917 INFO L226 Difference]: Without dead ends: 729 [2024-11-23 23:47:30,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-23 23:47:30,919 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 7 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:30,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 675 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-23 23:47:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-11-23 23:47:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 618 states have (on average 1.3171521035598706) internal successors, (814), 627 states have internal predecessors, (814), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-23 23:47:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 952 transitions. [2024-11-23 23:47:30,983 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 952 transitions. Word has length 263 [2024-11-23 23:47:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:30,984 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 952 transitions. [2024-11-23 23:47:30,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 952 transitions. [2024-11-23 23:47:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-23 23:47:30,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:30,989 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 23:47:31,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 23:47:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-23 23:47:31,190 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 681929818, now seen corresponding path program 1 times [2024-11-23 23:47:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:31,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124497695] [2024-11-23 23:47:31,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:31,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-23 23:47:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124497695] [2024-11-23 23:47:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124497695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:47:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83549285] [2024-11-23 23:47:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:31,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:47:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:31,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:47:31,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:31,551 INFO L87 Difference]: Start difference. First operand 729 states and 952 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:31,594 INFO L93 Difference]: Finished difference Result 1195 states and 1593 transitions. [2024-11-23 23:47:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:47:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 264 [2024-11-23 23:47:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:31,598 INFO L225 Difference]: With dead ends: 1195 [2024-11-23 23:47:31,599 INFO L226 Difference]: Without dead ends: 709 [2024-11-23 23:47:31,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:47:31,600 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 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 [2024-11-23 23:47:31,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-23 23:47:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2024-11-23 23:47:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 599 states have (on average 1.3021702838063438) internal successors, (780), 607 states have internal predecessors, (780), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-23 23:47:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 917 transitions. [2024-11-23 23:47:31,643 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 917 transitions. Word has length 264 [2024-11-23 23:47:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 917 transitions. [2024-11-23 23:47:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-23 23:47:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 917 transitions. [2024-11-23 23:47:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-23 23:47:31,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:31,647 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 23:47:31,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-23 23:47:31,648 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:31,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1470530144, now seen corresponding path program 1 times [2024-11-23 23:47:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:31,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803099453] [2024-11-23 23:47:31,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-23 23:47:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803099453] [2024-11-23 23:47:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803099453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 23:47:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596779871] [2024-11-23 23:47:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 23:47:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:32,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 23:47:32,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 23:47:32,257 INFO L87 Difference]: Start difference. First operand 709 states and 917 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-23 23:47:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:32,400 INFO L93 Difference]: Finished difference Result 1023 states and 1395 transitions. [2024-11-23 23:47:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:47:32,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 265 [2024-11-23 23:47:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:32,408 INFO L225 Difference]: With dead ends: 1023 [2024-11-23 23:47:32,409 INFO L226 Difference]: Without dead ends: 1021 [2024-11-23 23:47:32,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:47:32,410 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 119 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:32,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1739 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-23 23:47:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 715. [2024-11-23 23:47:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 603 states have (on average 1.3001658374792704) internal successors, (784), 612 states have internal predecessors, (784), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-23 23:47:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 923 transitions. [2024-11-23 23:47:32,482 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 923 transitions. Word has length 265 [2024-11-23 23:47:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:32,482 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 923 transitions. [2024-11-23 23:47:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-23 23:47:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 923 transitions. [2024-11-23 23:47:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-23 23:47:32,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:32,488 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:32,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-23 23:47:32,488 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 145584, now seen corresponding path program 1 times [2024-11-23 23:47:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552213756] [2024-11-23 23:47:32,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-23 23:47:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:33,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552213756] [2024-11-23 23:47:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552213756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650344301] [2024-11-23 23:47:33,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:33,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:33,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:33,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:33,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 23:47:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:33,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-23 23:47:33,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-23 23:47:33,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:47:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-23 23:47:34,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650344301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:47:34,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:47:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2024-11-23 23:47:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770178453] [2024-11-23 23:47:34,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:47:34,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 23:47:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:34,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 23:47:34,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:47:34,214 INFO L87 Difference]: Start difference. First operand 715 states and 923 transitions. Second operand has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-23 23:47:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:34,868 INFO L93 Difference]: Finished difference Result 1714 states and 2291 transitions. [2024-11-23 23:47:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 23:47:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 273 [2024-11-23 23:47:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:34,878 INFO L225 Difference]: With dead ends: 1714 [2024-11-23 23:47:34,879 INFO L226 Difference]: Without dead ends: 1262 [2024-11-23 23:47:34,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 537 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-23 23:47:34,884 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 213 mSDsluCounter, 3562 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3904 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:34,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3904 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:47:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-23 23:47:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 991. [2024-11-23 23:47:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 839 states have (on average 1.2908224076281287) internal successors, (1083), 849 states have internal predecessors, (1083), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2024-11-23 23:47:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1275 transitions. [2024-11-23 23:47:34,974 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1275 transitions. Word has length 273 [2024-11-23 23:47:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:34,975 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1275 transitions. [2024-11-23 23:47:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-23 23:47:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1275 transitions. [2024-11-23 23:47:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-23 23:47:34,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:34,980 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:34,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-23 23:47:35,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:35,185 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:35,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:35,185 INFO L85 PathProgramCache]: Analyzing trace with hash 961759601, now seen corresponding path program 1 times [2024-11-23 23:47:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141526534] [2024-11-23 23:47:35,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-23 23:47:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141526534] [2024-11-23 23:47:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141526534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510013741] [2024-11-23 23:47:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:35,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:35,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:35,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 23:47:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:35,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:47:35,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-23 23:47:35,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510013741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:35,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-23 23:47:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978616340] [2024-11-23 23:47:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:35,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:35,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:35,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:35,683 INFO L87 Difference]: Start difference. First operand 991 states and 1275 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 23:47:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:35,811 INFO L93 Difference]: Finished difference Result 1845 states and 2414 transitions. [2024-11-23 23:47:35,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 273 [2024-11-23 23:47:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:35,817 INFO L225 Difference]: With dead ends: 1845 [2024-11-23 23:47:35,817 INFO L226 Difference]: Without dead ends: 975 [2024-11-23 23:47:35,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:35,820 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:35,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 672 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-23 23:47:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2024-11-23 23:47:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 828 states have (on average 1.2789855072463767) internal successors, (1059), 838 states have internal predecessors, (1059), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2024-11-23 23:47:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1242 transitions. [2024-11-23 23:47:35,887 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1242 transitions. Word has length 273 [2024-11-23 23:47:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:35,888 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1242 transitions. [2024-11-23 23:47:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 23:47:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1242 transitions. [2024-11-23 23:47:35,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-23 23:47:35,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:35,893 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:35,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 23:47:36,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-23 23:47:36,094 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:36,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash 851124924, now seen corresponding path program 1 times [2024-11-23 23:47:36,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:36,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790838542] [2024-11-23 23:47:36,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-23 23:47:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790838542] [2024-11-23 23:47:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790838542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265592921] [2024-11-23 23:47:36,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:36,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:36,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:36,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:36,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 23:47:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:36,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:47:36,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-23 23:47:36,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265592921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:36,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-23 23:47:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677863231] [2024-11-23 23:47:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:36,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:36,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:36,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:36,604 INFO L87 Difference]: Start difference. First operand 975 states and 1242 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-23 23:47:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:36,707 INFO L93 Difference]: Finished difference Result 1692 states and 2197 transitions. [2024-11-23 23:47:36,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 276 [2024-11-23 23:47:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:36,712 INFO L225 Difference]: With dead ends: 1692 [2024-11-23 23:47:36,712 INFO L226 Difference]: Without dead ends: 829 [2024-11-23 23:47:36,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:36,715 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:36,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 700 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:47:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-23 23:47:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2024-11-23 23:47:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 700 states have (on average 1.2785714285714285) internal successors, (895), 710 states have internal predecessors, (895), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-23 23:47:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1056 transitions. [2024-11-23 23:47:36,779 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1056 transitions. Word has length 276 [2024-11-23 23:47:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:36,779 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1056 transitions. [2024-11-23 23:47:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-23 23:47:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1056 transitions. [2024-11-23 23:47:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-23 23:47:36,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:36,785 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:36,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 23:47:36,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:36,986 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash -346740133, now seen corresponding path program 1 times [2024-11-23 23:47:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:36,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993435371] [2024-11-23 23:47:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-23 23:47:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993435371] [2024-11-23 23:47:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993435371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091674186] [2024-11-23 23:47:37,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:37,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:37,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 23:47:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:37,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-23 23:47:37,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-23 23:47:38,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:38,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091674186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:38,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:38,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2024-11-23 23:47:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447733872] [2024-11-23 23:47:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:38,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:47:38,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:38,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:47:38,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-11-23 23:47:38,026 INFO L87 Difference]: Start difference. First operand 829 states and 1056 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:38,919 INFO L93 Difference]: Finished difference Result 2218 states and 2837 transitions. [2024-11-23 23:47:38,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 23:47:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 288 [2024-11-23 23:47:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:38,930 INFO L225 Difference]: With dead ends: 2218 [2024-11-23 23:47:38,930 INFO L226 Difference]: Without dead ends: 1759 [2024-11-23 23:47:38,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2024-11-23 23:47:38,933 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 620 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:38,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2766 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:47:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-23 23:47:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1390. [2024-11-23 23:47:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1163 states have (on average 1.2605331040412726) internal successors, (1466), 1178 states have internal predecessors, (1466), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-23 23:47:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1763 transitions. [2024-11-23 23:47:39,050 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1763 transitions. Word has length 288 [2024-11-23 23:47:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1763 transitions. [2024-11-23 23:47:39,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1763 transitions. [2024-11-23 23:47:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-23 23:47:39,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:39,057 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:39,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 23:47:39,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:39,258 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -805277292, now seen corresponding path program 1 times [2024-11-23 23:47:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147773115] [2024-11-23 23:47:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-23 23:47:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147773115] [2024-11-23 23:47:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147773115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539331097] [2024-11-23 23:47:39,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:39,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:39,778 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:39,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 23:47:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:40,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-23 23:47:40,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-23 23:47:40,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:40,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539331097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:40,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:40,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2024-11-23 23:47:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045863406] [2024-11-23 23:47:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:40,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:47:40,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:40,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:47:40,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:47:40,251 INFO L87 Difference]: Start difference. First operand 1390 states and 1763 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:41,169 INFO L93 Difference]: Finished difference Result 2796 states and 3563 transitions. [2024-11-23 23:47:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 23:47:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 294 [2024-11-23 23:47:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:41,219 INFO L225 Difference]: With dead ends: 2796 [2024-11-23 23:47:41,219 INFO L226 Difference]: Without dead ends: 1753 [2024-11-23 23:47:41,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:47:41,226 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 606 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:41,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 2594 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:47:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-23 23:47:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1390. [2024-11-23 23:47:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1163 states have (on average 1.2570937231298367) internal successors, (1462), 1178 states have internal predecessors, (1462), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-23 23:47:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1759 transitions. [2024-11-23 23:47:41,415 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1759 transitions. Word has length 294 [2024-11-23 23:47:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:41,416 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1759 transitions. [2024-11-23 23:47:41,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1759 transitions. [2024-11-23 23:47:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-23 23:47:41,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:41,420 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:41,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 23:47:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:41,621 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash -671263786, now seen corresponding path program 1 times [2024-11-23 23:47:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40089469] [2024-11-23 23:47:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-23 23:47:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:41,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40089469] [2024-11-23 23:47:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40089469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:41,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723666102] [2024-11-23 23:47:41,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:41,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:41,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:41,926 INFO L87 Difference]: Start difference. First operand 1390 states and 1759 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:42,074 INFO L93 Difference]: Finished difference Result 2481 states and 3204 transitions. [2024-11-23 23:47:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 294 [2024-11-23 23:47:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:42,084 INFO L225 Difference]: With dead ends: 2481 [2024-11-23 23:47:42,084 INFO L226 Difference]: Without dead ends: 1464 [2024-11-23 23:47:42,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:42,088 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 25 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:42,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 735 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2024-11-23 23:47:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1459. [2024-11-23 23:47:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1219 states have (on average 1.265791632485644) internal successors, (1543), 1234 states have internal predecessors, (1543), 162 states have call successors, (162), 78 states have call predecessors, (162), 77 states have return successors, (161), 153 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-23 23:47:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1866 transitions. [2024-11-23 23:47:42,208 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1866 transitions. Word has length 294 [2024-11-23 23:47:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:42,210 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1866 transitions. [2024-11-23 23:47:42,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1866 transitions. [2024-11-23 23:47:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-23 23:47:42,215 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:42,215 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:42,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-23 23:47:42,215 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1692332140, now seen corresponding path program 1 times [2024-11-23 23:47:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935385391] [2024-11-23 23:47:42,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-23 23:47:42,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935385391] [2024-11-23 23:47:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935385391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360036046] [2024-11-23 23:47:42,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:42,775 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:42,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 23:47:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:43,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-23 23:47:43,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-23 23:47:43,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:47:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360036046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:47:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2024-11-23 23:47:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715727518] [2024-11-23 23:47:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 23:47:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:43,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 23:47:43,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:47:43,276 INFO L87 Difference]: Start difference. First operand 1459 states and 1866 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:44,174 INFO L93 Difference]: Finished difference Result 3443 states and 4407 transitions. [2024-11-23 23:47:44,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-23 23:47:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 294 [2024-11-23 23:47:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:44,187 INFO L225 Difference]: With dead ends: 3443 [2024-11-23 23:47:44,187 INFO L226 Difference]: Without dead ends: 2337 [2024-11-23 23:47:44,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-11-23 23:47:44,191 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 606 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:44,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 2673 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 23:47:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2024-11-23 23:47:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1676. [2024-11-23 23:47:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1401 states have (on average 1.2548179871520342) internal successors, (1758), 1418 states have internal predecessors, (1758), 187 states have call successors, (187), 88 states have call predecessors, (187), 87 states have return successors, (186), 176 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-23 23:47:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2131 transitions. [2024-11-23 23:47:44,333 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2131 transitions. Word has length 294 [2024-11-23 23:47:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:44,334 INFO L471 AbstractCegarLoop]: Abstraction has 1676 states and 2131 transitions. [2024-11-23 23:47:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 9 states have internal predecessors, (115), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-23 23:47:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2131 transitions. [2024-11-23 23:47:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-23 23:47:44,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:44,337 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:44,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-23 23:47:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:44,542 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash -738391982, now seen corresponding path program 1 times [2024-11-23 23:47:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934768690] [2024-11-23 23:47:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-23 23:47:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:44,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934768690] [2024-11-23 23:47:44,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934768690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:44,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:44,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 23:47:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980352649] [2024-11-23 23:47:44,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:44,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 23:47:44,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:44,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 23:47:44,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:44,823 INFO L87 Difference]: Start difference. First operand 1676 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-23 23:47:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:45,160 INFO L93 Difference]: Finished difference Result 2999 states and 3849 transitions. [2024-11-23 23:47:45,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:47:45,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 294 [2024-11-23 23:47:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:45,170 INFO L225 Difference]: With dead ends: 2999 [2024-11-23 23:47:45,171 INFO L226 Difference]: Without dead ends: 1696 [2024-11-23 23:47:45,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:47:45,174 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 385 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:45,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 681 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:47:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-11-23 23:47:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1572. [2024-11-23 23:47:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1312 states have (on average 1.2553353658536586) internal successors, (1647), 1328 states have internal predecessors, (1647), 177 states have call successors, (177), 83 states have call predecessors, (177), 82 states have return successors, (176), 167 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-23 23:47:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2000 transitions. [2024-11-23 23:47:45,293 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2000 transitions. Word has length 294 [2024-11-23 23:47:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:45,294 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2000 transitions. [2024-11-23 23:47:45,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-23 23:47:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2000 transitions. [2024-11-23 23:47:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-23 23:47:45,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:45,297 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:47:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-23 23:47:45,297 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1394951213, now seen corresponding path program 1 times [2024-11-23 23:47:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686248896] [2024-11-23 23:47:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:45,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2024-11-23 23:47:45,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:45,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686248896] [2024-11-23 23:47:45,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686248896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:45,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:45,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:45,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109695241] [2024-11-23 23:47:45,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:45,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:45,473 INFO L87 Difference]: Start difference. First operand 1572 states and 2000 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 23:47:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:45,843 INFO L93 Difference]: Finished difference Result 2835 states and 3628 transitions. [2024-11-23 23:47:45,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 302 [2024-11-23 23:47:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:45,852 INFO L225 Difference]: With dead ends: 2835 [2024-11-23 23:47:45,852 INFO L226 Difference]: Without dead ends: 1629 [2024-11-23 23:47:45,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:45,855 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 310 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:45,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1045 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:47:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2024-11-23 23:47:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1388. [2024-11-23 23:47:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1166 states have (on average 1.2332761578044598) internal successors, (1438), 1174 states have internal predecessors, (1438), 151 states have call successors, (151), 70 states have call predecessors, (151), 70 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-23 23:47:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1740 transitions. [2024-11-23 23:47:45,968 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1740 transitions. Word has length 302 [2024-11-23 23:47:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:45,969 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1740 transitions. [2024-11-23 23:47:45,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 23:47:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1740 transitions. [2024-11-23 23:47:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-23 23:47:45,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:45,973 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:47:45,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-23 23:47:45,973 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash 204743799, now seen corresponding path program 1 times [2024-11-23 23:47:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014551358] [2024-11-23 23:47:45,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2024-11-23 23:47:47,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014551358] [2024-11-23 23:47:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014551358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:47:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170973629] [2024-11-23 23:47:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:47:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:47,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:47:47,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:47:47,347 INFO L87 Difference]: Start difference. First operand 1388 states and 1740 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 6 states have internal predecessors, (104), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-23 23:47:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:47,686 INFO L93 Difference]: Finished difference Result 2828 states and 3575 transitions. [2024-11-23 23:47:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:47:47,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 6 states have internal predecessors, (104), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 344 [2024-11-23 23:47:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:47,696 INFO L225 Difference]: With dead ends: 2828 [2024-11-23 23:47:47,696 INFO L226 Difference]: Without dead ends: 1813 [2024-11-23 23:47:47,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:47:47,699 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 137 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:47,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1456 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:47:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-23 23:47:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1550. [2024-11-23 23:47:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1288 states have (on average 1.2329192546583851) internal successors, (1588), 1299 states have internal predecessors, (1588), 170 states have call successors, (170), 82 states have call predecessors, (170), 91 states have return successors, (185), 168 states have call predecessors, (185), 170 states have call successors, (185) [2024-11-23 23:47:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1943 transitions. [2024-11-23 23:47:47,839 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1943 transitions. Word has length 344 [2024-11-23 23:47:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:47,840 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 1943 transitions. [2024-11-23 23:47:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 6 states have internal predecessors, (104), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-23 23:47:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1943 transitions. [2024-11-23 23:47:47,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-23 23:47:47,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:47,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:47:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-23 23:47:47,862 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 8230294, now seen corresponding path program 1 times [2024-11-23 23:47:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897199083] [2024-11-23 23:47:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-11-23 23:47:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:48,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897199083] [2024-11-23 23:47:48,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897199083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:47:48,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:47:48,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:47:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851345508] [2024-11-23 23:47:48,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:47:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:47:48,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:48,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:47:48,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:47:48,056 INFO L87 Difference]: Start difference. First operand 1550 states and 1943 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-23 23:47:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:47:48,240 INFO L93 Difference]: Finished difference Result 3123 states and 3922 transitions. [2024-11-23 23:47:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:47:48,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 344 [2024-11-23 23:47:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:47:48,253 INFO L225 Difference]: With dead ends: 3123 [2024-11-23 23:47:48,253 INFO L226 Difference]: Without dead ends: 1514 [2024-11-23 23:47:48,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:47:48,260 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 26 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:47:48,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 646 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 23:47:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-23 23:47:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2024-11-23 23:47:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1261 states have (on average 1.2022204599524187) internal successors, (1516), 1272 states have internal predecessors, (1516), 170 states have call successors, (170), 82 states have call predecessors, (170), 82 states have return successors, (170), 159 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-23 23:47:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1856 transitions. [2024-11-23 23:47:48,385 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1856 transitions. Word has length 344 [2024-11-23 23:47:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:47:48,386 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 1856 transitions. [2024-11-23 23:47:48,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-23 23:47:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1856 transitions. [2024-11-23 23:47:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-23 23:47:48,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:47:48,391 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:47:48,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-23 23:47:48,393 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:47:48,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:47:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -170581188, now seen corresponding path program 1 times [2024-11-23 23:47:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:47:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457091851] [2024-11-23 23:47:48,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:47:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-23 23:47:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:47:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457091851] [2024-11-23 23:47:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457091851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:47:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216896883] [2024-11-23 23:47:49,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:47:49,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:47:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:47:49,354 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:47:49,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 23:47:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:47:49,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-23 23:47:49,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:47:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 275 proven. 65 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-23 23:47:50,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:47:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-23 23:47:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216896883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:47:51,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:47:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 12] total 21 [2024-11-23 23:47:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670038447] [2024-11-23 23:47:51,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:47:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-23 23:47:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:47:51,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-23 23:47:51,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-23 23:47:51,482 INFO L87 Difference]: Start difference. First operand 1514 states and 1856 transitions. Second operand has 21 states, 20 states have (on average 13.4) internal successors, (268), 20 states have internal predecessors, (268), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) [2024-11-23 23:48:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:00,324 INFO L93 Difference]: Finished difference Result 12636 states and 16902 transitions. [2024-11-23 23:48:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-11-23 23:48:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 13.4) internal successors, (268), 20 states have internal predecessors, (268), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) Word has length 354 [2024-11-23 23:48:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:00,390 INFO L225 Difference]: With dead ends: 12636 [2024-11-23 23:48:00,391 INFO L226 Difference]: Without dead ends: 11513 [2024-11-23 23:48:00,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 729 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8780 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2694, Invalid=19956, Unknown=0, NotChecked=0, Total=22650 [2024-11-23 23:48:00,403 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 8317 mSDsluCounter, 8831 mSDsCounter, 0 mSdLazyCounter, 3601 mSolverCounterSat, 2047 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8317 SdHoareTripleChecker+Valid, 9783 SdHoareTripleChecker+Invalid, 5648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2047 IncrementalHoareTripleChecker+Valid, 3601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:00,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8317 Valid, 9783 Invalid, 5648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2047 Valid, 3601 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-23 23:48:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2024-11-23 23:48:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 2833. [2024-11-23 23:48:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2349 states have (on average 1.2209450830140485) internal successors, (2868), 2371 states have internal predecessors, (2868), 326 states have call successors, (326), 157 states have call predecessors, (326), 157 states have return successors, (326), 304 states have call predecessors, (326), 326 states have call successors, (326) [2024-11-23 23:48:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3520 transitions. [2024-11-23 23:48:00,949 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3520 transitions. Word has length 354 [2024-11-23 23:48:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:00,950 INFO L471 AbstractCegarLoop]: Abstraction has 2833 states and 3520 transitions. [2024-11-23 23:48:00,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.4) internal successors, (268), 20 states have internal predecessors, (268), 12 states have call successors, (53), 7 states have call predecessors, (53), 6 states have return successors, (51), 11 states have call predecessors, (51), 11 states have call successors, (51) [2024-11-23 23:48:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3520 transitions. [2024-11-23 23:48:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-23 23:48:00,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:00,957 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:00,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-23 23:48:01,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:01,162 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:01,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1090336062, now seen corresponding path program 1 times [2024-11-23 23:48:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:01,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494634943] [2024-11-23 23:48:01,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:01,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-23 23:48:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494634943] [2024-11-23 23:48:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494634943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:48:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494707938] [2024-11-23 23:48:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:01,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:48:01,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:01,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:48:01,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:48:01,570 INFO L87 Difference]: Start difference. First operand 2833 states and 3520 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:48:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:02,208 INFO L93 Difference]: Finished difference Result 5567 states and 6990 transitions. [2024-11-23 23:48:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:48:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 354 [2024-11-23 23:48:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:02,222 INFO L225 Difference]: With dead ends: 5567 [2024-11-23 23:48:02,222 INFO L226 Difference]: Without dead ends: 3282 [2024-11-23 23:48:02,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-23 23:48:02,227 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 149 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:02,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2196 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:48:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2024-11-23 23:48:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2539. [2024-11-23 23:48:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2127 states have (on average 1.216737188528444) internal successors, (2588), 2147 states have internal predecessors, (2588), 276 states have call successors, (276), 135 states have call predecessors, (276), 135 states have return successors, (276), 256 states have call predecessors, (276), 276 states have call successors, (276) [2024-11-23 23:48:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3140 transitions. [2024-11-23 23:48:02,519 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3140 transitions. Word has length 354 [2024-11-23 23:48:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:02,520 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 3140 transitions. [2024-11-23 23:48:02,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:48:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3140 transitions. [2024-11-23 23:48:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-23 23:48:02,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:02,527 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:02,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-23 23:48:02,527 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:02,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1999648931, now seen corresponding path program 1 times [2024-11-23 23:48:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871497644] [2024-11-23 23:48:02,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-23 23:48:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871497644] [2024-11-23 23:48:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871497644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872775758] [2024-11-23 23:48:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:03,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:03,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 23:48:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:03,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-23 23:48:03,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 275 proven. 63 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2024-11-23 23:48:04,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-23 23:48:05,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872775758] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:05,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:48:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 27 [2024-11-23 23:48:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845340268] [2024-11-23 23:48:05,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:05,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-23 23:48:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:05,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-23 23:48:05,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-23 23:48:05,538 INFO L87 Difference]: Start difference. First operand 2539 states and 3140 transitions. Second operand has 27 states, 26 states have (on average 12.307692307692308) internal successors, (320), 26 states have internal predecessors, (320), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2024-11-23 23:48:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:17,973 INFO L93 Difference]: Finished difference Result 24007 states and 31481 transitions. [2024-11-23 23:48:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-23 23:48:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 12.307692307692308) internal successors, (320), 26 states have internal predecessors, (320), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) Word has length 355 [2024-11-23 23:48:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:18,047 INFO L225 Difference]: With dead ends: 24007 [2024-11-23 23:48:18,047 INFO L226 Difference]: Without dead ends: 22016 [2024-11-23 23:48:18,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19111 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5618, Invalid=41688, Unknown=0, NotChecked=0, Total=47306 [2024-11-23 23:48:18,067 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 3896 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 5745 mSolverCounterSat, 889 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3896 SdHoareTripleChecker+Valid, 13479 SdHoareTripleChecker+Invalid, 6634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 889 IncrementalHoareTripleChecker+Valid, 5745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:18,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3896 Valid, 13479 Invalid, 6634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [889 Valid, 5745 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-23 23:48:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22016 states. [2024-11-23 23:48:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22016 to 3734. [2024-11-23 23:48:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3734 states, 3123 states have (on average 1.223503041946846) internal successors, (3821), 3153 states have internal predecessors, (3821), 409 states have call successors, (409), 201 states have call predecessors, (409), 201 states have return successors, (409), 379 states have call predecessors, (409), 409 states have call successors, (409) [2024-11-23 23:48:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 4639 transitions. [2024-11-23 23:48:19,061 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 4639 transitions. Word has length 355 [2024-11-23 23:48:19,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:19,063 INFO L471 AbstractCegarLoop]: Abstraction has 3734 states and 4639 transitions. [2024-11-23 23:48:19,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 12.307692307692308) internal successors, (320), 26 states have internal predecessors, (320), 15 states have call successors, (62), 7 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2024-11-23 23:48:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 4639 transitions. [2024-11-23 23:48:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-23 23:48:19,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:19,075 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:19,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 23:48:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-23 23:48:19,279 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash 385584917, now seen corresponding path program 1 times [2024-11-23 23:48:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860667379] [2024-11-23 23:48:19,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2024-11-23 23:48:20,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860667379] [2024-11-23 23:48:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860667379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:20,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127769598] [2024-11-23 23:48:20,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:20,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:20,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:20,708 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:20,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-23 23:48:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:21,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-23 23:48:21,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 248 proven. 93 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-23 23:48:22,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2024-11-23 23:48:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127769598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:22,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:48:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 34 [2024-11-23 23:48:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215821728] [2024-11-23 23:48:22,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:22,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-23 23:48:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:22,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-23 23:48:22,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-11-23 23:48:22,965 INFO L87 Difference]: Start difference. First operand 3734 states and 4639 transitions. Second operand has 34 states, 33 states have (on average 8.969696969696969) internal successors, (296), 31 states have internal predecessors, (296), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) [2024-11-23 23:48:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:41,587 INFO L93 Difference]: Finished difference Result 45173 states and 59023 transitions. [2024-11-23 23:48:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2024-11-23 23:48:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 8.969696969696969) internal successors, (296), 31 states have internal predecessors, (296), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) Word has length 356 [2024-11-23 23:48:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:41,730 INFO L225 Difference]: With dead ends: 45173 [2024-11-23 23:48:41,731 INFO L226 Difference]: Without dead ends: 42132 [2024-11-23 23:48:41,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1065 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53133 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=8621, Invalid=114931, Unknown=0, NotChecked=0, Total=123552 [2024-11-23 23:48:41,762 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 4071 mSDsluCounter, 14012 mSDsCounter, 0 mSdLazyCounter, 8069 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 14890 SdHoareTripleChecker+Invalid, 9090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 8069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:41,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 14890 Invalid, 9090 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1021 Valid, 8069 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-23 23:48:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42132 states. [2024-11-23 23:48:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42132 to 5337. [2024-11-23 23:48:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 4459 states have (on average 1.2260596546310831) internal successors, (5467), 4503 states have internal predecessors, (5467), 596 states have call successors, (596), 281 states have call predecessors, (596), 281 states have return successors, (596), 552 states have call predecessors, (596), 596 states have call successors, (596) [2024-11-23 23:48:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 6659 transitions. [2024-11-23 23:48:43,192 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 6659 transitions. Word has length 356 [2024-11-23 23:48:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:43,193 INFO L471 AbstractCegarLoop]: Abstraction has 5337 states and 6659 transitions. [2024-11-23 23:48:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 8.969696969696969) internal successors, (296), 31 states have internal predecessors, (296), 12 states have call successors, (55), 7 states have call predecessors, (55), 9 states have return successors, (54), 13 states have call predecessors, (54), 11 states have call successors, (54) [2024-11-23 23:48:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 6659 transitions. [2024-11-23 23:48:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-23 23:48:43,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:43,208 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:43,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-23 23:48:43,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:43,412 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -813025233, now seen corresponding path program 1 times [2024-11-23 23:48:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263521749] [2024-11-23 23:48:43,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-23 23:48:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263521749] [2024-11-23 23:48:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263521749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:43,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:43,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:48:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728849639] [2024-11-23 23:48:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:48:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:43,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:48:43,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:48:43,813 INFO L87 Difference]: Start difference. First operand 5337 states and 6659 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 8 states have internal predecessors, (123), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:48:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:45,468 INFO L93 Difference]: Finished difference Result 12372 states and 15533 transitions. [2024-11-23 23:48:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-23 23:48:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 8 states have internal predecessors, (123), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 356 [2024-11-23 23:48:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:45,495 INFO L225 Difference]: With dead ends: 12372 [2024-11-23 23:48:45,495 INFO L226 Difference]: Without dead ends: 7849 [2024-11-23 23:48:45,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-23 23:48:45,504 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 277 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:45,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2997 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 23:48:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2024-11-23 23:48:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 5301. [2024-11-23 23:48:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 4435 states have (on average 1.2236753100338218) internal successors, (5427), 4479 states have internal predecessors, (5427), 584 states have call successors, (584), 281 states have call predecessors, (584), 281 states have return successors, (584), 540 states have call predecessors, (584), 584 states have call successors, (584) [2024-11-23 23:48:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 6595 transitions. [2024-11-23 23:48:46,452 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 6595 transitions. Word has length 356 [2024-11-23 23:48:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:46,453 INFO L471 AbstractCegarLoop]: Abstraction has 5301 states and 6595 transitions. [2024-11-23 23:48:46,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 8 states have internal predecessors, (123), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:48:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 6595 transitions. [2024-11-23 23:48:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-23 23:48:46,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:46,463 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:46,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-23 23:48:46,464 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:46,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1713328277, now seen corresponding path program 1 times [2024-11-23 23:48:46,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774312605] [2024-11-23 23:48:46,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2024-11-23 23:48:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774312605] [2024-11-23 23:48:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774312605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:48:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82610142] [2024-11-23 23:48:46,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:48:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:46,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:48:46,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:46,758 INFO L87 Difference]: Start difference. First operand 5301 states and 6595 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-23 23:48:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:48,043 INFO L93 Difference]: Finished difference Result 9360 states and 11672 transitions. [2024-11-23 23:48:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:48:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 356 [2024-11-23 23:48:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:48,067 INFO L225 Difference]: With dead ends: 9360 [2024-11-23 23:48:48,067 INFO L226 Difference]: Without dead ends: 4498 [2024-11-23 23:48:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:48,078 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 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 [2024-11-23 23:48:48,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:48:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2024-11-23 23:48:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 4498. [2024-11-23 23:48:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 3672 states have (on average 1.2099673202614378) internal successors, (4443), 3716 states have internal predecessors, (4443), 564 states have call successors, (564), 261 states have call predecessors, (564), 261 states have return successors, (564), 520 states have call predecessors, (564), 564 states have call successors, (564) [2024-11-23 23:48:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 5571 transitions. [2024-11-23 23:48:48,860 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 5571 transitions. Word has length 356 [2024-11-23 23:48:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 5571 transitions. [2024-11-23 23:48:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-23 23:48:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 5571 transitions. [2024-11-23 23:48:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-23 23:48:48,869 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:48,869 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-23 23:48:48,870 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1117464772, now seen corresponding path program 1 times [2024-11-23 23:48:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508588254] [2024-11-23 23:48:48,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-11-23 23:48:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:49,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508588254] [2024-11-23 23:48:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508588254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:49,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:48:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744688532] [2024-11-23 23:48:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:49,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:48:49,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:49,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:48:49,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:49,246 INFO L87 Difference]: Start difference. First operand 4498 states and 5571 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-23 23:48:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:49,933 INFO L93 Difference]: Finished difference Result 8336 states and 10367 transitions. [2024-11-23 23:48:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:48:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 357 [2024-11-23 23:48:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:49,948 INFO L225 Difference]: With dead ends: 8336 [2024-11-23 23:48:49,948 INFO L226 Difference]: Without dead ends: 4201 [2024-11-23 23:48:49,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:49,956 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 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 [2024-11-23 23:48:49,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:48:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4201 states. [2024-11-23 23:48:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4201 to 4201. [2024-11-23 23:48:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4201 states, 3385 states have (on average 1.2053175775480058) internal successors, (4080), 3429 states have internal predecessors, (4080), 559 states have call successors, (559), 256 states have call predecessors, (559), 256 states have return successors, (559), 515 states have call predecessors, (559), 559 states have call successors, (559) [2024-11-23 23:48:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 5198 transitions. [2024-11-23 23:48:50,851 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 5198 transitions. Word has length 357 [2024-11-23 23:48:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:50,851 INFO L471 AbstractCegarLoop]: Abstraction has 4201 states and 5198 transitions. [2024-11-23 23:48:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-23 23:48:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 5198 transitions. [2024-11-23 23:48:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-23 23:48:50,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:50,860 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:50,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-23 23:48:50,860 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -561755108, now seen corresponding path program 1 times [2024-11-23 23:48:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119911189] [2024-11-23 23:48:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2024-11-23 23:48:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119911189] [2024-11-23 23:48:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119911189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:51,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:51,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:48:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723021394] [2024-11-23 23:48:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:51,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:48:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:51,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:48:51,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:51,157 INFO L87 Difference]: Start difference. First operand 4201 states and 5198 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:48:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:51,718 INFO L93 Difference]: Finished difference Result 6623 states and 8202 transitions. [2024-11-23 23:48:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:48:51,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 358 [2024-11-23 23:48:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:51,733 INFO L225 Difference]: With dead ends: 6623 [2024-11-23 23:48:51,733 INFO L226 Difference]: Without dead ends: 2771 [2024-11-23 23:48:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:48:51,745 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 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 [2024-11-23 23:48:51,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:48:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2024-11-23 23:48:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2771. [2024-11-23 23:48:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2260 states have (on average 1.1942477876106194) internal successors, (2699), 2287 states have internal predecessors, (2699), 344 states have call successors, (344), 166 states have call predecessors, (344), 166 states have return successors, (344), 317 states have call predecessors, (344), 344 states have call successors, (344) [2024-11-23 23:48:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3387 transitions. [2024-11-23 23:48:52,258 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3387 transitions. Word has length 358 [2024-11-23 23:48:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 3387 transitions. [2024-11-23 23:48:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:48:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3387 transitions. [2024-11-23 23:48:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-23 23:48:52,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:52,263 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:52,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-23 23:48:52,263 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:52,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -981243013, now seen corresponding path program 1 times [2024-11-23 23:48:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864829851] [2024-11-23 23:48:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:52,508 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2024-11-23 23:48:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864829851] [2024-11-23 23:48:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864829851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 23:48:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029422910] [2024-11-23 23:48:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:52,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:48:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:52,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:48:52,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 23:48:52,509 INFO L87 Difference]: Start difference. First operand 2771 states and 3387 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:48:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:53,216 INFO L93 Difference]: Finished difference Result 5433 states and 6682 transitions. [2024-11-23 23:48:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:48:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 361 [2024-11-23 23:48:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:53,226 INFO L225 Difference]: With dead ends: 5433 [2024-11-23 23:48:53,226 INFO L226 Difference]: Without dead ends: 3214 [2024-11-23 23:48:53,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:48:53,230 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 118 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:53,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1659 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:48:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2024-11-23 23:48:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 2858. [2024-11-23 23:48:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2323 states have (on average 1.1941455015066724) internal successors, (2774), 2350 states have internal predecessors, (2774), 362 states have call successors, (362), 172 states have call predecessors, (362), 172 states have return successors, (362), 335 states have call predecessors, (362), 362 states have call successors, (362) [2024-11-23 23:48:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3498 transitions. [2024-11-23 23:48:53,853 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3498 transitions. Word has length 361 [2024-11-23 23:48:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:53,853 INFO L471 AbstractCegarLoop]: Abstraction has 2858 states and 3498 transitions. [2024-11-23 23:48:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 7 states have internal predecessors, (122), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:48:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3498 transitions. [2024-11-23 23:48:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-23 23:48:53,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:53,860 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:53,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-23 23:48:53,860 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:53,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash -988519775, now seen corresponding path program 1 times [2024-11-23 23:48:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537468267] [2024-11-23 23:48:53,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:53,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2024-11-23 23:48:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537468267] [2024-11-23 23:48:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537468267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865407557] [2024-11-23 23:48:54,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:54,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:54,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:54,119 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:54,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-23 23:48:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:54,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-23 23:48:54,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 127 proven. 205 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-23 23:48:54,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2024-11-23 23:48:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865407557] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:55,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:48:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 19 [2024-11-23 23:48:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352409416] [2024-11-23 23:48:55,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:55,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:48:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:48:55,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:48:55,337 INFO L87 Difference]: Start difference. First operand 2858 states and 3498 transitions. Second operand has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 17 states have internal predecessors, (274), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-23 23:48:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:58,371 INFO L93 Difference]: Finished difference Result 8650 states and 10642 transitions. [2024-11-23 23:48:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-23 23:48:58,371 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 17 states have internal predecessors, (274), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) Word has length 361 [2024-11-23 23:48:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:58,384 INFO L225 Difference]: With dead ends: 8650 [2024-11-23 23:48:58,384 INFO L226 Difference]: Without dead ends: 6344 [2024-11-23 23:48:58,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 712 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=3178, Unknown=0, NotChecked=0, Total=3540 [2024-11-23 23:48:58,388 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 957 mSDsluCounter, 7400 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:58,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 7968 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-23 23:48:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6344 states. [2024-11-23 23:48:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6344 to 4934. [2024-11-23 23:48:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4934 states, 4030 states have (on average 1.1935483870967742) internal successors, (4810), 4072 states have internal predecessors, (4810), 608 states have call successors, (608), 295 states have call predecessors, (608), 295 states have return successors, (608), 566 states have call predecessors, (608), 608 states have call successors, (608) [2024-11-23 23:48:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 6026 transitions. [2024-11-23 23:48:59,317 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 6026 transitions. Word has length 361 [2024-11-23 23:48:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:59,318 INFO L471 AbstractCegarLoop]: Abstraction has 4934 states and 6026 transitions. [2024-11-23 23:48:59,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.421052631578947) internal successors, (274), 17 states have internal predecessors, (274), 7 states have call successors, (65), 6 states have call predecessors, (65), 9 states have return successors, (64), 9 states have call predecessors, (64), 7 states have call successors, (64) [2024-11-23 23:48:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 6026 transitions. [2024-11-23 23:48:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-23 23:48:59,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:59,322 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:59,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-23 23:48:59,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-23 23:48:59,523 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1420824299, now seen corresponding path program 1 times [2024-11-23 23:48:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655638626] [2024-11-23 23:48:59,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 943 trivial. 0 not checked. [2024-11-23 23:48:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655638626] [2024-11-23 23:48:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655638626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249468639] [2024-11-23 23:48:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:59,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:59,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:59,865 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:59,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-23 23:49:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:00,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1364 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-23 23:49:00,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 327 proven. 60 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-23 23:49:00,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:49:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 58 proven. 52 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-23 23:49:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249468639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:49:01,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:49:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2024-11-23 23:49:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357028765] [2024-11-23 23:49:01,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:49:01,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-23 23:49:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:01,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-23 23:49:01,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2024-11-23 23:49:01,405 INFO L87 Difference]: Start difference. First operand 4934 states and 6026 transitions. Second operand has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 28 states have internal predecessors, (287), 7 states have call successors, (49), 8 states have call predecessors, (49), 15 states have return successors, (50), 12 states have call predecessors, (50), 7 states have call successors, (50) [2024-11-23 23:49:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:17,324 INFO L93 Difference]: Finished difference Result 17739 states and 21775 transitions. [2024-11-23 23:49:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2024-11-23 23:49:17,325 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 28 states have internal predecessors, (287), 7 states have call successors, (49), 8 states have call predecessors, (49), 15 states have return successors, (50), 12 states have call predecessors, (50), 7 states have call successors, (50) Word has length 365 [2024-11-23 23:49:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:17,366 INFO L225 Difference]: With dead ends: 17739 [2024-11-23 23:49:17,366 INFO L226 Difference]: Without dead ends: 14428 [2024-11-23 23:49:17,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25985 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=6124, Invalid=61736, Unknown=0, NotChecked=0, Total=67860 [2024-11-23 23:49:17,385 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 2796 mSDsluCounter, 10371 mSDsCounter, 0 mSdLazyCounter, 7674 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 10979 SdHoareTripleChecker+Invalid, 8640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 7674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:17,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 10979 Invalid, 8640 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [966 Valid, 7674 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-23 23:49:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14428 states. [2024-11-23 23:49:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14428 to 7602. [2024-11-23 23:49:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 6212 states have (on average 1.1823889246619446) internal successors, (7345), 6272 states have internal predecessors, (7345), 898 states have call successors, (898), 491 states have call predecessors, (898), 491 states have return successors, (898), 838 states have call predecessors, (898), 898 states have call successors, (898) [2024-11-23 23:49:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 9141 transitions. [2024-11-23 23:49:19,295 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 9141 transitions. Word has length 365 [2024-11-23 23:49:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:19,295 INFO L471 AbstractCegarLoop]: Abstraction has 7602 states and 9141 transitions. [2024-11-23 23:49:19,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.696969696969697) internal successors, (287), 28 states have internal predecessors, (287), 7 states have call successors, (49), 8 states have call predecessors, (49), 15 states have return successors, (50), 12 states have call predecessors, (50), 7 states have call successors, (50) [2024-11-23 23:49:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 9141 transitions. [2024-11-23 23:49:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-23 23:49:19,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:19,302 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:19,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-23 23:49:19,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:19,503 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:19,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2057243601, now seen corresponding path program 1 times [2024-11-23 23:49:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:19,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990353092] [2024-11-23 23:49:19,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-23 23:49:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990353092] [2024-11-23 23:49:19,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990353092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:49:19,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:49:19,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:49:19,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383964947] [2024-11-23 23:49:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:49:19,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 23:49:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:19,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 23:49:19,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:49:19,619 INFO L87 Difference]: Start difference. First operand 7602 states and 9141 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:49:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:21,630 INFO L93 Difference]: Finished difference Result 12853 states and 15393 transitions. [2024-11-23 23:49:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 23:49:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 368 [2024-11-23 23:49:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:21,648 INFO L225 Difference]: With dead ends: 12853 [2024-11-23 23:49:21,648 INFO L226 Difference]: Without dead ends: 9095 [2024-11-23 23:49:21,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 23:49:21,655 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 121 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:21,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 532 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:49:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2024-11-23 23:49:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 7602. [2024-11-23 23:49:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7602 states, 6212 states have (on average 1.175949774629749) internal successors, (7305), 6272 states have internal predecessors, (7305), 898 states have call successors, (898), 491 states have call predecessors, (898), 491 states have return successors, (898), 838 states have call predecessors, (898), 898 states have call successors, (898) [2024-11-23 23:49:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7602 states to 7602 states and 9101 transitions. [2024-11-23 23:49:23,282 INFO L78 Accepts]: Start accepts. Automaton has 7602 states and 9101 transitions. Word has length 368 [2024-11-23 23:49:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:23,283 INFO L471 AbstractCegarLoop]: Abstraction has 7602 states and 9101 transitions. [2024-11-23 23:49:23,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:49:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7602 states and 9101 transitions. [2024-11-23 23:49:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-23 23:49:23,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:23,288 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:23,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-23 23:49:23,288 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1696706257, now seen corresponding path program 1 times [2024-11-23 23:49:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:23,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861919285] [2024-11-23 23:49:23,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 32 proven. 70 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-11-23 23:49:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861919285] [2024-11-23 23:49:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861919285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:49:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239660304] [2024-11-23 23:49:24,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:24,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:49:24,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:49:24,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-23 23:49:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:25,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1368 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-23 23:49:25,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 304 proven. 72 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2024-11-23 23:49:25,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:49:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 32 proven. 70 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-11-23 23:49:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239660304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:49:26,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:49:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-23 23:49:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759640162] [2024-11-23 23:49:26,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:49:26,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-23 23:49:26,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-23 23:49:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-11-23 23:49:26,243 INFO L87 Difference]: Start difference. First operand 7602 states and 9101 transitions. Second operand has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (45), 8 states have call predecessors, (45), 16 states have return successors, (48), 13 states have call predecessors, (48), 7 states have call successors, (48) [2024-11-23 23:49:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:31,789 INFO L93 Difference]: Finished difference Result 15428 states and 18436 transitions. [2024-11-23 23:49:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-23 23:49:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (45), 8 states have call predecessors, (45), 16 states have return successors, (48), 13 states have call predecessors, (48), 7 states have call successors, (48) Word has length 368 [2024-11-23 23:49:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:31,808 INFO L225 Difference]: With dead ends: 15428 [2024-11-23 23:49:31,808 INFO L226 Difference]: Without dead ends: 10000 [2024-11-23 23:49:31,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=970, Invalid=4730, Unknown=0, NotChecked=0, Total=5700 [2024-11-23 23:49:31,816 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 1456 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 5718 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:31,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 5718 Invalid, 3894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 3413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-23 23:49:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10000 states. [2024-11-23 23:49:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10000 to 5864. [2024-11-23 23:49:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 4854 states have (on average 1.1679027606098062) internal successors, (5669), 4894 states have internal predecessors, (5669), 628 states have call successors, (628), 381 states have call predecessors, (628), 381 states have return successors, (628), 588 states have call predecessors, (628), 628 states have call successors, (628) [2024-11-23 23:49:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 6925 transitions. [2024-11-23 23:49:33,142 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 6925 transitions. Word has length 368 [2024-11-23 23:49:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:33,143 INFO L471 AbstractCegarLoop]: Abstraction has 5864 states and 6925 transitions. [2024-11-23 23:49:33,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.030303030303031) internal successors, (265), 27 states have internal predecessors, (265), 7 states have call successors, (45), 8 states have call predecessors, (45), 16 states have return successors, (48), 13 states have call predecessors, (48), 7 states have call successors, (48) [2024-11-23 23:49:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 6925 transitions. [2024-11-23 23:49:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-23 23:49:33,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:33,147 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:33,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-23 23:49:33,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:33,347 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:33,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -983614066, now seen corresponding path program 1 times [2024-11-23 23:49:33,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:33,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315607031] [2024-11-23 23:49:33,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 943 trivial. 0 not checked. [2024-11-23 23:49:33,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315607031] [2024-11-23 23:49:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315607031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:49:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:49:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:49:33,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956514653] [2024-11-23 23:49:33,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:49:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:49:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:33,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:49:33,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:49:33,608 INFO L87 Difference]: Start difference. First operand 5864 states and 6925 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:49:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:36,320 INFO L93 Difference]: Finished difference Result 13739 states and 16157 transitions. [2024-11-23 23:49:36,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-23 23:49:36,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 370 [2024-11-23 23:49:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:36,336 INFO L225 Difference]: With dead ends: 13739 [2024-11-23 23:49:36,336 INFO L226 Difference]: Without dead ends: 8483 [2024-11-23 23:49:36,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:49:36,343 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 317 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:36,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 2485 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:49:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8483 states. [2024-11-23 23:49:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8483 to 5804. [2024-11-23 23:49:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5804 states, 4804 states have (on average 1.1623646960865945) internal successors, (5584), 4844 states have internal predecessors, (5584), 618 states have call successors, (618), 381 states have call predecessors, (618), 381 states have return successors, (618), 578 states have call predecessors, (618), 618 states have call successors, (618) [2024-11-23 23:49:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 6820 transitions. [2024-11-23 23:49:37,566 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 6820 transitions. Word has length 370 [2024-11-23 23:49:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:37,566 INFO L471 AbstractCegarLoop]: Abstraction has 5804 states and 6820 transitions. [2024-11-23 23:49:37,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 8 states have internal predecessors, (128), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:49:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 6820 transitions. [2024-11-23 23:49:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-23 23:49:37,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:37,573 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:37,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-23 23:49:37,573 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:37,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1383462141, now seen corresponding path program 1 times [2024-11-23 23:49:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:37,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031591603] [2024-11-23 23:49:37,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:37,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 943 trivial. 0 not checked. [2024-11-23 23:49:37,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031591603] [2024-11-23 23:49:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031591603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:49:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087733421] [2024-11-23 23:49:37,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:37,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:37,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:49:37,861 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:49:37,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-23 23:49:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:38,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-23 23:49:38,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 332 proven. 42 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-23 23:49:38,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:49:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 76 proven. 28 refuted. 0 times theorem prover too weak. 866 trivial. 0 not checked. [2024-11-23 23:49:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087733421] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:49:39,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:49:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 31 [2024-11-23 23:49:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495268281] [2024-11-23 23:49:39,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:49:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-23 23:49:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:49:39,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-23 23:49:39,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2024-11-23 23:49:39,206 INFO L87 Difference]: Start difference. First operand 5804 states and 6820 transitions. Second operand has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 26 states have internal predecessors, (283), 7 states have call successors, (47), 6 states have call predecessors, (47), 13 states have return successors, (48), 12 states have call predecessors, (48), 7 states have call successors, (48) [2024-11-23 23:49:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:53,173 INFO L93 Difference]: Finished difference Result 23513 states and 27260 transitions. [2024-11-23 23:49:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2024-11-23 23:49:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 26 states have internal predecessors, (283), 7 states have call successors, (47), 6 states have call predecessors, (47), 13 states have return successors, (48), 12 states have call predecessors, (48), 7 states have call successors, (48) Word has length 371 [2024-11-23 23:49:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:53,213 INFO L225 Difference]: With dead ends: 23513 [2024-11-23 23:49:53,213 INFO L226 Difference]: Without dead ends: 20244 [2024-11-23 23:49:53,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8007 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2777, Invalid=21715, Unknown=0, NotChecked=0, Total=24492 [2024-11-23 23:49:53,221 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2001 mSDsluCounter, 8402 mSDsCounter, 0 mSdLazyCounter, 6341 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 8922 SdHoareTripleChecker+Invalid, 6857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 6341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:53,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2006 Valid, 8922 Invalid, 6857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [516 Valid, 6341 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-23 23:49:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20244 states. [2024-11-23 23:49:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20244 to 7210. [2024-11-23 23:49:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7210 states, 5958 states have (on average 1.152400134273246) internal successors, (6866), 6006 states have internal predecessors, (6866), 761 states have call successors, (761), 490 states have call predecessors, (761), 490 states have return successors, (761), 713 states have call predecessors, (761), 761 states have call successors, (761) [2024-11-23 23:49:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7210 states to 7210 states and 8388 transitions. [2024-11-23 23:49:55,068 INFO L78 Accepts]: Start accepts. Automaton has 7210 states and 8388 transitions. Word has length 371 [2024-11-23 23:49:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:55,068 INFO L471 AbstractCegarLoop]: Abstraction has 7210 states and 8388 transitions. [2024-11-23 23:49:55,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.129032258064516) internal successors, (283), 26 states have internal predecessors, (283), 7 states have call successors, (47), 6 states have call predecessors, (47), 13 states have return successors, (48), 12 states have call predecessors, (48), 7 states have call successors, (48) [2024-11-23 23:49:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7210 states and 8388 transitions. [2024-11-23 23:49:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-23 23:49:55,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:55,075 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:49:55,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-23 23:49:55,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:55,277 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1949995681, now seen corresponding path program 1 times [2024-11-23 23:49:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:49:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790693507] [2024-11-23 23:49:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:49:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 46 proven. 197 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-23 23:49:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:49:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790693507] [2024-11-23 23:49:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790693507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:49:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444340798] [2024-11-23 23:49:57,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:49:57,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:49:57,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:49:57,191 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:49:57,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-23 23:49:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:49:57,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-23 23:49:57,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 8 proven. 368 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-23 23:49:58,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-11-23 23:50:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444340798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:00,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 50 [2024-11-23 23:50:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118469506] [2024-11-23 23:50:00,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-23 23:50:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:50:00,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-23 23:50:00,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2024-11-23 23:50:00,279 INFO L87 Difference]: Start difference. First operand 7210 states and 8388 transitions. Second operand has 50 states, 49 states have (on average 8.510204081632653) internal successors, (417), 46 states have internal predecessors, (417), 19 states have call successors, (71), 10 states have call predecessors, (71), 14 states have return successors, (70), 21 states have call predecessors, (70), 19 states have call successors, (70) [2024-11-23 23:50:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:40,017 INFO L93 Difference]: Finished difference Result 33423 states and 38836 transitions. [2024-11-23 23:50:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2024-11-23 23:50:40,017 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 8.510204081632653) internal successors, (417), 46 states have internal predecessors, (417), 19 states have call successors, (71), 10 states have call predecessors, (71), 14 states have return successors, (70), 21 states have call predecessors, (70), 19 states have call successors, (70) Word has length 374 [2024-11-23 23:50:40,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:50:40,063 INFO L225 Difference]: With dead ends: 33423 [2024-11-23 23:50:40,063 INFO L226 Difference]: Without dead ends: 26891 [2024-11-23 23:50:40,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57562 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=11431, Invalid=135641, Unknown=0, NotChecked=0, Total=147072 [2024-11-23 23:50:40,078 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 3571 mSDsluCounter, 24650 mSDsCounter, 0 mSdLazyCounter, 21812 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3571 SdHoareTripleChecker+Valid, 25648 SdHoareTripleChecker+Invalid, 22846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 21812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:50:40,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3571 Valid, 25648 Invalid, 22846 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1034 Valid, 21812 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2024-11-23 23:50:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26891 states. [2024-11-23 23:50:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26891 to 11519. [2024-11-23 23:50:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 9525 states have (on average 1.152230971128609) internal successors, (10975), 9597 states have internal predecessors, (10975), 1200 states have call successors, (1200), 791 states have call predecessors, (1200), 793 states have return successors, (1204), 1130 states have call predecessors, (1204), 1200 states have call successors, (1204) [2024-11-23 23:50:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 13379 transitions. [2024-11-23 23:50:43,263 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 13379 transitions. Word has length 374 [2024-11-23 23:50:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:50:43,264 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 13379 transitions. [2024-11-23 23:50:43,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 8.510204081632653) internal successors, (417), 46 states have internal predecessors, (417), 19 states have call successors, (71), 10 states have call predecessors, (71), 14 states have return successors, (70), 21 states have call predecessors, (70), 19 states have call successors, (70) [2024-11-23 23:50:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 13379 transitions. [2024-11-23 23:50:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-23 23:50:43,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:50:43,276 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:50:43,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-23 23:50:43,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2024-11-23 23:50:43,477 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:50:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1942461980, now seen corresponding path program 1 times [2024-11-23 23:50:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:50:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133057973] [2024-11-23 23:50:43,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 9 proven. 134 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2024-11-23 23:50:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:50:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133057973] [2024-11-23 23:50:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133057973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:43,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620083965] [2024-11-23 23:50:43,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:43,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:43,581 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:43,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-23 23:50:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:43,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 23:50:43,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2024-11-23 23:50:43,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:50:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620083965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:50:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:50:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-23 23:50:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504460681] [2024-11-23 23:50:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:50:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:50:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:50:43,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:50:43,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:50:43,930 INFO L87 Difference]: Start difference. First operand 11519 states and 13379 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:50:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:46,879 INFO L93 Difference]: Finished difference Result 22428 states and 26077 transitions. [2024-11-23 23:50:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:50:46,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 378 [2024-11-23 23:50:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:50:46,902 INFO L225 Difference]: With dead ends: 22428 [2024-11-23 23:50:46,903 INFO L226 Difference]: Without dead ends: 10910 [2024-11-23 23:50:46,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:50:46,915 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 18 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:50:46,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 597 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:50:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10910 states. [2024-11-23 23:50:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10910 to 10910. [2024-11-23 23:50:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10910 states, 9020 states have (on average 1.1539911308203992) internal successors, (10409), 9083 states have internal predecessors, (10409), 1141 states have call successors, (1141), 748 states have call predecessors, (1141), 748 states have return successors, (1141), 1078 states have call predecessors, (1141), 1141 states have call successors, (1141) [2024-11-23 23:50:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10910 states to 10910 states and 12691 transitions. [2024-11-23 23:50:49,855 INFO L78 Accepts]: Start accepts. Automaton has 10910 states and 12691 transitions. Word has length 378 [2024-11-23 23:50:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:50:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 10910 states and 12691 transitions. [2024-11-23 23:50:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-23 23:50:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10910 states and 12691 transitions. [2024-11-23 23:50:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-23 23:50:49,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:50:49,865 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:50:49,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-23 23:50:50,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2024-11-23 23:50:50,066 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:50:50,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -94085307, now seen corresponding path program 1 times [2024-11-23 23:50:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:50:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993730572] [2024-11-23 23:50:50,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:50:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-11-23 23:50:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:50:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993730572] [2024-11-23 23:50:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993730572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:50:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430770948] [2024-11-23 23:50:51,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:50:51,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:50:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:50:51,099 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:50:51,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-23 23:50:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:50:51,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-23 23:50:51,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:50:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 4 proven. 436 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2024-11-23 23:50:52,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2024-11-23 23:50:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430770948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:50:53,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:50:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 28 [2024-11-23 23:50:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923805920] [2024-11-23 23:50:53,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:50:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-23 23:50:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:50:53,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-23 23:50:53,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2024-11-23 23:50:53,485 INFO L87 Difference]: Start difference. First operand 10910 states and 12691 transitions. Second operand has 28 states, 28 states have (on average 12.964285714285714) internal successors, (363), 27 states have internal predecessors, (363), 15 states have call successors, (66), 8 states have call predecessors, (66), 7 states have return successors, (65), 15 states have call predecessors, (65), 14 states have call successors, (65) [2024-11-23 23:51:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:20,051 INFO L93 Difference]: Finished difference Result 56010 states and 65251 transitions. [2024-11-23 23:51:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2024-11-23 23:51:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.964285714285714) internal successors, (363), 27 states have internal predecessors, (363), 15 states have call successors, (66), 8 states have call predecessors, (66), 7 states have return successors, (65), 15 states have call predecessors, (65), 14 states have call successors, (65) Word has length 385 [2024-11-23 23:51:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:51:20,134 INFO L225 Difference]: With dead ends: 56010 [2024-11-23 23:51:20,134 INFO L226 Difference]: Without dead ends: 50656 [2024-11-23 23:51:20,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14415 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=6226, Invalid=33176, Unknown=0, NotChecked=0, Total=39402 [2024-11-23 23:51:20,152 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 1506 mSDsluCounter, 7800 mSDsCounter, 0 mSdLazyCounter, 4276 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 8670 SdHoareTripleChecker+Invalid, 4587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 4276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:51:20,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 8670 Invalid, 4587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 4276 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-23 23:51:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50656 states. [2024-11-23 23:51:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50656 to 14170. [2024-11-23 23:51:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14170 states, 11691 states have (on average 1.1552476263792661) internal successors, (13506), 11781 states have internal predecessors, (13506), 1507 states have call successors, (1507), 971 states have call predecessors, (1507), 971 states have return successors, (1507), 1417 states have call predecessors, (1507), 1507 states have call successors, (1507) [2024-11-23 23:51:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14170 states to 14170 states and 16520 transitions. [2024-11-23 23:51:24,597 INFO L78 Accepts]: Start accepts. Automaton has 14170 states and 16520 transitions. Word has length 385 [2024-11-23 23:51:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:51:24,597 INFO L471 AbstractCegarLoop]: Abstraction has 14170 states and 16520 transitions. [2024-11-23 23:51:24,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.964285714285714) internal successors, (363), 27 states have internal predecessors, (363), 15 states have call successors, (66), 8 states have call predecessors, (66), 7 states have return successors, (65), 15 states have call predecessors, (65), 14 states have call successors, (65) [2024-11-23 23:51:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14170 states and 16520 transitions. [2024-11-23 23:51:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-23 23:51:24,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:51:24,610 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:51:24,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-23 23:51:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2024-11-23 23:51:24,811 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:51:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1882515404, now seen corresponding path program 1 times [2024-11-23 23:51:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:51:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887406450] [2024-11-23 23:51:24,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1034 trivial. 0 not checked. [2024-11-23 23:51:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:51:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887406450] [2024-11-23 23:51:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887406450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:51:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:51:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 23:51:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625056424] [2024-11-23 23:51:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:51:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:51:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:51:24,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:51:24,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:51:24,992 INFO L87 Difference]: Start difference. First operand 14170 states and 16520 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:51:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:28,876 INFO L93 Difference]: Finished difference Result 21140 states and 24720 transitions. [2024-11-23 23:51:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:51:28,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 385 [2024-11-23 23:51:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:51:28,905 INFO L225 Difference]: With dead ends: 21140 [2024-11-23 23:51:28,905 INFO L226 Difference]: Without dead ends: 14170 [2024-11-23 23:51:28,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:51:28,915 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 23:51:28,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 622 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:51:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14170 states. [2024-11-23 23:51:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14170 to 14160. [2024-11-23 23:51:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14160 states, 11681 states have (on average 1.1519561681362898) internal successors, (13456), 11771 states have internal predecessors, (13456), 1507 states have call successors, (1507), 971 states have call predecessors, (1507), 971 states have return successors, (1507), 1417 states have call predecessors, (1507), 1507 states have call successors, (1507) [2024-11-23 23:51:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14160 states to 14160 states and 16470 transitions. [2024-11-23 23:51:33,322 INFO L78 Accepts]: Start accepts. Automaton has 14160 states and 16470 transitions. Word has length 385 [2024-11-23 23:51:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:51:33,322 INFO L471 AbstractCegarLoop]: Abstraction has 14160 states and 16470 transitions. [2024-11-23 23:51:33,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-23 23:51:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14160 states and 16470 transitions. [2024-11-23 23:51:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-23 23:51:33,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:51:33,331 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:51:33,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-23 23:51:33,331 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:51:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2019424882, now seen corresponding path program 1 times [2024-11-23 23:51:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:51:33,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988737124] [2024-11-23 23:51:33,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:33,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2024-11-23 23:51:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:51:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988737124] [2024-11-23 23:51:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988737124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:51:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:51:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 23:51:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141270637] [2024-11-23 23:51:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:51:33,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-23 23:51:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:51:33,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-23 23:51:33,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-23 23:51:33,563 INFO L87 Difference]: Start difference. First operand 14160 states and 16470 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-23 23:51:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:39,889 INFO L93 Difference]: Finished difference Result 27016 states and 31358 transitions. [2024-11-23 23:51:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:51:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 385 [2024-11-23 23:51:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:51:39,924 INFO L225 Difference]: With dead ends: 27016 [2024-11-23 23:51:39,924 INFO L226 Difference]: Without dead ends: 20006 [2024-11-23 23:51:39,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-11-23 23:51:39,934 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 295 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:51:39,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2205 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 23:51:39,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20006 states. [2024-11-23 23:51:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20006 to 14060. [2024-11-23 23:51:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14060 states, 11581 states have (on average 1.1480873845091097) internal successors, (13296), 11671 states have internal predecessors, (13296), 1507 states have call successors, (1507), 971 states have call predecessors, (1507), 971 states have return successors, (1507), 1417 states have call predecessors, (1507), 1507 states have call successors, (1507) [2024-11-23 23:51:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14060 states to 14060 states and 16310 transitions. [2024-11-23 23:51:44,084 INFO L78 Accepts]: Start accepts. Automaton has 14060 states and 16310 transitions. Word has length 385 [2024-11-23 23:51:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:51:44,084 INFO L471 AbstractCegarLoop]: Abstraction has 14060 states and 16310 transitions. [2024-11-23 23:51:44,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-23 23:51:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 14060 states and 16310 transitions. [2024-11-23 23:51:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-23 23:51:44,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:51:44,093 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:51:44,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-23 23:51:44,093 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:51:44,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:51:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1032317006, now seen corresponding path program 1 times [2024-11-23 23:51:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:51:44,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175000559] [2024-11-23 23:51:44,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:51:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 100 proven. 177 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-11-23 23:51:45,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:51:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175000559] [2024-11-23 23:51:45,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175000559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:51:45,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289011890] [2024-11-23 23:51:45,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:51:45,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:51:45,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:51:45,741 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:51:45,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-23 23:51:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:51:46,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1412 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-23 23:51:46,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:51:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 513 proven. 186 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-23 23:51:46,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:51:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 97 proven. 174 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2024-11-23 23:51:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289011890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:51:47,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:51:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2024-11-23 23:51:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146684195] [2024-11-23 23:51:47,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:51:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-23 23:51:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:51:47,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-23 23:51:47,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2024-11-23 23:51:47,798 INFO L87 Difference]: Start difference. First operand 14060 states and 16310 transitions. Second operand has 44 states, 44 states have (on average 8.272727272727273) internal successors, (364), 37 states have internal predecessors, (364), 15 states have call successors, (61), 9 states have call predecessors, (61), 20 states have return successors, (64), 19 states have call predecessors, (64), 15 states have call successors, (64) [2024-11-23 23:51:56,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:51:56,462 INFO L93 Difference]: Finished difference Result 28305 states and 32835 transitions. [2024-11-23 23:51:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-23 23:51:56,462 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 8.272727272727273) internal successors, (364), 37 states have internal predecessors, (364), 15 states have call successors, (61), 9 states have call predecessors, (61), 20 states have return successors, (64), 19 states have call predecessors, (64), 15 states have call successors, (64) Word has length 385 [2024-11-23 23:51:56,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:51:56,490 INFO L225 Difference]: With dead ends: 28305 [2024-11-23 23:51:56,490 INFO L226 Difference]: Without dead ends: 14938 [2024-11-23 23:51:56,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=999, Invalid=7191, Unknown=0, NotChecked=0, Total=8190 [2024-11-23 23:51:56,502 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1580 mSDsluCounter, 5820 mSDsCounter, 0 mSdLazyCounter, 4193 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 6076 SdHoareTripleChecker+Invalid, 4676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 4193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-23 23:51:56,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 6076 Invalid, 4676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 4193 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-23 23:51:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14938 states. [2024-11-23 23:52:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14938 to 13787. [2024-11-23 23:52:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13787 states, 11307 states have (on average 1.1429203148492084) internal successors, (12923), 11397 states have internal predecessors, (12923), 1507 states have call successors, (1507), 972 states have call predecessors, (1507), 972 states have return successors, (1507), 1417 states have call predecessors, (1507), 1507 states have call successors, (1507) [2024-11-23 23:52:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 15937 transitions. [2024-11-23 23:52:00,590 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 15937 transitions. Word has length 385 [2024-11-23 23:52:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:00,590 INFO L471 AbstractCegarLoop]: Abstraction has 13787 states and 15937 transitions. [2024-11-23 23:52:00,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 8.272727272727273) internal successors, (364), 37 states have internal predecessors, (364), 15 states have call successors, (61), 9 states have call predecessors, (61), 20 states have return successors, (64), 19 states have call predecessors, (64), 15 states have call successors, (64) [2024-11-23 23:52:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 15937 transitions. [2024-11-23 23:52:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-11-23 23:52:00,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:00,599 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:00,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:00,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:00,800 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1855792453, now seen corresponding path program 1 times [2024-11-23 23:52:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792490774] [2024-11-23 23:52:00,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 151 proven. 133 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2024-11-23 23:52:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:52:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792490774] [2024-11-23 23:52:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792490774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:52:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795575573] [2024-11-23 23:52:02,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:52:02,504 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:52:02,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-23 23:52:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:52:02,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-23 23:52:02,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:52:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 518 proven. 186 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-23 23:52:03,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:52:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1115 backedges. 153 proven. 125 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-23 23:52:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795575573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:04,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:52:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 40 [2024-11-23 23:52:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74022304] [2024-11-23 23:52:04,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:04,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-23 23:52:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:52:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-23 23:52:04,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2024-11-23 23:52:04,514 INFO L87 Difference]: Start difference. First operand 13787 states and 15937 transitions. Second operand has 40 states, 40 states have (on average 9.125) internal successors, (365), 34 states have internal predecessors, (365), 14 states have call successors, (62), 7 states have call predecessors, (62), 18 states have return successors, (65), 19 states have call predecessors, (65), 14 states have call successors, (65) [2024-11-23 23:52:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:52:11,610 INFO L93 Difference]: Finished difference Result 26768 states and 30981 transitions. [2024-11-23 23:52:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-23 23:52:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 9.125) internal successors, (365), 34 states have internal predecessors, (365), 14 states have call successors, (62), 7 states have call predecessors, (62), 18 states have return successors, (65), 19 states have call predecessors, (65), 14 states have call successors, (65) Word has length 396 [2024-11-23 23:52:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:52:11,640 INFO L225 Difference]: With dead ends: 26768 [2024-11-23 23:52:11,641 INFO L226 Difference]: Without dead ends: 13796 [2024-11-23 23:52:11,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=634, Invalid=4336, Unknown=0, NotChecked=0, Total=4970 [2024-11-23 23:52:11,652 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1284 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 3767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:52:11,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 3987 Invalid, 3767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-23 23:52:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13796 states. [2024-11-23 23:52:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13796 to 13794. [2024-11-23 23:52:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13794 states, 11313 states have (on average 1.1419605763281182) internal successors, (12919), 11403 states have internal predecessors, (12919), 1507 states have call successors, (1507), 973 states have call predecessors, (1507), 973 states have return successors, (1507), 1417 states have call predecessors, (1507), 1507 states have call successors, (1507) [2024-11-23 23:52:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13794 states to 13794 states and 15933 transitions. [2024-11-23 23:52:15,831 INFO L78 Accepts]: Start accepts. Automaton has 13794 states and 15933 transitions. Word has length 396 [2024-11-23 23:52:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:52:15,831 INFO L471 AbstractCegarLoop]: Abstraction has 13794 states and 15933 transitions. [2024-11-23 23:52:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.125) internal successors, (365), 34 states have internal predecessors, (365), 14 states have call successors, (62), 7 states have call predecessors, (62), 18 states have return successors, (65), 19 states have call predecessors, (65), 14 states have call successors, (65) [2024-11-23 23:52:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 13794 states and 15933 transitions. [2024-11-23 23:52:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-11-23 23:52:15,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:52:15,847 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-23 23:52:15,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-23 23:52:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:52:16,047 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:52:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:52:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1379038404, now seen corresponding path program 1 times [2024-11-23 23:52:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:52:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305509119] [2024-11-23 23:52:16,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:52:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:52:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:16,175 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:52:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:52:16,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:52:16,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:52:16,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:52:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-23 23:52:16,517 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:52:16,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:52:16,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:52:16 BoogieIcfgContainer [2024-11-23 23:52:16,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:52:16,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:52:16,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:52:16,845 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:52:16,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:19" (3/4) ... [2024-11-23 23:52:16,846 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 23:52:17,196 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 301. [2024-11-23 23:52:17,422 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 23:52:17,422 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 23:52:17,423 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:52:17,423 INFO L158 Benchmark]: Toolchain (without parser) took 299509.34ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 103.8MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-23 23:52:17,423 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 87.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.91ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: Boogie Preprocessor took 89.17ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 80.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: RCFGBuilder took 913.99ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 43.6MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: TraceAbstraction took 297487.96ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 42.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 971.6MB. Max. memory is 16.1GB. [2024-11-23 23:52:17,424 INFO L158 Benchmark]: Witness Printer took 581.32ms. Allocated memory is still 4.0GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-23 23:52:17,425 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.71ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.25ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 87.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.91ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 84.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.17ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 80.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 913.99ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 43.6MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 297487.96ms. Allocated memory was 142.6MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 42.9MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 971.6MB. Max. memory is 16.1GB. * Witness Printer took 581.32ms. Allocated memory is still 4.0GB. Free memory was 3.0GB in the beginning and 2.9GB in the end (delta: 71.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L472] int c1 ; [L473] int i2 ; [L476] c1 = 0 [L477] gate1Failed = __VERIFIER_nondet_bool() [L478] gate2Failed = __VERIFIER_nondet_bool() [L479] gate3Failed = __VERIFIER_nondet_bool() [L480] VALUE1 = __VERIFIER_nondet_char() [L481] VALUE2 = __VERIFIER_nondet_char() [L482] VALUE3 = __VERIFIER_nondet_char() [L483] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L484] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L485] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L486] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L487] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L488] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L489] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L490] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L491] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L492] votedValue_History_0 = __VERIFIER_nondet_char() [L493] votedValue_History_1 = __VERIFIER_nondet_char() [L494] votedValue_History_2 = __VERIFIER_nondet_char() [L495] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, historyIndex=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L495] RET, EXPR init() [L495] i2 = init() [L496] COND FALSE !(!(i2)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L497] g1v_old = nomsg [L498] g1v_new = nomsg [L499] g2v_old = nomsg [L500] g2v_new = nomsg [L501] g3v_old = nomsg [L502] g3v_new = nomsg [L503] i2 = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L504] COND TRUE i2 < 10 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L506] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L351] COND FALSE !((int )next_state == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L354] COND TRUE (int )next_state == 1 [L355] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=1, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L506] RET gate1_each_pals_period() [L507] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=1, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=1, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=1, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND FALSE !(\read(gate2Failed)) [L380] tmp = __VERIFIER_nondet_char() [L381] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L382] COND TRUE (int )next_state == 0 [L383] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L393] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L394] g2v_new = next_state != nomsg && g2v_new == nomsg ? next_state : g2v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L507] RET gate2_each_pals_period() [L508] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=2, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=2, buf=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=1, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=1, \old(history_id)=2, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] RET gate3_each_pals_period() [L509] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L442] COND TRUE (int )VALUE1 == (int )nomsg [L443] voted_value = VALUE3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L466] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=1, g1v_old=-1, g2v=0, g2v_new=0, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L466] RET write_history_int8(3, voted_value) [L509] RET voter() [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L516] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=3, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=3, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L529] COND FALSE !(! arg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L517] RET assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L518] i2 ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L504] COND TRUE i2 < 10 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, i2=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L506] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=1, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=1, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, next_state=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L506] RET gate1_each_pals_period() [L507] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L507] RET gate2_each_pals_period() [L508] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=1, g2v=0, g2v_new=-1, g2v_old=0, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] RET gate3_each_pals_period() [L509] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L441] COND FALSE !((int )VALUE1 == (int )VALUE2) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L448] COND FALSE !((int )VALUE1 == (int )VALUE3) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L455] COND TRUE (int )VALUE1 != (int )nomsg [L456] voted_value = VALUE1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=1] [L466] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L466] RET write_history_int8(3, voted_value) [L509] RET voter() [L510] g1v_old = g1v_new [L511] g1v_new = nomsg [L512] g2v_old = g2v_new [L513] g2v_new = nomsg [L514] g3v_old = g3v_new [L515] g3v_new = nomsg [L516] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=0, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND FALSE !((int )VALUE2 == (int )tmp___1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND FALSE !((int )VALUE3 == (int )tmp___2) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L280] COND TRUE (int )VALUE1 != (int )VALUE2 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L281] COND TRUE (int )VALUE1 != (int )VALUE3 VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L282] COND FALSE !((int )VALUE2 != (int )VALUE3) VAL [VALUE1=1, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, temp_count=1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L294] COND TRUE ! (temp_count > 1) [L295] return (0); VAL [VALUE1=1, VALUE2=0, VALUE3=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L529] COND TRUE ! arg VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] [L531] reach_error() VAL [VALUE1=1, VALUE2=0, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 297.1s, OverallIterations: 63, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 192.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37266 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37072 mSDsluCounter, 170763 SdHoareTripleChecker+Invalid, 45.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148892 mSDsCounter, 8884 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76190 IncrementalHoareTripleChecker+Invalid, 85074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8884 mSolverCounterUnsat, 21871 mSDtfsCounter, 76190 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13955 GetRequests, 11648 SyntacticMatches, 15 SemanticMatches, 2292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192758 ImplicationChecksByTransitivity, 63.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14170occurred in iteration=58, InterpolantAutomatonStates: 2045, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.3s AutomataMinimizationTime, 62 MinimizatonAttempts, 159295 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 23166 NumberOfCodeBlocks, 23125 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 27207 ConstructedInterpolants, 0 QuantifiedInterpolants, 56528 SizeOfPredicates, 63 NumberOfNonLiveVariables, 25149 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 98 InterpolantComputations, 49 PerfectInterpolantSequences, 66632/69957 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 23:52:17,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a9101115-2927-4ca5-a7f0-6b86ae63d554/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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