./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4996a252ab084c920e1b9a19c3119ce328d4cb97d6d45029062c9dac50449e19 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:50:19,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:50:19,103 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:50:19,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:50:19,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:50:19,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:50:19,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:50:19,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:50:19,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:50:19,133 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:50:19,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:50:19,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:50:19,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:50:19,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:50:19,136 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:50:19,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:50:19,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:50:19,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:50:19,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:50:19,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:50:19,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:50:19,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:50:19,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:50:19,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:50:19,141 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:50:19,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:50:19,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:50:19,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:50:19,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:50:19,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:50:19,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:50:19,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:50:19,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:50:19,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:50:19,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:50:19,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:50:19,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:50:19,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:50:19,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:50:19,146 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:50:19,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:50:19,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:50:19,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4996a252ab084c920e1b9a19c3119ce328d4cb97d6d45029062c9dac50449e19 [2023-11-29 03:50:19,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:50:19,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:50:19,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:50:19,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:50:19,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:50:19,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2023-11-29 03:50:22,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:50:22,360 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:50:22,361 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2023-11-29 03:50:22,372 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/data/67d735176/3398c14ffb2e4d8ab03b899f2a8ad8c4/FLAG635edfc86 [2023-11-29 03:50:22,383 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/data/67d735176/3398c14ffb2e4d8ab03b899f2a8ad8c4 [2023-11-29 03:50:22,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:50:22,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:50:22,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:50:22,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:50:22,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:50:22,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57793f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22, skipping insertion in model container [2023-11-29 03:50:22,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:50:22,548 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[671,684] [2023-11-29 03:50:22,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:50:22,618 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:50:22,628 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[671,684] [2023-11-29 03:50:22,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:50:22,677 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:50:22,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22 WrapperNode [2023-11-29 03:50:22,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:50:22,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:50:22,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:50:22,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:50:22,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,728 INFO L138 Inliner]: procedures = 34, calls = 40, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 339 [2023-11-29 03:50:22,728 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:50:22,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:50:22,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:50:22,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:50:22,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 03:50:22,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:50:22,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:50:22,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:50:22,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:50:22,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (1/1) ... [2023-11-29 03:50:22,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:50:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:22,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:50:22,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:50:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:50:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 03:50:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 03:50:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 03:50:22,856 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 03:50:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 03:50:22,856 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 03:50:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 03:50:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 03:50:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 03:50:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 03:50:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:50:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 03:50:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 03:50:22,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:50:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:50:22,934 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:50:22,937 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:50:23,290 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:50:23,331 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:50:23,331 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 03:50:23,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:23 BoogieIcfgContainer [2023-11-29 03:50:23,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:50:23,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:50:23,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:50:23,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:50:23,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:50:22" (1/3) ... [2023-11-29 03:50:23,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c63201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:23, skipping insertion in model container [2023-11-29 03:50:23,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:50:22" (2/3) ... [2023-11-29 03:50:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c63201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:50:23, skipping insertion in model container [2023-11-29 03:50:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:23" (3/3) ... [2023-11-29 03:50:23,340 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2023-11-29 03:50:23,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:50:23,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:50:23,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:50:23,407 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2981dd93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:50:23,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:50:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 118 states have internal predecessors, (194), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 03:50:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:23,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:23,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:23,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:23,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash -806991754, now seen corresponding path program 1 times [2023-11-29 03:50:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820744646] [2023-11-29 03:50:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820744646] [2023-11-29 03:50:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820744646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:50:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576794290] [2023-11-29 03:50:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:23,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:50:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:50:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:50:23,821 INFO L87 Difference]: Start difference. First operand has 141 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 118 states have internal predecessors, (194), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:24,539 INFO L93 Difference]: Finished difference Result 316 states and 517 transitions. [2023-11-29 03:50:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:50:24,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:24,553 INFO L225 Difference]: With dead ends: 316 [2023-11-29 03:50:24,554 INFO L226 Difference]: Without dead ends: 179 [2023-11-29 03:50:24,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:50:24,561 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 338 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:24,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 256 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-29 03:50:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2023-11-29 03:50:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 115 states have (on average 1.5478260869565217) internal successors, (178), 116 states have internal predecessors, (178), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 03:50:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2023-11-29 03:50:24,623 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 70 [2023-11-29 03:50:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:24,623 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2023-11-29 03:50:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2023-11-29 03:50:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:24,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:24,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:50:24,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:24,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash -389595148, now seen corresponding path program 1 times [2023-11-29 03:50:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799225425] [2023-11-29 03:50:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799225425] [2023-11-29 03:50:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799225425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402306368] [2023-11-29 03:50:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:24,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:24,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:24,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:24,861 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:25,859 INFO L93 Difference]: Finished difference Result 480 states and 752 transitions. [2023-11-29 03:50:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:25,866 INFO L225 Difference]: With dead ends: 480 [2023-11-29 03:50:25,866 INFO L226 Difference]: Without dead ends: 350 [2023-11-29 03:50:25,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:25,869 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 502 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:25,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 421 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:50:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-29 03:50:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 271. [2023-11-29 03:50:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 228 states have (on average 1.5570175438596492) internal successors, (355), 230 states have internal predecessors, (355), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2023-11-29 03:50:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2023-11-29 03:50:25,914 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 70 [2023-11-29 03:50:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:25,915 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2023-11-29 03:50:25,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2023-11-29 03:50:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:25,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:25,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:25,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:50:25,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:25,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash 311653240, now seen corresponding path program 1 times [2023-11-29 03:50:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310994279] [2023-11-29 03:50:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310994279] [2023-11-29 03:50:26,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310994279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:26,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797237826] [2023-11-29 03:50:26,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:26,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:26,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:26,127 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:27,420 INFO L93 Difference]: Finished difference Result 787 states and 1228 transitions. [2023-11-29 03:50:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:50:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:27,426 INFO L225 Difference]: With dead ends: 787 [2023-11-29 03:50:27,426 INFO L226 Difference]: Without dead ends: 525 [2023-11-29 03:50:27,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:50:27,429 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 509 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:27,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 781 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:50:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-29 03:50:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 395. [2023-11-29 03:50:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 333 states have (on average 1.5495495495495495) internal successors, (516), 336 states have internal predecessors, (516), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2023-11-29 03:50:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions. [2023-11-29 03:50:27,470 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 70 [2023-11-29 03:50:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:27,470 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 603 transitions. [2023-11-29 03:50:27,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions. [2023-11-29 03:50:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:27,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:27,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:27,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:50:27,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:27,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:27,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1572570490, now seen corresponding path program 1 times [2023-11-29 03:50:27,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:27,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992555204] [2023-11-29 03:50:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:27,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992555204] [2023-11-29 03:50:27,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992555204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:27,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849452329] [2023-11-29 03:50:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:27,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:27,637 INFO L87 Difference]: Start difference. First operand 395 states and 603 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:28,291 INFO L93 Difference]: Finished difference Result 911 states and 1419 transitions. [2023-11-29 03:50:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:28,296 INFO L225 Difference]: With dead ends: 911 [2023-11-29 03:50:28,296 INFO L226 Difference]: Without dead ends: 525 [2023-11-29 03:50:28,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:28,299 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 376 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:28,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 389 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:50:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-29 03:50:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 395. [2023-11-29 03:50:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 333 states have (on average 1.5405405405405406) internal successors, (513), 336 states have internal predecessors, (513), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2023-11-29 03:50:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 600 transitions. [2023-11-29 03:50:28,339 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 600 transitions. Word has length 70 [2023-11-29 03:50:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:28,339 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 600 transitions. [2023-11-29 03:50:28,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 600 transitions. [2023-11-29 03:50:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:28,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:28,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:28,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:50:28,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:28,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1613245240, now seen corresponding path program 1 times [2023-11-29 03:50:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763350837] [2023-11-29 03:50:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763350837] [2023-11-29 03:50:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763350837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830513490] [2023-11-29 03:50:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:28,494 INFO L87 Difference]: Start difference. First operand 395 states and 600 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:29,785 INFO L93 Difference]: Finished difference Result 1318 states and 2031 transitions. [2023-11-29 03:50:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:50:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:29,792 INFO L225 Difference]: With dead ends: 1318 [2023-11-29 03:50:29,792 INFO L226 Difference]: Without dead ends: 932 [2023-11-29 03:50:29,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:29,795 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 616 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:29,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 772 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:50:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2023-11-29 03:50:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 645. [2023-11-29 03:50:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 547 states have (on average 1.5356489945155394) internal successors, (840), 552 states have internal predecessors, (840), 63 states have call successors, (63), 30 states have call predecessors, (63), 34 states have return successors, (76), 66 states have call predecessors, (76), 63 states have call successors, (76) [2023-11-29 03:50:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 979 transitions. [2023-11-29 03:50:29,872 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 979 transitions. Word has length 70 [2023-11-29 03:50:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:29,872 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 979 transitions. [2023-11-29 03:50:29,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 979 transitions. [2023-11-29 03:50:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:29,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:29,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:50:29,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:29,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1294936646, now seen corresponding path program 1 times [2023-11-29 03:50:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384987224] [2023-11-29 03:50:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384987224] [2023-11-29 03:50:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384987224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:30,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561693289] [2023-11-29 03:50:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:30,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:30,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:30,023 INFO L87 Difference]: Start difference. First operand 645 states and 979 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:31,396 INFO L93 Difference]: Finished difference Result 2220 states and 3408 transitions. [2023-11-29 03:50:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:50:31,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:31,405 INFO L225 Difference]: With dead ends: 2220 [2023-11-29 03:50:31,405 INFO L226 Difference]: Without dead ends: 1584 [2023-11-29 03:50:31,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:31,408 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 515 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:31,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 768 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:50:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2023-11-29 03:50:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1122. [2023-11-29 03:50:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 954 states have (on average 1.530398322851153) internal successors, (1460), 963 states have internal predecessors, (1460), 105 states have call successors, (105), 54 states have call predecessors, (105), 62 states have return successors, (140), 112 states have call predecessors, (140), 105 states have call successors, (140) [2023-11-29 03:50:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1705 transitions. [2023-11-29 03:50:31,480 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1705 transitions. Word has length 70 [2023-11-29 03:50:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:31,480 INFO L495 AbstractCegarLoop]: Abstraction has 1122 states and 1705 transitions. [2023-11-29 03:50:31,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1705 transitions. [2023-11-29 03:50:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:31,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:31,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:31,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:50:31,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:31,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -418917640, now seen corresponding path program 1 times [2023-11-29 03:50:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:31,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323205828] [2023-11-29 03:50:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323205828] [2023-11-29 03:50:31,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323205828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:31,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596236644] [2023-11-29 03:50:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:31,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:31,595 INFO L87 Difference]: Start difference. First operand 1122 states and 1705 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:32,185 INFO L93 Difference]: Finished difference Result 2529 states and 3892 transitions. [2023-11-29 03:50:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:50:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:32,193 INFO L225 Difference]: With dead ends: 2529 [2023-11-29 03:50:32,193 INFO L226 Difference]: Without dead ends: 1416 [2023-11-29 03:50:32,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:50:32,197 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 433 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:32,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 323 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:50:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2023-11-29 03:50:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1122. [2023-11-29 03:50:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 954 states have (on average 1.520964360587002) internal successors, (1451), 963 states have internal predecessors, (1451), 105 states have call successors, (105), 54 states have call predecessors, (105), 62 states have return successors, (140), 112 states have call predecessors, (140), 105 states have call successors, (140) [2023-11-29 03:50:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1696 transitions. [2023-11-29 03:50:32,259 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1696 transitions. Word has length 70 [2023-11-29 03:50:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:32,260 INFO L495 AbstractCegarLoop]: Abstraction has 1122 states and 1696 transitions. [2023-11-29 03:50:32,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1696 transitions. [2023-11-29 03:50:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:32,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:32,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:32,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:50:32,263 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:32,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 24983034, now seen corresponding path program 1 times [2023-11-29 03:50:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663538148] [2023-11-29 03:50:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663538148] [2023-11-29 03:50:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663538148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:50:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051394416] [2023-11-29 03:50:32,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:32,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:50:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:50:32,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:32,383 INFO L87 Difference]: Start difference. First operand 1122 states and 1696 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:33,617 INFO L93 Difference]: Finished difference Result 3801 states and 5776 transitions. [2023-11-29 03:50:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:50:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:33,632 INFO L225 Difference]: With dead ends: 3801 [2023-11-29 03:50:33,632 INFO L226 Difference]: Without dead ends: 2688 [2023-11-29 03:50:33,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:50:33,637 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 499 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:33,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 772 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:50:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2023-11-29 03:50:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2104. [2023-11-29 03:50:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 1800 states have (on average 1.5172222222222222) internal successors, (2731), 1817 states have internal predecessors, (2731), 185 states have call successors, (185), 102 states have call predecessors, (185), 118 states have return successors, (282), 200 states have call predecessors, (282), 185 states have call successors, (282) [2023-11-29 03:50:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3198 transitions. [2023-11-29 03:50:33,776 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 3198 transitions. Word has length 70 [2023-11-29 03:50:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:33,777 INFO L495 AbstractCegarLoop]: Abstraction has 2104 states and 3198 transitions. [2023-11-29 03:50:33,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 3198 transitions. [2023-11-29 03:50:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 03:50:33,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:33,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:33,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:50:33,779 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:33,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1563323064, now seen corresponding path program 1 times [2023-11-29 03:50:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150750232] [2023-11-29 03:50:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:50:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150750232] [2023-11-29 03:50:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150750232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:50:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:50:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041227751] [2023-11-29 03:50:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:50:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:50:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:50:33,865 INFO L87 Difference]: Start difference. First operand 2104 states and 3198 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:34,985 INFO L93 Difference]: Finished difference Result 6005 states and 9182 transitions. [2023-11-29 03:50:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:50:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 70 [2023-11-29 03:50:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:35,011 INFO L225 Difference]: With dead ends: 6005 [2023-11-29 03:50:35,011 INFO L226 Difference]: Without dead ends: 3911 [2023-11-29 03:50:35,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:50:35,021 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 646 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:35,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 585 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:50:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2023-11-29 03:50:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3190. [2023-11-29 03:50:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3190 states, 2723 states have (on average 1.5042232831435915) internal successors, (4096), 2757 states have internal predecessors, (4096), 286 states have call successors, (286), 156 states have call predecessors, (286), 180 states have return successors, (411), 292 states have call predecessors, (411), 286 states have call successors, (411) [2023-11-29 03:50:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4793 transitions. [2023-11-29 03:50:35,263 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4793 transitions. Word has length 70 [2023-11-29 03:50:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:35,264 INFO L495 AbstractCegarLoop]: Abstraction has 3190 states and 4793 transitions. [2023-11-29 03:50:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 03:50:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4793 transitions. [2023-11-29 03:50:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:50:35,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:35,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:35,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:50:35,274 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:35,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1754191787, now seen corresponding path program 1 times [2023-11-29 03:50:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276924607] [2023-11-29 03:50:35,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:35,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:50:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:50:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:50:35,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276924607] [2023-11-29 03:50:35,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276924607] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300191791] [2023-11-29 03:50:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:35,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:35,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:35,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:50:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:35,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:35,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:50:35,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300191791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 03:50:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888404189] [2023-11-29 03:50:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:35,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:35,611 INFO L87 Difference]: Start difference. First operand 3190 states and 4793 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:35,904 INFO L93 Difference]: Finished difference Result 9469 states and 14323 transitions. [2023-11-29 03:50:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 114 [2023-11-29 03:50:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:35,933 INFO L225 Difference]: With dead ends: 9469 [2023-11-29 03:50:35,933 INFO L226 Difference]: Without dead ends: 6289 [2023-11-29 03:50:35,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:35,943 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 168 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:35,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 400 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6289 states. [2023-11-29 03:50:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6289 to 6261. [2023-11-29 03:50:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6261 states, 5346 states have (on average 1.4985035540591096) internal successors, (8011), 5413 states have internal predecessors, (8011), 554 states have call successors, (554), 312 states have call predecessors, (554), 360 states have return successors, (789), 551 states have call predecessors, (789), 554 states have call successors, (789) [2023-11-29 03:50:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6261 states to 6261 states and 9354 transitions. [2023-11-29 03:50:36,246 INFO L78 Accepts]: Start accepts. Automaton has 6261 states and 9354 transitions. Word has length 114 [2023-11-29 03:50:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:36,247 INFO L495 AbstractCegarLoop]: Abstraction has 6261 states and 9354 transitions. [2023-11-29 03:50:36,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6261 states and 9354 transitions. [2023-11-29 03:50:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:50:36,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:36,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:36,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:36,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:50:36,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:36,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1637627949, now seen corresponding path program 1 times [2023-11-29 03:50:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439857458] [2023-11-29 03:50:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:50:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:50:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:50:36,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:36,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439857458] [2023-11-29 03:50:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439857458] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43292549] [2023-11-29 03:50:36,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:36,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:36,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:36,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:36,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:50:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:36,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:36,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 03:50:36,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43292549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:36,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 03:50:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84048000] [2023-11-29 03:50:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:36,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:36,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:36,836 INFO L87 Difference]: Start difference. First operand 6261 states and 9354 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:37,489 INFO L93 Difference]: Finished difference Result 18602 states and 27984 transitions. [2023-11-29 03:50:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 114 [2023-11-29 03:50:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:37,583 INFO L225 Difference]: With dead ends: 18602 [2023-11-29 03:50:37,583 INFO L226 Difference]: Without dead ends: 12351 [2023-11-29 03:50:37,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:37,597 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 163 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:37,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 400 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12351 states. [2023-11-29 03:50:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12351 to 12297. [2023-11-29 03:50:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 10500 states have (on average 1.4924761904761905) internal successors, (15671), 10633 states have internal predecessors, (15671), 1076 states have call successors, (1076), 624 states have call predecessors, (1076), 720 states have return successors, (1531), 1055 states have call predecessors, (1531), 1076 states have call successors, (1531) [2023-11-29 03:50:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 18278 transitions. [2023-11-29 03:50:38,362 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 18278 transitions. Word has length 114 [2023-11-29 03:50:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:38,362 INFO L495 AbstractCegarLoop]: Abstraction has 12297 states and 18278 transitions. [2023-11-29 03:50:38,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 03:50:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 18278 transitions. [2023-11-29 03:50:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 03:50:38,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:38,393 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:38,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:50:38,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:50:38,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:38,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1408306795, now seen corresponding path program 1 times [2023-11-29 03:50:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813363198] [2023-11-29 03:50:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:50:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:50:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:50:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813363198] [2023-11-29 03:50:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813363198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:38,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913351928] [2023-11-29 03:50:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:38,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:38,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:50:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:38,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:38,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 03:50:38,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913351928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604247707] [2023-11-29 03:50:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:38,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:38,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:38,865 INFO L87 Difference]: Start difference. First operand 12297 states and 18278 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:50:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:39,933 INFO L93 Difference]: Finished difference Result 36342 states and 54703 transitions. [2023-11-29 03:50:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2023-11-29 03:50:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:40,046 INFO L225 Difference]: With dead ends: 36342 [2023-11-29 03:50:40,046 INFO L226 Difference]: Without dead ends: 24056 [2023-11-29 03:50:40,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:40,085 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 180 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:40,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 556 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24056 states. [2023-11-29 03:50:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24056 to 24056. [2023-11-29 03:50:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24056 states, 20536 states have (on average 1.4848558628749513) internal successors, (30493), 20766 states have internal predecessors, (30493), 2079 states have call successors, (2079), 1248 states have call predecessors, (2079), 1440 states have return successors, (3366), 2073 states have call predecessors, (3366), 2079 states have call successors, (3366) [2023-11-29 03:50:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24056 states to 24056 states and 35938 transitions. [2023-11-29 03:50:41,808 INFO L78 Accepts]: Start accepts. Automaton has 24056 states and 35938 transitions. Word has length 114 [2023-11-29 03:50:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:41,809 INFO L495 AbstractCegarLoop]: Abstraction has 24056 states and 35938 transitions. [2023-11-29 03:50:41,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:50:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24056 states and 35938 transitions. [2023-11-29 03:50:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 03:50:41,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:41,889 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:41,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:50:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 03:50:42,090 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:42,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1855746044, now seen corresponding path program 1 times [2023-11-29 03:50:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:42,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009838969] [2023-11-29 03:50:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:50:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:50:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 03:50:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-29 03:50:42,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:42,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009838969] [2023-11-29 03:50:42,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009838969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:42,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002360312] [2023-11-29 03:50:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:42,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:42,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:50:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:42,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:42,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 03:50:42,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002360312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:42,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-29 03:50:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762709002] [2023-11-29 03:50:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:42,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:42,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:42,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:42,502 INFO L87 Difference]: Start difference. First operand 24056 states and 35938 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 03:50:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:44,140 INFO L93 Difference]: Finished difference Result 71080 states and 106857 transitions. [2023-11-29 03:50:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 147 [2023-11-29 03:50:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:44,256 INFO L225 Difference]: With dead ends: 71080 [2023-11-29 03:50:44,256 INFO L226 Difference]: Without dead ends: 47040 [2023-11-29 03:50:44,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:44,316 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 122 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:44,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 373 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47040 states. [2023-11-29 03:50:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47040 to 46830. [2023-11-29 03:50:47,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46830 states, 40154 states have (on average 1.4802759376400856) internal successors, (59439), 40612 states have internal predecessors, (59439), 3869 states have call successors, (3869), 2422 states have call predecessors, (3869), 2806 states have return successors, (6252), 3827 states have call predecessors, (6252), 3869 states have call successors, (6252) [2023-11-29 03:50:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46830 states to 46830 states and 69560 transitions. [2023-11-29 03:50:47,211 INFO L78 Accepts]: Start accepts. Automaton has 46830 states and 69560 transitions. Word has length 147 [2023-11-29 03:50:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:47,211 INFO L495 AbstractCegarLoop]: Abstraction has 46830 states and 69560 transitions. [2023-11-29 03:50:47,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 03:50:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46830 states and 69560 transitions. [2023-11-29 03:50:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 03:50:47,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:47,286 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:47,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 03:50:47,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 03:50:47,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:47,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:47,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1632536281, now seen corresponding path program 1 times [2023-11-29 03:50:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410335741] [2023-11-29 03:50:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:50:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:50:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 03:50:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 03:50:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 03:50:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410335741] [2023-11-29 03:50:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410335741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:47,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370231630] [2023-11-29 03:50:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:47,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:47,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:47,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:47,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:50:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:47,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:47,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 03:50:47,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370231630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550011451] [2023-11-29 03:50:47,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:47,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:47,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:47,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:47,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:47,876 INFO L87 Difference]: Start difference. First operand 46830 states and 69560 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:50:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:49,415 INFO L93 Difference]: Finished difference Result 73894 states and 110353 transitions. [2023-11-29 03:50:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2023-11-29 03:50:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:49,513 INFO L225 Difference]: With dead ends: 73894 [2023-11-29 03:50:49,513 INFO L226 Difference]: Without dead ends: 40990 [2023-11-29 03:50:49,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:49,732 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 141 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:49,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40990 states. [2023-11-29 03:50:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40990 to 29878. [2023-11-29 03:50:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29878 states, 25666 states have (on average 1.4331411205485858) internal successors, (36783), 25904 states have internal predecessors, (36783), 2409 states have call successors, (2409), 1610 states have call predecessors, (2409), 1802 states have return successors, (3422), 2379 states have call predecessors, (3422), 2409 states have call successors, (3422) [2023-11-29 03:50:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29878 states to 29878 states and 42614 transitions. [2023-11-29 03:50:51,967 INFO L78 Accepts]: Start accepts. Automaton has 29878 states and 42614 transitions. Word has length 164 [2023-11-29 03:50:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:51,968 INFO L495 AbstractCegarLoop]: Abstraction has 29878 states and 42614 transitions. [2023-11-29 03:50:51,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:50:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 29878 states and 42614 transitions. [2023-11-29 03:50:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 03:50:52,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:52,024 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:52,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 03:50:52,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 03:50:52,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:52,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2100041046, now seen corresponding path program 1 times [2023-11-29 03:50:52,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:52,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399715102] [2023-11-29 03:50:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 03:50:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-29 03:50:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 03:50:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 03:50:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 03:50:52,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399715102] [2023-11-29 03:50:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399715102] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3296072] [2023-11-29 03:50:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:52,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:52,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:52,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:50:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:52,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:50:52,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 03:50:52,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:52,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3296072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:52,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:52,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:52,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708196636] [2023-11-29 03:50:52,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:52,603 INFO L87 Difference]: Start difference. First operand 29878 states and 42614 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:50:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:54,172 INFO L93 Difference]: Finished difference Result 52577 states and 74783 transitions. [2023-11-29 03:50:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:54,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 164 [2023-11-29 03:50:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:54,236 INFO L225 Difference]: With dead ends: 52577 [2023-11-29 03:50:54,236 INFO L226 Difference]: Without dead ends: 31904 [2023-11-29 03:50:54,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:54,266 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 147 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:54,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 411 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31904 states. [2023-11-29 03:50:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31904 to 31800. [2023-11-29 03:50:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31800 states, 27384 states have (on average 1.407865907099036) internal successors, (38553), 27622 states have internal predecessors, (38553), 2467 states have call successors, (2467), 1756 states have call predecessors, (2467), 1948 states have return successors, (3626), 2437 states have call predecessors, (3626), 2467 states have call successors, (3626) [2023-11-29 03:50:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31800 states to 31800 states and 44646 transitions. [2023-11-29 03:50:55,737 INFO L78 Accepts]: Start accepts. Automaton has 31800 states and 44646 transitions. Word has length 164 [2023-11-29 03:50:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:50:55,737 INFO L495 AbstractCegarLoop]: Abstraction has 31800 states and 44646 transitions. [2023-11-29 03:50:55,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:50:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31800 states and 44646 transitions. [2023-11-29 03:50:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 03:50:55,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:50:55,767 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:50:55,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 03:50:55,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 03:50:55,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:50:55,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:50:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1232662803, now seen corresponding path program 1 times [2023-11-29 03:50:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:50:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978024854] [2023-11-29 03:50:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:50:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:50:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:50:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:50:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:50:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:50:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:50:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:50:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:50:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:50:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 03:50:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-29 03:50:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:50:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978024854] [2023-11-29 03:50:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978024854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:50:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37442914] [2023-11-29 03:50:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:50:56,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:50:56,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:50:56,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:50:56,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:50:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:50:56,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:50:56,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:50:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 03:50:56,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:50:56,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37442914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:50:56,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:50:56,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:50:56,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978945835] [2023-11-29 03:50:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:50:56,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:50:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:50:56,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:50:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:56,334 INFO L87 Difference]: Start difference. First operand 31800 states and 44646 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:50:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:50:58,551 INFO L93 Difference]: Finished difference Result 93864 states and 133164 transitions. [2023-11-29 03:50:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:50:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2023-11-29 03:50:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:50:58,696 INFO L225 Difference]: With dead ends: 93864 [2023-11-29 03:50:58,696 INFO L226 Difference]: Without dead ends: 62082 [2023-11-29 03:50:58,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:50:58,754 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 178 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:50:58,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 543 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:50:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62082 states. [2023-11-29 03:51:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62082 to 62020. [2023-11-29 03:51:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62020 states, 53478 states have (on average 1.3996970716930326) internal successors, (74853), 53954 states have internal predecessors, (74853), 4729 states have call successors, (4729), 3428 states have call predecessors, (4729), 3812 states have return successors, (8200), 4669 states have call predecessors, (8200), 4729 states have call successors, (8200) [2023-11-29 03:51:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62020 states to 62020 states and 87782 transitions. [2023-11-29 03:51:01,637 INFO L78 Accepts]: Start accepts. Automaton has 62020 states and 87782 transitions. Word has length 165 [2023-11-29 03:51:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:01,637 INFO L495 AbstractCegarLoop]: Abstraction has 62020 states and 87782 transitions. [2023-11-29 03:51:01,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 62020 states and 87782 transitions. [2023-11-29 03:51:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 03:51:01,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:01,724 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:01,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:51:01,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 03:51:01,925 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:01,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1452335688, now seen corresponding path program 1 times [2023-11-29 03:51:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950796377] [2023-11-29 03:51:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:51:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:51:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 03:51:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 03:51:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 03:51:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950796377] [2023-11-29 03:51:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950796377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593444743] [2023-11-29 03:51:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:02,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:02,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:51:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:02,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:51:02,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:51:02,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593444743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:02,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160334953] [2023-11-29 03:51:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:02,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:02,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:02,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:02,357 INFO L87 Difference]: Start difference. First operand 62020 states and 87782 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:51:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:05,370 INFO L93 Difference]: Finished difference Result 107534 states and 154589 transitions. [2023-11-29 03:51:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:05,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 165 [2023-11-29 03:51:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:05,498 INFO L225 Difference]: With dead ends: 107534 [2023-11-29 03:51:05,498 INFO L226 Difference]: Without dead ends: 56184 [2023-11-29 03:51:05,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:05,559 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 137 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:05,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 221 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56184 states. [2023-11-29 03:51:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56184 to 42876. [2023-11-29 03:51:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42876 states, 37098 states have (on average 1.3640897083400723) internal successors, (50605), 37354 states have internal predecessors, (50605), 3173 states have call successors, (3173), 2412 states have call predecessors, (3173), 2604 states have return successors, (5190), 3125 states have call predecessors, (5190), 3173 states have call successors, (5190) [2023-11-29 03:51:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42876 states to 42876 states and 58968 transitions. [2023-11-29 03:51:07,617 INFO L78 Accepts]: Start accepts. Automaton has 42876 states and 58968 transitions. Word has length 165 [2023-11-29 03:51:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:07,617 INFO L495 AbstractCegarLoop]: Abstraction has 42876 states and 58968 transitions. [2023-11-29 03:51:07,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:51:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42876 states and 58968 transitions. [2023-11-29 03:51:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 03:51:07,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:07,647 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:07,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:51:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 03:51:07,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:07,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -476702167, now seen corresponding path program 1 times [2023-11-29 03:51:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103474369] [2023-11-29 03:51:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:51:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 03:51:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 03:51:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 03:51:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103474369] [2023-11-29 03:51:07,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103474369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031068908] [2023-11-29 03:51:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:07,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:07,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:07,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 03:51:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:08,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:51:08,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 03:51:08,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031068908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557182508] [2023-11-29 03:51:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:08,156 INFO L87 Difference]: Start difference. First operand 42876 states and 58968 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:11,458 INFO L93 Difference]: Finished difference Result 123032 states and 171832 transitions. [2023-11-29 03:51:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:11,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2023-11-29 03:51:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:11,638 INFO L225 Difference]: With dead ends: 123032 [2023-11-29 03:51:11,639 INFO L226 Difference]: Without dead ends: 80186 [2023-11-29 03:51:11,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:11,698 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:11,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 540 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80186 states. [2023-11-29 03:51:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80186 to 80184. [2023-11-29 03:51:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80184 states, 69206 states have (on average 1.3570644163800827) internal successors, (93917), 69718 states have internal predecessors, (93917), 6057 states have call successors, (6057), 4536 states have call predecessors, (6057), 4920 states have return successors, (12044), 5961 states have call predecessors, (12044), 6057 states have call successors, (12044) [2023-11-29 03:51:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80184 states to 80184 states and 112018 transitions. [2023-11-29 03:51:15,791 INFO L78 Accepts]: Start accepts. Automaton has 80184 states and 112018 transitions. Word has length 165 [2023-11-29 03:51:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:15,792 INFO L495 AbstractCegarLoop]: Abstraction has 80184 states and 112018 transitions. [2023-11-29 03:51:15,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 80184 states and 112018 transitions. [2023-11-29 03:51:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-29 03:51:15,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:15,848 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:15,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 03:51:16,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 03:51:16,049 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:16,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1282145970, now seen corresponding path program 1 times [2023-11-29 03:51:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838112840] [2023-11-29 03:51:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 03:51:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 03:51:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:51:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 03:51:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-29 03:51:16,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838112840] [2023-11-29 03:51:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838112840] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94971483] [2023-11-29 03:51:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:16,191 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:16,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 03:51:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:16,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:51:16,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 03:51:16,352 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94971483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627336634] [2023-11-29 03:51:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:16,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:16,354 INFO L87 Difference]: Start difference. First operand 80184 states and 112018 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:21,347 INFO L93 Difference]: Finished difference Result 156156 states and 221836 transitions. [2023-11-29 03:51:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2023-11-29 03:51:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:21,611 INFO L225 Difference]: With dead ends: 156156 [2023-11-29 03:51:21,611 INFO L226 Difference]: Without dead ends: 113226 [2023-11-29 03:51:21,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:21,671 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 158 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:21,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 534 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113226 states. [2023-11-29 03:51:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113226 to 113224. [2023-11-29 03:51:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113224 states, 97614 states have (on average 1.3551027516544758) internal successors, (132277), 98374 states have internal predecessors, (132277), 8633 states have call successors, (8633), 6400 states have call predecessors, (8633), 6976 states have return successors, (19436), 8481 states have call predecessors, (19436), 8633 states have call successors, (19436) [2023-11-29 03:51:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113224 states to 113224 states and 160346 transitions. [2023-11-29 03:51:27,568 INFO L78 Accepts]: Start accepts. Automaton has 113224 states and 160346 transitions. Word has length 165 [2023-11-29 03:51:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:27,568 INFO L495 AbstractCegarLoop]: Abstraction has 113224 states and 160346 transitions. [2023-11-29 03:51:27,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:51:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 113224 states and 160346 transitions. [2023-11-29 03:51:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:51:27,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:27,632 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:27,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 03:51:27,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:27,832 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:27,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 712126135, now seen corresponding path program 1 times [2023-11-29 03:51:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838269858] [2023-11-29 03:51:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:51:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:51:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 03:51:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 03:51:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:27,942 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 03:51:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838269858] [2023-11-29 03:51:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838269858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187762144] [2023-11-29 03:51:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:27,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:27,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 03:51:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:28,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:51:28,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-29 03:51:28,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187762144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384341565] [2023-11-29 03:51:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:28,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:28,113 INFO L87 Difference]: Start difference. First operand 113224 states and 160346 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:51:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:34,278 INFO L93 Difference]: Finished difference Result 229396 states and 326236 transitions. [2023-11-29 03:51:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2023-11-29 03:51:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:34,551 INFO L225 Difference]: With dead ends: 229396 [2023-11-29 03:51:34,551 INFO L226 Difference]: Without dead ends: 116218 [2023-11-29 03:51:34,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:34,659 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 158 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:34,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 364 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116218 states. [2023-11-29 03:51:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116218 to 112920. [2023-11-29 03:51:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112920 states, 97310 states have (on average 1.3452779775973693) internal successors, (130909), 98070 states have internal predecessors, (130909), 8633 states have call successors, (8633), 6400 states have call predecessors, (8633), 6976 states have return successors, (19436), 8481 states have call predecessors, (19436), 8633 states have call successors, (19436) [2023-11-29 03:51:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112920 states to 112920 states and 158978 transitions. [2023-11-29 03:51:40,736 INFO L78 Accepts]: Start accepts. Automaton has 112920 states and 158978 transitions. Word has length 166 [2023-11-29 03:51:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:40,737 INFO L495 AbstractCegarLoop]: Abstraction has 112920 states and 158978 transitions. [2023-11-29 03:51:40,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:51:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 112920 states and 158978 transitions. [2023-11-29 03:51:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:51:40,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:40,799 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:40,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-29 03:51:40,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:41,000 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:41,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:41,000 INFO L85 PathProgramCache]: Analyzing trace with hash 176954995, now seen corresponding path program 1 times [2023-11-29 03:51:41,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:41,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836607188] [2023-11-29 03:51:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:51:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:51:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 03:51:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 03:51:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 03:51:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836607188] [2023-11-29 03:51:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836607188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537783739] [2023-11-29 03:51:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:41,134 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:41,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 03:51:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:41,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:51:41,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:51:41,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537783739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:41,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777216204] [2023-11-29 03:51:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:41,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:41,325 INFO L87 Difference]: Start difference. First operand 112920 states and 158978 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:51:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:51:47,162 INFO L93 Difference]: Finished difference Result 231778 states and 336803 transitions. [2023-11-29 03:51:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:51:47,163 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 166 [2023-11-29 03:51:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:51:47,576 INFO L225 Difference]: With dead ends: 231778 [2023-11-29 03:51:47,576 INFO L226 Difference]: Without dead ends: 118904 [2023-11-29 03:51:47,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:47,689 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 157 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:51:47,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 218 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:51:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118904 states. [2023-11-29 03:51:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118904 to 118520. [2023-11-29 03:51:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118520 states, 102630 states have (on average 1.3152197213290462) internal successors, (134981), 103390 states have internal predecessors, (134981), 8633 states have call successors, (8633), 6624 states have call predecessors, (8633), 7256 states have return successors, (20078), 8537 states have call predecessors, (20078), 8633 states have call successors, (20078) [2023-11-29 03:51:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118520 states to 118520 states and 163692 transitions. [2023-11-29 03:51:53,622 INFO L78 Accepts]: Start accepts. Automaton has 118520 states and 163692 transitions. Word has length 166 [2023-11-29 03:51:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:51:53,623 INFO L495 AbstractCegarLoop]: Abstraction has 118520 states and 163692 transitions. [2023-11-29 03:51:53,623 INFO L496 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:51:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 118520 states and 163692 transitions. [2023-11-29 03:51:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:51:53,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:51:53,687 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:51:53,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 03:51:53,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:53,888 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:51:53,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:51:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -82044943, now seen corresponding path program 1 times [2023-11-29 03:51:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:51:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860549421] [2023-11-29 03:51:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:51:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:51:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:51:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:51:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:51:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:51:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:51:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:51:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:53,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 03:51:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:51:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 03:51:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 03:51:54,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:51:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860549421] [2023-11-29 03:51:54,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860549421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:51:54,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220338820] [2023-11-29 03:51:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:51:54,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:51:54,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:51:54,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:51:54,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 03:51:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:51:54,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:51:54,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:51:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 03:51:54,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:51:54,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220338820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:51:54,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:51:54,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:51:54,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812124076] [2023-11-29 03:51:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:51:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:51:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:51:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:51:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:51:54,187 INFO L87 Difference]: Start difference. First operand 118520 states and 163692 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:52:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:00,213 INFO L93 Difference]: Finished difference Result 215044 states and 298152 transitions. [2023-11-29 03:52:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:52:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2023-11-29 03:52:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:00,670 INFO L225 Difference]: With dead ends: 215044 [2023-11-29 03:52:00,670 INFO L226 Difference]: Without dead ends: 123674 [2023-11-29 03:52:00,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:00,760 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 150 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:00,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 389 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:52:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123674 states. [2023-11-29 03:52:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123674 to 118656. [2023-11-29 03:52:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118656 states, 102766 states have (on average 1.3107156063289416) internal successors, (134697), 103526 states have internal predecessors, (134697), 8633 states have call successors, (8633), 6624 states have call predecessors, (8633), 7256 states have return successors, (20078), 8537 states have call predecessors, (20078), 8633 states have call successors, (20078) [2023-11-29 03:52:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118656 states to 118656 states and 163408 transitions. [2023-11-29 03:52:07,109 INFO L78 Accepts]: Start accepts. Automaton has 118656 states and 163408 transitions. Word has length 166 [2023-11-29 03:52:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:07,110 INFO L495 AbstractCegarLoop]: Abstraction has 118656 states and 163408 transitions. [2023-11-29 03:52:07,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:52:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 118656 states and 163408 transitions. [2023-11-29 03:52:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 03:52:07,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:07,170 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:07,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 03:52:07,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:07,371 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:07,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1484850927, now seen corresponding path program 1 times [2023-11-29 03:52:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:07,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034004028] [2023-11-29 03:52:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 03:52:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 03:52:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 03:52:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 03:52:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-29 03:52:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:07,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034004028] [2023-11-29 03:52:07,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034004028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:07,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:52:07,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:52:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676700516] [2023-11-29 03:52:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:07,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:52:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:52:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:52:07,462 INFO L87 Difference]: Start difference. First operand 118656 states and 163408 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:52:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:12,674 INFO L93 Difference]: Finished difference Result 241450 states and 328853 transitions. [2023-11-29 03:52:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:52:12,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 166 [2023-11-29 03:52:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:13,009 INFO L225 Difference]: With dead ends: 241450 [2023-11-29 03:52:13,009 INFO L226 Difference]: Without dead ends: 122816 [2023-11-29 03:52:13,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:52:13,119 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 341 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:13,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 241 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:52:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122816 states. [2023-11-29 03:52:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122816 to 112302. [2023-11-29 03:52:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112302 states, 98176 states have (on average 1.3122453552803128) internal successors, (128831), 100030 states have internal predecessors, (128831), 6581 states have call successors, (6581), 5080 states have call predecessors, (6581), 7544 states have return successors, (16795), 7207 states have call predecessors, (16795), 6581 states have call successors, (16795) [2023-11-29 03:52:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112302 states to 112302 states and 152207 transitions. [2023-11-29 03:52:18,710 INFO L78 Accepts]: Start accepts. Automaton has 112302 states and 152207 transitions. Word has length 166 [2023-11-29 03:52:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:18,710 INFO L495 AbstractCegarLoop]: Abstraction has 112302 states and 152207 transitions. [2023-11-29 03:52:18,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:52:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 112302 states and 152207 transitions. [2023-11-29 03:52:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 03:52:18,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:18,759 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:18,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 03:52:18,759 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:18,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1208199145, now seen corresponding path program 1 times [2023-11-29 03:52:18,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:18,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519074523] [2023-11-29 03:52:18,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:18,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 03:52:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:52:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 03:52:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 03:52:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:52:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519074523] [2023-11-29 03:52:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519074523] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352542050] [2023-11-29 03:52:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:18,876 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:18,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 03:52:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:19,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:52:19,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 03:52:19,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:52:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352542050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:19,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:52:19,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:52:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401290785] [2023-11-29 03:52:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:19,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:52:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:52:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:19,055 INFO L87 Difference]: Start difference. First operand 112302 states and 152207 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:52:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:24,025 INFO L93 Difference]: Finished difference Result 198598 states and 268791 transitions. [2023-11-29 03:52:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:52:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 170 [2023-11-29 03:52:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:24,286 INFO L225 Difference]: With dead ends: 198598 [2023-11-29 03:52:24,287 INFO L226 Difference]: Without dead ends: 113240 [2023-11-29 03:52:24,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:24,378 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 156 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:24,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 378 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:52:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113240 states. [2023-11-29 03:52:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113240 to 112302. [2023-11-29 03:52:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112302 states, 98176 states have (on average 1.3086395860495437) internal successors, (128477), 100030 states have internal predecessors, (128477), 6581 states have call successors, (6581), 5080 states have call predecessors, (6581), 7544 states have return successors, (16795), 7207 states have call predecessors, (16795), 6581 states have call successors, (16795) [2023-11-29 03:52:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112302 states to 112302 states and 151853 transitions. [2023-11-29 03:52:29,636 INFO L78 Accepts]: Start accepts. Automaton has 112302 states and 151853 transitions. Word has length 170 [2023-11-29 03:52:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:29,637 INFO L495 AbstractCegarLoop]: Abstraction has 112302 states and 151853 transitions. [2023-11-29 03:52:29,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 03:52:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 112302 states and 151853 transitions. [2023-11-29 03:52:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 03:52:29,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:29,686 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:29,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 03:52:29,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:29,887 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:29,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash 539072663, now seen corresponding path program 1 times [2023-11-29 03:52:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:29,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106852789] [2023-11-29 03:52:29,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:29,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 03:52:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:52:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 03:52:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 03:52:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-29 03:52:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:29,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106852789] [2023-11-29 03:52:29,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106852789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:29,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:52:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:52:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371252968] [2023-11-29 03:52:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:29,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:52:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:29,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:52:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:52:29,966 INFO L87 Difference]: Start difference. First operand 112302 states and 151853 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:52:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:34,601 INFO L93 Difference]: Finished difference Result 204876 states and 275764 transitions. [2023-11-29 03:52:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:52:34,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 170 [2023-11-29 03:52:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:34,788 INFO L225 Difference]: With dead ends: 204876 [2023-11-29 03:52:34,788 INFO L226 Difference]: Without dead ends: 92590 [2023-11-29 03:52:34,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:52:34,886 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 338 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:34,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 239 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:52:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92590 states. [2023-11-29 03:52:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92590 to 84200. [2023-11-29 03:52:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84200 states, 73732 states have (on average 1.3138528725655074) internal successors, (96873), 75068 states have internal predecessors, (96873), 4895 states have call successors, (4895), 3796 states have call predecessors, (4895), 5572 states have return successors, (11629), 5343 states have call predecessors, (11629), 4895 states have call successors, (11629) [2023-11-29 03:52:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84200 states to 84200 states and 113397 transitions. [2023-11-29 03:52:39,016 INFO L78 Accepts]: Start accepts. Automaton has 84200 states and 113397 transitions. Word has length 170 [2023-11-29 03:52:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:39,016 INFO L495 AbstractCegarLoop]: Abstraction has 84200 states and 113397 transitions. [2023-11-29 03:52:39,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 03:52:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84200 states and 113397 transitions. [2023-11-29 03:52:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-29 03:52:39,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:39,056 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 03:52:39,056 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:39,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash 470777527, now seen corresponding path program 1 times [2023-11-29 03:52:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559135013] [2023-11-29 03:52:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:52:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:52:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:52:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 03:52:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:52:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559135013] [2023-11-29 03:52:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559135013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265737340] [2023-11-29 03:52:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:39,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:39,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 03:52:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:39,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:52:39,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 03:52:39,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:52:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265737340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:52:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:52:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65172881] [2023-11-29 03:52:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:39,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:52:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:39,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:52:39,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:39,344 INFO L87 Difference]: Start difference. First operand 84200 states and 113397 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:52:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:43,236 INFO L93 Difference]: Finished difference Result 143596 states and 200795 transitions. [2023-11-29 03:52:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:52:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-11-29 03:52:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:43,407 INFO L225 Difference]: With dead ends: 143596 [2023-11-29 03:52:43,407 INFO L226 Difference]: Without dead ends: 84366 [2023-11-29 03:52:43,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:43,486 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 152 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:43,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 457 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:52:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84366 states. [2023-11-29 03:52:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84366 to 84200. [2023-11-29 03:52:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84200 states, 73732 states have (on average 1.293427548418597) internal successors, (95367), 75068 states have internal predecessors, (95367), 4895 states have call successors, (4895), 3796 states have call predecessors, (4895), 5572 states have return successors, (11629), 5343 states have call predecessors, (11629), 4895 states have call successors, (11629) [2023-11-29 03:52:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84200 states to 84200 states and 111891 transitions. [2023-11-29 03:52:47,516 INFO L78 Accepts]: Start accepts. Automaton has 84200 states and 111891 transitions. Word has length 174 [2023-11-29 03:52:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:47,516 INFO L495 AbstractCegarLoop]: Abstraction has 84200 states and 111891 transitions. [2023-11-29 03:52:47,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:52:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 84200 states and 111891 transitions. [2023-11-29 03:52:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-29 03:52:47,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:47,556 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:47,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 03:52:47,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:47,756 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:47,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:47,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1809774889, now seen corresponding path program 1 times [2023-11-29 03:52:47,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:47,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750960559] [2023-11-29 03:52:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:52:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:52:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:52:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 03:52:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:52:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750960559] [2023-11-29 03:52:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750960559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617021221] [2023-11-29 03:52:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:47,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:47,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:47,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:47,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 03:52:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:47,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:52:47,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:52:48,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:52:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617021221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:48,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:52:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:52:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726521507] [2023-11-29 03:52:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:48,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:52:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:48,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:52:48,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:48,021 INFO L87 Difference]: Start difference. First operand 84200 states and 111891 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:52:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:51,381 INFO L93 Difference]: Finished difference Result 154815 states and 210786 transitions. [2023-11-29 03:52:51,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:52:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 174 [2023-11-29 03:52:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:51,521 INFO L225 Difference]: With dead ends: 154815 [2023-11-29 03:52:51,521 INFO L226 Difference]: Without dead ends: 75489 [2023-11-29 03:52:51,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:51,597 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 176 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:51,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 219 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:52:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75489 states. [2023-11-29 03:52:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75489 to 72133. [2023-11-29 03:52:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72133 states, 63309 states have (on average 1.2627746449951824) internal successors, (79945), 64410 states have internal predecessors, (79945), 4155 states have call successors, (4155), 3224 states have call predecessors, (4155), 4668 states have return successors, (9162), 4502 states have call predecessors, (9162), 4155 states have call successors, (9162) [2023-11-29 03:52:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72133 states to 72133 states and 93262 transitions. [2023-11-29 03:52:55,055 INFO L78 Accepts]: Start accepts. Automaton has 72133 states and 93262 transitions. Word has length 174 [2023-11-29 03:52:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:52:55,056 INFO L495 AbstractCegarLoop]: Abstraction has 72133 states and 93262 transitions. [2023-11-29 03:52:55,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:52:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 72133 states and 93262 transitions. [2023-11-29 03:52:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-29 03:52:55,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:52:55,081 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:52:55,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 03:52:55,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:55,282 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:52:55,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:52:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1912288751, now seen corresponding path program 1 times [2023-11-29 03:52:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:52:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251284035] [2023-11-29 03:52:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:52:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:52:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:52:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:52:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:52:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:52:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:52:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:52:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 03:52:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:52:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 03:52:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:52:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:52:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251284035] [2023-11-29 03:52:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251284035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:52:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437188372] [2023-11-29 03:52:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:52:55,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:52:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:52:55,387 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:52:55,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 03:52:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:52:55,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:52:55,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:52:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 03:52:55,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:52:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437188372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:52:55,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:52:55,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:52:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162903234] [2023-11-29 03:52:55,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:52:55,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:52:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:52:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:52:55,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:55,555 INFO L87 Difference]: Start difference. First operand 72133 states and 93262 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:52:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:52:58,949 INFO L93 Difference]: Finished difference Result 121565 states and 162524 transitions. [2023-11-29 03:52:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:52:58,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-11-29 03:52:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:52:59,072 INFO L225 Difference]: With dead ends: 121565 [2023-11-29 03:52:59,072 INFO L226 Difference]: Without dead ends: 72238 [2023-11-29 03:52:59,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:52:59,122 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 147 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:52:59,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 495 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:52:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72238 states. [2023-11-29 03:53:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72238 to 72104. [2023-11-29 03:53:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72104 states, 63280 states have (on average 1.2385745891276865) internal successors, (78377), 64381 states have internal predecessors, (78377), 4155 states have call successors, (4155), 3224 states have call predecessors, (4155), 4668 states have return successors, (9162), 4502 states have call predecessors, (9162), 4155 states have call successors, (9162) [2023-11-29 03:53:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72104 states to 72104 states and 91694 transitions. [2023-11-29 03:53:02,542 INFO L78 Accepts]: Start accepts. Automaton has 72104 states and 91694 transitions. Word has length 174 [2023-11-29 03:53:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:02,543 INFO L495 AbstractCegarLoop]: Abstraction has 72104 states and 91694 transitions. [2023-11-29 03:53:02,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:53:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 72104 states and 91694 transitions. [2023-11-29 03:53:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-29 03:53:02,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:02,567 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:02,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 03:53:02,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:02,767 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:02,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash -895368631, now seen corresponding path program 1 times [2023-11-29 03:53:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318026253] [2023-11-29 03:53:02,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 03:53:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 03:53:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:53:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318026253] [2023-11-29 03:53:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318026253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067184419] [2023-11-29 03:53:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:02,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:02,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:02,885 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:02,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 03:53:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:03,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:53:03,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:53:03,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067184419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:53:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695125126] [2023-11-29 03:53:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:03,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:03,059 INFO L87 Difference]: Start difference. First operand 72104 states and 91694 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:53:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:06,406 INFO L93 Difference]: Finished difference Result 121472 states and 159902 transitions. [2023-11-29 03:53:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 174 [2023-11-29 03:53:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:06,543 INFO L225 Difference]: With dead ends: 121472 [2023-11-29 03:53:06,543 INFO L226 Difference]: Without dead ends: 72238 [2023-11-29 03:53:06,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:06,613 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 145 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:06,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 499 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72238 states. [2023-11-29 03:53:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72238 to 72104. [2023-11-29 03:53:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72104 states, 63280 states have (on average 1.214617572692794) internal successors, (76861), 64381 states have internal predecessors, (76861), 4155 states have call successors, (4155), 3224 states have call predecessors, (4155), 4668 states have return successors, (9162), 4502 states have call predecessors, (9162), 4155 states have call successors, (9162) [2023-11-29 03:53:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72104 states to 72104 states and 90178 transitions. [2023-11-29 03:53:10,173 INFO L78 Accepts]: Start accepts. Automaton has 72104 states and 90178 transitions. Word has length 174 [2023-11-29 03:53:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:10,173 INFO L495 AbstractCegarLoop]: Abstraction has 72104 states and 90178 transitions. [2023-11-29 03:53:10,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 03:53:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 72104 states and 90178 transitions. [2023-11-29 03:53:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 03:53:10,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:10,199 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:10,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 03:53:10,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 03:53:10,400 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:10,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2066437460, now seen corresponding path program 1 times [2023-11-29 03:53:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007911006] [2023-11-29 03:53:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:53:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 03:53:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:53:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007911006] [2023-11-29 03:53:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007911006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160367089] [2023-11-29 03:53:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:10,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:10,508 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:10,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 03:53:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:10,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:53:10,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 03:53:10,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160367089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 03:53:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009957385] [2023-11-29 03:53:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:10,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:53:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:53:10,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:10,635 INFO L87 Difference]: Start difference. First operand 72104 states and 90178 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:53:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:13,913 INFO L93 Difference]: Finished difference Result 106737 states and 136711 transitions. [2023-11-29 03:53:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:53:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 175 [2023-11-29 03:53:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:14,057 INFO L225 Difference]: With dead ends: 106737 [2023-11-29 03:53:14,057 INFO L226 Difference]: Without dead ends: 72200 [2023-11-29 03:53:14,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:53:14,114 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 168 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:14,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 487 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72200 states. [2023-11-29 03:53:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72200 to 72104. [2023-11-29 03:53:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72104 states, 63280 states have (on average 1.2056415929203539) internal successors, (76293), 64381 states have internal predecessors, (76293), 4155 states have call successors, (4155), 3224 states have call predecessors, (4155), 4668 states have return successors, (9162), 4502 states have call predecessors, (9162), 4155 states have call successors, (9162) [2023-11-29 03:53:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72104 states to 72104 states and 89610 transitions. [2023-11-29 03:53:17,859 INFO L78 Accepts]: Start accepts. Automaton has 72104 states and 89610 transitions. Word has length 175 [2023-11-29 03:53:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:17,859 INFO L495 AbstractCegarLoop]: Abstraction has 72104 states and 89610 transitions. [2023-11-29 03:53:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 03:53:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 72104 states and 89610 transitions. [2023-11-29 03:53:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:17,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:17,883 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:17,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-11-29 03:53:18,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:18,083 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:18,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash 648061477, now seen corresponding path program 1 times [2023-11-29 03:53:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:18,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197982966] [2023-11-29 03:53:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:53:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:53:18,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197982966] [2023-11-29 03:53:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197982966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80624847] [2023-11-29 03:53:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:18,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:18,193 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:18,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 03:53:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:18,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:53:18,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:53:18,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80624847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:18,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 03:53:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303263043] [2023-11-29 03:53:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:18,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:53:18,409 INFO L87 Difference]: Start difference. First operand 72104 states and 89610 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:21,320 INFO L93 Difference]: Finished difference Result 111998 states and 140193 transitions. [2023-11-29 03:53:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:21,434 INFO L225 Difference]: With dead ends: 111998 [2023-11-29 03:53:21,434 INFO L226 Difference]: Without dead ends: 58358 [2023-11-29 03:53:21,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:53:21,639 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 205 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:21,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 283 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:53:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58358 states. [2023-11-29 03:53:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58358 to 39896. [2023-11-29 03:53:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39896 states, 35087 states have (on average 1.1925784478581811) internal successors, (41844), 35680 states have internal predecessors, (41844), 2289 states have call successors, (2289), 1738 states have call predecessors, (2289), 2519 states have return successors, (5153), 2479 states have call predecessors, (5153), 2289 states have call successors, (5153) [2023-11-29 03:53:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39896 states to 39896 states and 49286 transitions. [2023-11-29 03:53:23,954 INFO L78 Accepts]: Start accepts. Automaton has 39896 states and 49286 transitions. Word has length 176 [2023-11-29 03:53:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:23,954 INFO L495 AbstractCegarLoop]: Abstraction has 39896 states and 49286 transitions. [2023-11-29 03:53:23,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39896 states and 49286 transitions. [2023-11-29 03:53:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:23,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:23,968 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:23,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 03:53:24,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 03:53:24,169 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:24,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -299990489, now seen corresponding path program 1 times [2023-11-29 03:53:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192378222] [2023-11-29 03:53:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:53:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:53:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192378222] [2023-11-29 03:53:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192378222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432663215] [2023-11-29 03:53:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:24,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:24,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 03:53:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:24,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:53:24,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:53:24,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432663215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 03:53:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712848071] [2023-11-29 03:53:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:24,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:53:24,441 INFO L87 Difference]: Start difference. First operand 39896 states and 49286 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:26,748 INFO L93 Difference]: Finished difference Result 79778 states and 99102 transitions. [2023-11-29 03:53:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:26,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:26,818 INFO L225 Difference]: With dead ends: 79778 [2023-11-29 03:53:26,818 INFO L226 Difference]: Without dead ends: 39896 [2023-11-29 03:53:26,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:53:26,858 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 201 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:26,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 276 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:53:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39896 states. [2023-11-29 03:53:28,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39896 to 39896. [2023-11-29 03:53:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39896 states, 35087 states have (on average 1.1709180038190783) internal successors, (41084), 35680 states have internal predecessors, (41084), 2289 states have call successors, (2289), 1738 states have call predecessors, (2289), 2519 states have return successors, (5153), 2479 states have call predecessors, (5153), 2289 states have call successors, (5153) [2023-11-29 03:53:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39896 states to 39896 states and 48526 transitions. [2023-11-29 03:53:29,070 INFO L78 Accepts]: Start accepts. Automaton has 39896 states and 48526 transitions. Word has length 176 [2023-11-29 03:53:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:29,070 INFO L495 AbstractCegarLoop]: Abstraction has 39896 states and 48526 transitions. [2023-11-29 03:53:29,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39896 states and 48526 transitions. [2023-11-29 03:53:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:29,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:29,083 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:29,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 03:53:29,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:29,283 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:29,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 375169637, now seen corresponding path program 1 times [2023-11-29 03:53:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16879676] [2023-11-29 03:53:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:53:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:53:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16879676] [2023-11-29 03:53:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16879676] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094226141] [2023-11-29 03:53:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:29,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:29,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:29,378 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:29,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-29 03:53:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:29,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:53:29,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-11-29 03:53:29,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:29,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094226141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:29,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:29,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-11-29 03:53:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705127347] [2023-11-29 03:53:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:53:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:53:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:53:29,548 INFO L87 Difference]: Start difference. First operand 39896 states and 48526 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:31,800 INFO L93 Difference]: Finished difference Result 79774 states and 97352 transitions. [2023-11-29 03:53:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:31,869 INFO L225 Difference]: With dead ends: 79774 [2023-11-29 03:53:31,869 INFO L226 Difference]: Without dead ends: 39896 [2023-11-29 03:53:31,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:53:31,916 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 196 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:31,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 271 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:53:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39896 states. [2023-11-29 03:53:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39896 to 39896. [2023-11-29 03:53:34,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39896 states, 35087 states have (on average 1.1554706871490865) internal successors, (40542), 35680 states have internal predecessors, (40542), 2289 states have call successors, (2289), 1738 states have call predecessors, (2289), 2519 states have return successors, (5153), 2479 states have call predecessors, (5153), 2289 states have call successors, (5153) [2023-11-29 03:53:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39896 states to 39896 states and 47984 transitions. [2023-11-29 03:53:34,292 INFO L78 Accepts]: Start accepts. Automaton has 39896 states and 47984 transitions. Word has length 176 [2023-11-29 03:53:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:34,292 INFO L495 AbstractCegarLoop]: Abstraction has 39896 states and 47984 transitions. [2023-11-29 03:53:34,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 39896 states and 47984 transitions. [2023-11-29 03:53:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:34,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:34,306 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:34,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-29 03:53:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:34,507 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:34,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -209602013, now seen corresponding path program 1 times [2023-11-29 03:53:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084761700] [2023-11-29 03:53:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-29 03:53:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 03:53:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084761700] [2023-11-29 03:53:34,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084761700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:34,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547615959] [2023-11-29 03:53:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:34,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:34,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:34,600 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:34,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 03:53:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:34,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:53:34,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 03:53:34,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547615959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:53:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161301189] [2023-11-29 03:53:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:34,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:34,709 INFO L87 Difference]: Start difference. First operand 39896 states and 47984 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:36,590 INFO L93 Difference]: Finished difference Result 66607 states and 81266 transitions. [2023-11-29 03:53:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:36,590 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:36,634 INFO L225 Difference]: With dead ends: 66607 [2023-11-29 03:53:36,634 INFO L226 Difference]: Without dead ends: 26721 [2023-11-29 03:53:36,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:36,822 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 29 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:36,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 504 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26721 states. [2023-11-29 03:53:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26721 to 26101. [2023-11-29 03:53:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26101 states, 22810 states have (on average 1.1365190705830777) internal successors, (25924), 23201 states have internal predecessors, (25924), 1571 states have call successors, (1571), 1205 states have call predecessors, (1571), 1719 states have return successors, (3105), 1695 states have call predecessors, (3105), 1571 states have call successors, (3105) [2023-11-29 03:53:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26101 states to 26101 states and 30600 transitions. [2023-11-29 03:53:38,731 INFO L78 Accepts]: Start accepts. Automaton has 26101 states and 30600 transitions. Word has length 176 [2023-11-29 03:53:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:38,731 INFO L495 AbstractCegarLoop]: Abstraction has 26101 states and 30600 transitions. [2023-11-29 03:53:38,731 INFO L496 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 26101 states and 30600 transitions. [2023-11-29 03:53:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:38,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:38,742 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:38,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-29 03:53:38,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-29 03:53:38,943 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:38,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash 248087179, now seen corresponding path program 1 times [2023-11-29 03:53:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:38,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846042568] [2023-11-29 03:53:38,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:38,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:53:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-29 03:53:39,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:39,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846042568] [2023-11-29 03:53:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846042568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:39,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742582757] [2023-11-29 03:53:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:39,030 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:39,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 03:53:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:39,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:53:39,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-11-29 03:53:39,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742582757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:39,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:39,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:53:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005271453] [2023-11-29 03:53:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:39,140 INFO L87 Difference]: Start difference. First operand 26101 states and 30600 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:40,346 INFO L93 Difference]: Finished difference Result 47544 states and 56539 transitions. [2023-11-29 03:53:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:40,379 INFO L225 Difference]: With dead ends: 47544 [2023-11-29 03:53:40,379 INFO L226 Difference]: Without dead ends: 21453 [2023-11-29 03:53:40,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:40,411 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 20 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:40,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 503 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2023-11-29 03:53:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 21317. [2023-11-29 03:53:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21317 states, 18536 states have (on average 1.1157747086750107) internal successors, (20682), 18848 states have internal predecessors, (20682), 1340 states have call successors, (1340), 1019 states have call predecessors, (1340), 1440 states have return successors, (2343), 1450 states have call predecessors, (2343), 1340 states have call successors, (2343) [2023-11-29 03:53:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21317 states to 21317 states and 24365 transitions. [2023-11-29 03:53:41,785 INFO L78 Accepts]: Start accepts. Automaton has 21317 states and 24365 transitions. Word has length 176 [2023-11-29 03:53:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:41,785 INFO L495 AbstractCegarLoop]: Abstraction has 21317 states and 24365 transitions. [2023-11-29 03:53:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21317 states and 24365 transitions. [2023-11-29 03:53:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:41,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:41,791 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:41,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:41,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 03:53:41,992 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:41,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash 788306185, now seen corresponding path program 1 times [2023-11-29 03:53:41,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:41,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391007007] [2023-11-29 03:53:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:53:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-29 03:53:42,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391007007] [2023-11-29 03:53:42,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391007007] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:42,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788050914] [2023-11-29 03:53:42,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:42,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:42,084 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:42,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-29 03:53:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:42,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:53:42,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 03:53:42,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788050914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:42,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:42,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:53:42,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396339682] [2023-11-29 03:53:42,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:42,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:42,204 INFO L87 Difference]: Start difference. First operand 21317 states and 24365 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:43,262 INFO L93 Difference]: Finished difference Result 37540 states and 43445 transitions. [2023-11-29 03:53:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:43,263 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:43,283 INFO L225 Difference]: With dead ends: 37540 [2023-11-29 03:53:43,283 INFO L226 Difference]: Without dead ends: 16233 [2023-11-29 03:53:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:43,296 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 11 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 504 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16233 states. [2023-11-29 03:53:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16233 to 16213. [2023-11-29 03:53:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16213 states, 14068 states have (on average 1.0934745521751492) internal successors, (15383), 14280 states have internal predecessors, (15383), 1060 states have call successors, (1060), 799 states have call predecessors, (1060), 1084 states have return successors, (1623), 1134 states have call predecessors, (1623), 1060 states have call successors, (1623) [2023-11-29 03:53:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16213 states to 16213 states and 18066 transitions. [2023-11-29 03:53:44,313 INFO L78 Accepts]: Start accepts. Automaton has 16213 states and 18066 transitions. Word has length 176 [2023-11-29 03:53:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:44,313 INFO L495 AbstractCegarLoop]: Abstraction has 16213 states and 18066 transitions. [2023-11-29 03:53:44,313 INFO L496 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16213 states and 18066 transitions. [2023-11-29 03:53:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 03:53:44,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:44,317 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:44,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-29 03:53:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-11-29 03:53:44,517 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:44,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2092493771, now seen corresponding path program 1 times [2023-11-29 03:53:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590803081] [2023-11-29 03:53:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 03:53:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-29 03:53:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:53:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 03:53:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-29 03:53:44,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590803081] [2023-11-29 03:53:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590803081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:53:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142725658] [2023-11-29 03:53:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:53:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:53:44,606 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:53:44,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-29 03:53:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:44,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:53:44,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:53:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-29 03:53:44,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:53:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142725658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:53:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:53:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941874660] [2023-11-29 03:53:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:53:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:53:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:44,710 INFO L87 Difference]: Start difference. First operand 16213 states and 18066 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:45,162 INFO L93 Difference]: Finished difference Result 22436 states and 25087 transitions. [2023-11-29 03:53:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:53:45,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 176 [2023-11-29 03:53:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:45,167 INFO L225 Difference]: With dead ends: 22436 [2023-11-29 03:53:45,168 INFO L226 Difference]: Without dead ends: 3847 [2023-11-29 03:53:45,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:53:45,180 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:45,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:53:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2023-11-29 03:53:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3847. [2023-11-29 03:53:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3342 states have (on average 1.071214841412328) internal successors, (3580), 3361 states have internal predecessors, (3580), 287 states have call successors, (287), 201 states have call predecessors, (287), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2023-11-29 03:53:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 4170 transitions. [2023-11-29 03:53:45,426 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 4170 transitions. Word has length 176 [2023-11-29 03:53:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:45,426 INFO L495 AbstractCegarLoop]: Abstraction has 3847 states and 4170 transitions. [2023-11-29 03:53:45,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 03:53:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 4170 transitions. [2023-11-29 03:53:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-11-29 03:53:45,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:53:45,430 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:53:45,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-29 03:53:45,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 03:53:45,630 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:53:45,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:53:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2123120919, now seen corresponding path program 1 times [2023-11-29 03:53:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:53:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151786579] [2023-11-29 03:53:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:53:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:53:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 03:53:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 03:53:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 03:53:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 03:53:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 03:53:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 03:53:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 03:53:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 03:53:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 03:53:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 03:53:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 03:53:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-29 03:53:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:53:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-11-29 03:53:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:53:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151786579] [2023-11-29 03:53:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151786579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:53:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:53:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:53:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417245911] [2023-11-29 03:53:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:53:45,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:53:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:53:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:53:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:53:45,871 INFO L87 Difference]: Start difference. First operand 3847 states and 4170 transitions. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-29 03:53:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:53:47,434 INFO L93 Difference]: Finished difference Result 3991 states and 4314 transitions. [2023-11-29 03:53:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:53:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 253 [2023-11-29 03:53:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:53:47,435 INFO L225 Difference]: With dead ends: 3991 [2023-11-29 03:53:47,435 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 03:53:47,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:53:47,438 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1002 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:53:47,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1080 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:53:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 03:53:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 03:53:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:53:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 03:53:47,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2023-11-29 03:53:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:53:47,439 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 03:53:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 6 states have internal predecessors, (131), 6 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-29 03:53:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 03:53:47,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 03:53:47,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:53:47,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 03:53:47,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 03:54:55,022 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 858 DAG size of output: 135 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 03:55:24,835 WARN L293 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 1603 DAG size of output: 149 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 03:55:42,290 WARN L293 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 1030 DAG size of output: 144 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 03:56:03,120 WARN L293 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 1030 DAG size of output: 144 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L547-2(lines 547 551) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 543) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L539-2(lines 539 543) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 255) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L246-2(lines 246 255) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 214) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L238(lines 226 240) no Hoare annotation was computed. [2023-11-29 03:56:29,259 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2023-11-29 03:56:29,260 INFO L899 garLoopResultBuilder]: For program point L276(lines 264 278) no Hoare annotation was computed. [2023-11-29 03:56:29,260 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 236) no Hoare annotation was computed. [2023-11-29 03:56:29,260 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 236) no Hoare annotation was computed. [2023-11-29 03:56:29,260 INFO L899 garLoopResultBuilder]: For program point L219(lines 207 221) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 521 563) the Hoare annotation is: (let ((.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= |old(~t2_st~0)| ~t2_st~0)) (.cse4 (= |old(~t3_st~0)| ~t3_st~0)) (.cse41 (= ~m_st~0 |old(~m_st~0)|)) (.cse42 (= ~t1_st~0 0)) (.cse43 (= 0 ~t2_st~0)) (.cse44 (= 0 ~t3_st~0))) (let ((.cse38 (and .cse41 .cse42 .cse43 .cse44)) (.cse31 (and .cse41 .cse3 .cse42 .cse4)) (.cse40 (not (= ~token~0 (+ 2 ~local~0)))) (.cse37 (and .cse2 .cse41 .cse3 .cse44)) (.cse35 (not (= ~token~0 ~local~0))) (.cse22 (and .cse2 .cse41 .cse3 .cse4)) (.cse15 (not (= ~token~0 (+ 3 ~local~0)))) (.cse34 (and .cse2 .cse41 .cse43 .cse44)) (.cse30 (< 0 ~t1_pc~0)) (.cse32 (not (= |old(~t3_st~0)| 0))) (.cse11 (< |old(~t2_st~0)| 2)) (.cse33 (< 0 ~t3_pc~0)) (.cse39 (and .cse41 .cse3 .cse42 .cse44)) (.cse7 (< |old(~t1_st~0)| 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (< ~E_M~0 2)) (.cse27 (and .cse2 .cse41 .cse4 .cse43)) (.cse14 (< |old(~t3_st~0)| 2)) (.cse19 (not (= ~t2_pc~0 1))) (.cse24 (not (= (+ ~local~0 1) ~token~0))) (.cse0 (< ~T1_E~0 2)) (.cse29 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~t2_i~0 1))) (.cse5 (= ~E_2~0 1)) (.cse6 (not (= ~t3_pc~0 1))) (.cse25 (not (= |old(~t2_st~0)| 0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse26 (not (= ~m_pc~0 0))) (.cse12 (not (= ~t1_i~0 1))) (.cse13 (< ~T3_E~0 2)) (.cse23 (< |old(~m_st~0)| 2)) (.cse28 (< 0 ~t2_pc~0)) (.cse16 (< ~E_1~0 2)) (.cse17 (< ~T2_E~0 2)) (.cse18 (< ~E_3~0 2)) (.cse36 (and .cse41 .cse42 .cse4 .cse43)) (.cse20 (= ~E_2~0 0)) (.cse21 (not (= ~t3_i~0 1)))) (and (or .cse0 .cse1 (and .cse2 (= ~m_st~0 0) .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |old(~m_st~0)| 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse24 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse5 .cse6 .cse25 .cse7 .cse9 .cse26 .cse12 .cse27 .cse13 .cse23 .cse28 .cse16 .cse17 .cse18 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse31 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse5 .cse25 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse28 .cse33 .cse17 .cse18 .cse34 .cse20 .cse21 .cse35) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse25 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19 .cse36 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse25 .cse8 .cse9 .cse10 .cse12 .cse13 .cse23 .cse28 .cse33 .cse16 .cse17 .cse18 .cse34 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse37 .cse18 .cse19 .cse24 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse38 .cse5 .cse25 .cse10 .cse26 .cse12 .cse13 .cse28 .cse33 .cse17 .cse18 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse5 .cse10 .cse26 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse5 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse37 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse5 .cse6 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse37 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse25 .cse8 .cse10 .cse12 .cse13 .cse14 .cse23 .cse28 .cse16 .cse17 .cse18 .cse36 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse5 .cse7 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse33 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse38 .cse5 .cse25 .cse8 .cse10 .cse12 .cse13 .cse23 .cse28 .cse33 .cse16 .cse17 .cse18 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse5 .cse6 .cse9 .cse10 .cse26 .cse12 .cse13 .cse14 .cse31 .cse23 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse10 .cse26 .cse12 .cse13 .cse14 .cse31 .cse23 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse6 .cse25 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse23 .cse28 .cse16 .cse17 .cse18 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse26 .cse11 .cse12 .cse13 .cse31 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse9 .cse26 .cse11 .cse12 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse40 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse37 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse5 .cse6 .cse25 .cse7 .cse9 .cse26 .cse12 .cse27 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse6 .cse25 .cse9 .cse10 .cse26 .cse12 .cse27 .cse13 .cse14 .cse23 .cse28 .cse16 .cse17 .cse18 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse32 .cse6 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse23 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse5 .cse6 .cse10 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse31 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse25 .cse26 .cse12 .cse13 .cse23 .cse28 .cse16 .cse17 .cse18 .cse36 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse5 .cse10 .cse26 .cse11 .cse12 .cse13 .cse33 .cse17 .cse18 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse32 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse18 .cse19 .cse39 .cse20 .cse21 .cse35) (or .cse0 .cse29 .cse1 .cse5 .cse6 .cse9 .cse26 .cse11 .cse12 .cse13 .cse31 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse40 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse5 .cse6 .cse25 .cse10 .cse26 .cse12 .cse13 .cse14 .cse28 .cse17 .cse18 .cse36 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse6 .cse25 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse25 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse18 .cse19 .cse34 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse6 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse32 .cse5 .cse6 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse6 .cse25 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse28 .cse16 .cse17 .cse18 .cse34 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19 .cse36 .cse20 .cse21) (or .cse0 .cse1 .cse5 .cse6 .cse25 .cse7 .cse9 .cse10 .cse26 .cse12 .cse27 .cse13 .cse14 .cse28 .cse17 .cse18 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse6 .cse25 .cse9 .cse10 .cse26 .cse12 .cse27 .cse13 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse37 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse32 .cse5 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19 .cse20 .cse21 .cse35) (or .cse0 .cse1 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse32 .cse25 .cse9 .cse10 .cse26 .cse12 .cse13 .cse23 .cse28 .cse33 .cse16 .cse17 .cse18 .cse34 .cse20 .cse21) (or .cse0 .cse29 .cse30 .cse1 .cse32 .cse5 .cse8 .cse10 .cse11 .cse12 .cse13 .cse23 .cse33 .cse16 .cse17 .cse18 .cse19 .cse39 .cse20 .cse21) (or .cse0 .cse1 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse23 .cse16 .cse17 .cse18 .cse19 .cse24 .cse20 .cse21) (or .cse0 .cse29 .cse1 .cse5 .cse6 .cse25 .cse9 .cse26 .cse12 .cse13 .cse23 .cse28 .cse16 .cse17 .cse18 .cse36 .cse20 .cse21)))) [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 274) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L265-2(lines 265 274) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L257(lines 245 259) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 217) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L208-2(lines 208 217) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 559) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 521 563) no Hoare annotation was computed. [2023-11-29 03:56:29,263 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 271) no Hoare annotation was computed. [2023-11-29 03:56:29,264 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 521 563) no Hoare annotation was computed. [2023-11-29 03:56:29,264 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 551) no Hoare annotation was computed. [2023-11-29 03:56:29,264 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 564 574) no Hoare annotation was computed. [2023-11-29 03:56:29,264 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 564 574) no Hoare annotation was computed. [2023-11-29 03:56:29,265 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 564 574) the Hoare annotation is: (let ((.cse37 (= 0 ~t3_st~0)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= 0 ~t2_st~0)) (.cse34 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse35 (= ~t1_st~0 0)) (.cse39 (= |old(~t3_st~0)| ~t3_st~0))) (let ((.cse16 (not (= (+ ~local~0 1) ~token~0))) (.cse27 (and .cse34 .cse41 .cse35 .cse39)) (.cse26 (< 0 ~t1_pc~0)) (.cse23 (and .cse40 .cse34 .cse39 .cse36)) (.cse33 (and .cse40 .cse34 .cse41 .cse37)) (.cse38 (and .cse34 .cse41 .cse35 .cse37)) (.cse10 (< |old(~t3_st~0)| 2)) (.cse31 (not (= ~token~0 ~local~0))) (.cse2 (and .cse40 .cse34 .cse41 .cse39)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse7 (< |old(~t2_st~0)| 2)) (.cse15 (not (= ~t2_pc~0 1))) (.cse28 (not (= |old(~t3_st~0)| 0))) (.cse6 (< ~E_M~0 2)) (.cse29 (< 0 ~t3_pc~0)) (.cse30 (and .cse40 .cse34 .cse36 .cse37)) (.cse0 (< ~T1_E~0 2)) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~t2_i~0 1))) (.cse19 (= ~E_2~0 1)) (.cse3 (not (= ~t3_pc~0 1))) (.cse20 (not (= |old(~t2_st~0)| 0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse22 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (< ~T3_E~0 2)) (.cse11 (< |old(~m_st~0)| 2)) (.cse24 (< 0 ~t2_pc~0)) (.cse12 (< ~E_1~0 2)) (.cse13 (< ~T2_E~0 2)) (.cse14 (< ~E_3~0 2)) (.cse32 (and .cse34 .cse35 .cse39 .cse36)) (.cse17 (= ~E_2~0 0)) (.cse18 (not (= ~t3_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse3 .cse20 .cse21 .cse5 .cse22 .cse8 .cse23 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse19 .cse20 .cse21 .cse5 .cse6 .cse22 .cse8 .cse9 .cse24 .cse29 .cse13 .cse14 .cse30 .cse17 .cse18 .cse31) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse20 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse20 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse24 .cse29 .cse12 .cse13 .cse14 .cse30 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse33 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse28 (and .cse34 .cse35 .cse36 .cse37) .cse19 .cse20 .cse6 .cse22 .cse8 .cse9 .cse24 .cse29 .cse13 .cse14 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse28 .cse19 .cse6 .cse22 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse15 .cse38 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse19 .cse21 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse33 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse19 .cse3 .cse21 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse33 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse19 .cse21 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse29 .cse13 .cse33 .cse14 .cse15 .cse17 .cse18 .cse31) (or .cse0 .cse25 .cse1 .cse19 .cse3 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse6 .cse22 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse3 .cse20 .cse4 .cse5 .cse6 .cse8 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse22 .cse7 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse5 .cse22 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 (not (= ~token~0 (+ 2 ~local~0))) .cse2 .cse19 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse19 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse33 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse3 .cse20 .cse21 .cse5 .cse22 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse22 .cse8 .cse23 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse17 .cse18 .cse31) (or .cse0 .cse1 .cse28 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse33 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse28 .cse19 .cse3 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse38 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse20 .cse22 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse32 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse28 .cse19 .cse6 .cse22 .cse7 .cse8 .cse9 .cse29 .cse13 .cse14 .cse15 .cse38 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse19 .cse3 .cse5 .cse22 .cse7 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (or .cse0 .cse25 .cse26 .cse1 .cse19 .cse3 .cse20 .cse6 .cse22 .cse8 .cse9 .cse10 .cse24 .cse13 .cse14 .cse32 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse3 .cse20 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse20 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse30 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse28 .cse19 .cse3 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse38 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse3 .cse20 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse30 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse19 .cse3 .cse20 .cse5 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse3 .cse20 .cse21 .cse5 .cse6 .cse22 .cse8 .cse23 .cse9 .cse10 .cse24 .cse13 .cse14 .cse17 .cse18 .cse31) (or .cse0 .cse1 .cse3 .cse20 .cse5 .cse6 .cse22 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse33 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse28 .cse19 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse29 .cse12 .cse13 .cse15 .cse38 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse17 .cse18 .cse31) (or .cse0 .cse1 .cse2 .cse19 .cse3 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 (not (= ~token~0 (+ 3 ~local~0))) .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (or .cse0 .cse1 .cse28 .cse20 .cse5 .cse6 .cse22 .cse8 .cse9 .cse11 .cse24 .cse29 .cse12 .cse13 .cse14 .cse30 .cse17 .cse18) (or .cse0 .cse25 .cse1 .cse19 .cse3 .cse20 .cse5 .cse22 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse32 .cse17 .cse18)))) [2023-11-29 03:56:29,265 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 340) no Hoare annotation was computed. [2023-11-29 03:56:29,265 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 316 345) no Hoare annotation was computed. [2023-11-29 03:56:29,265 INFO L899 garLoopResultBuilder]: For program point L342(lines 319 344) no Hoare annotation was computed. [2023-11-29 03:56:29,265 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 337) no Hoare annotation was computed. [2023-11-29 03:56:29,265 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 316 345) the Hoare annotation is: true [2023-11-29 03:56:29,266 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 338) no Hoare annotation was computed. [2023-11-29 03:56:29,266 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 339) no Hoare annotation was computed. [2023-11-29 03:56:29,266 INFO L899 garLoopResultBuilder]: For program point L444-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,266 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,266 INFO L899 garLoopResultBuilder]: For program point L459-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 425 472) the Hoare annotation is: (let ((.cse29 (not (= (+ ~local~0 1) ~token~0))) (.cse22 (< ~t2_st~0 2)) (.cse27 (not (= ~m_st~0 0))) (.cse20 (not (= ~token~0 ~local~0))) (.cse21 (not (= ~t2_pc~0 1))) (.cse26 (< 0 ~t1_pc~0)) (.cse23 (not (= ~t3_pc~0 1))) (.cse2 (not (= ~m_pc~0 1))) (.cse25 (< ~t3_st~0 2)) (.cse16 (not (= ~t1_st~0 0))) (.cse28 (< ~t1_st~0 2)) (.cse0 (not (= ~t2_i~0 1))) (.cse1 (< ~m_st~0 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse24 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse7 (< 0 ~t2_pc~0)) (.cse8 (< 0 ~t3_pc~0)) (.cse9 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))) (.cse10 (= |old(~E_2~0)| 1)) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (< |old(~T2_E~0)| 2)) (.cse13 (< |old(~T3_E~0)| 2)) (.cse14 (not (= 0 ~t3_st~0))) (.cse15 (= |old(~E_2~0)| 0)) (.cse17 (< |old(~E_3~0)| 2)) (.cse18 (< |old(~T1_E~0)| 2)) (.cse19 (not (= ~t3_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse27 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse23 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse27 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse28 .cse0 (not (= ~token~0 (+ 2 ~local~0))) .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 (not (= ~token~0 (+ 3 ~local~0))) .cse12 .cse27 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse2 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse27 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse29 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse21 .cse17 .cse29 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19))) [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 425 472) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 425 472) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L429-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 428 471) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 280 287) no Hoare annotation was computed. [2023-11-29 03:56:29,267 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 280 287) the Hoare annotation is: true [2023-11-29 03:56:29,267 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 473 520) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L477-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L502-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L492-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 473 520) the Hoare annotation is: (let ((.cse29 (not (= (+ ~local~0 1) ~token~0))) (.cse22 (< ~t2_st~0 2)) (.cse27 (not (= ~m_st~0 0))) (.cse20 (not (= ~token~0 ~local~0))) (.cse21 (not (= ~t2_pc~0 1))) (.cse26 (< 0 ~t1_pc~0)) (.cse23 (not (= ~t3_pc~0 1))) (.cse2 (not (= ~m_pc~0 1))) (.cse25 (< ~t3_st~0 2)) (.cse16 (not (= ~t1_st~0 0))) (.cse28 (< ~t1_st~0 2)) (.cse0 (not (= ~t2_i~0 1))) (.cse1 (< ~m_st~0 2)) (.cse3 (not (= ~t1_pc~0 1))) (.cse24 (not (= ~m_pc~0 0))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (< |old(~E_1~0)| 2)) (.cse6 (< |old(~E_M~0)| 2)) (.cse7 (< 0 ~t2_pc~0)) (.cse8 (< 0 ~t3_pc~0)) (.cse9 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))) (.cse10 (= |old(~E_2~0)| 1)) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (< |old(~T2_E~0)| 2)) (.cse13 (< |old(~T3_E~0)| 2)) (.cse14 (not (= 0 ~t3_st~0))) (.cse15 (= |old(~E_2~0)| 0)) (.cse17 (< |old(~E_3~0)| 2)) (.cse18 (< |old(~T1_E~0)| 2)) (.cse19 (not (= ~t3_i~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse27 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse23 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse27 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse28 .cse0 (not (= ~token~0 (+ 2 ~local~0))) .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 (not (= ~token~0 (+ 3 ~local~0))) .cse12 .cse27 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse2 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse27 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse29 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse21 .cse17 .cse29 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse12 .cse13 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse27 .cse13 .cse14 .cse15 .cse21 .cse17 .cse22 .cse18 .cse19 .cse20) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse22 .cse18 .cse19) (or .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse24 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse1 .cse24 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18 .cse19) (or .cse26 .cse0 .cse23 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19))) [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L507-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,268 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 473 520) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L487-1(lines 476 519) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 706) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 697 706) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 663 721) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L598-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L302-1(lines 291 314) no Hoare annotation was computed. [2023-11-29 03:56:29,269 INFO L895 garLoopResultBuilder]: At program point L121(line 121) the Hoare annotation is: (let ((.cse22 (= (+ ~local~0 1) ~token~0)) (.cse19 (<= 2 ~t3_st~0)) (.cse17 (= ~m_pc~0 1)) (.cse21 (<= 2 ~t2_st~0)) (.cse15 (= ~t3_pc~0 1)) (.cse20 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 0))) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~m_pc~0 0)) (.cse18 (<= ~t3_pc~0 0)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= ~t3_i~0 1)) (.cse14 (= 0 ~t3_st~0)) (.cse16 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse18 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse21 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse17 .cse9 .cse10 .cse18 .cse21 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse18 .cse21 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse21 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse20 .cse17 .cse9 .cse10 .cse21 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14 .cse16))) [2023-11-29 03:56:29,269 INFO L899 garLoopResultBuilder]: For program point L121-1(line 121) no Hoare annotation was computed. [2023-11-29 03:56:29,270 INFO L895 garLoopResultBuilder]: At program point L650(line 650) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,270 INFO L899 garLoopResultBuilder]: For program point L650-1(line 650) no Hoare annotation was computed. [2023-11-29 03:56:29,270 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 96 131) no Hoare annotation was computed. [2023-11-29 03:56:29,271 INFO L895 garLoopResultBuilder]: At program point L353(line 353) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,271 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-11-29 03:56:29,271 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 180) no Hoare annotation was computed. [2023-11-29 03:56:29,271 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-11-29 03:56:29,271 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse7 (<= 2 ~t3_st~0)) (.cse17 (= ~t3_pc~0 1)) (.cse18 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~t2_pc~0 1)) (.cse11 (<= 2 ~E_3~0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse20 (<= ~t3_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (<= 2 ~t2_st~0)) (.cse16 (= ~t3_i~0 1)) (.cse22 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse19 .cse11 .cse12 .cse13 .cse20 .cse21 .cse16 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 1) .cse11 .cse12 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse21 .cse14 .cse16 .cse17 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse19 .cse11 .cse12 .cse13 .cse21 .cse16 .cse17 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse14 .cse16 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse22))) [2023-11-29 03:56:29,271 INFO L899 garLoopResultBuilder]: For program point L618-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,271 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-11-29 03:56:29,272 INFO L895 garLoopResultBuilder]: At program point L701(line 701) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,272 INFO L899 garLoopResultBuilder]: For program point L701-1(line 701) no Hoare annotation was computed. [2023-11-29 03:56:29,272 INFO L895 garLoopResultBuilder]: At program point L404-1(lines 352 418) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,272 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 657) no Hoare annotation was computed. [2023-11-29 03:56:29,272 INFO L899 garLoopResultBuilder]: For program point L355(line 355) no Hoare annotation was computed. [2023-11-29 03:56:29,272 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 03:56:29,272 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 52 95) no Hoare annotation was computed. [2023-11-29 03:56:29,273 INFO L895 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: (let ((.cse18 (<= 2 ~t3_st~0)) (.cse17 (<= ~t1_pc~0 0)) (.cse16 (= ~t3_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse21 (= ~m_pc~0 1)) (.cse12 (= ~t2_i~0 1)) (.cse19 (<= ~t3_pc~0 0)) (.cse14 (= ~t3_i~0 1)) (.cse15 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse21 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse15) (and .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse21 .cse12 .cse19 .cse14 .cse15))) [2023-11-29 03:56:29,273 INFO L899 garLoopResultBuilder]: For program point L157-1(line 157) no Hoare annotation was computed. [2023-11-29 03:56:29,273 INFO L899 garLoopResultBuilder]: For program point L603-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L895 garLoopResultBuilder]: At program point L686(line 686) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L686-1(line 686) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L307-1(lines 288 315) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 179) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 592) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point $Ultimate##40(lines 81 87) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L390-1(lines 352 418) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L357-1(lines 352 418) no Hoare annotation was computed. [2023-11-29 03:56:29,274 INFO L895 garLoopResultBuilder]: At program point L671(line 671) the Hoare annotation is: (and (= ~t1_i~0 1) (<= 2 ~T3_E~0) (= ~m_st~0 0) (= ~T2_E~0 2) (= ~E_3~0 2) (<= ~t1_pc~0 0) (not (= ~E_2~0 1)) (not (= ~E_2~0 0)) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~m_pc~0 0) (<= ~t3_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~t3_i~0 1) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2023-11-29 03:56:29,274 INFO L899 garLoopResultBuilder]: For program point L671-1(line 671) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 414) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point L407-2(lines 407 414) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point L292(lines 292 296) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point L292-2(lines 291 314) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L895 garLoopResultBuilder]: At program point L193(line 193) the Hoare annotation is: (let ((.cse18 (<= 2 ~t1_st~0)) (.cse17 (<= 2 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (<= ~t2_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~T3_E~0)) (.cse5 (<= 2 ~m_st~0)) (.cse19 (<= ~t1_pc~0 0)) (.cse6 (not (= ~E_2~0 1))) (.cse7 (not (= ~E_2~0 0))) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~t2_pc~0 1)) (.cse11 (<= 2 ~E_3~0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~t3_i~0 1)) (.cse16 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse17 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse15 .cse16) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (= ~m_pc~0 1) .cse11 .cse12 (= ~token~0 (+ 3 ~local~0)) .cse17 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point L193-1(line 193) no Hoare annotation was computed. [2023-11-29 03:56:29,275 INFO L899 garLoopResultBuilder]: For program point transmit3_returnLabel#1(lines 168 203) no Hoare annotation was computed. [2023-11-29 03:56:29,276 INFO L895 garLoopResultBuilder]: At program point L111-1(lines 111 124) the Hoare annotation is: (let ((.cse18 (<= 2 ~t2_st~0)) (.cse24 (= (+ ~local~0 1) ~token~0)) (.cse23 (= ~m_pc~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (= ~t2_pc~0 1)) (.cse19 (<= ~t3_pc~0 0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~T2_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~T3_E~0)) (.cse21 (= ~m_st~0 0)) (.cse6 (not (= ~E_2~0 1))) (.cse20 (<= 2 ~t3_st~0)) (.cse7 (not (= ~E_2~0 0))) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (<= 2 ~E_3~0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse13 (= ~t3_i~0 1)) (.cse15 (= ~t3_pc~0 1)) (.cse16 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse19 .cse22 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse20 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse22 .cse18 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse22 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse23 .cse9 .cse10 .cse19 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse19 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse17 .cse23 .cse9 .cse10 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse17 .cse23 .cse9 .cse10 .cse18 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse23 .cse9 .cse10 .cse19 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse15 .cse16))) [2023-11-29 03:56:29,276 INFO L899 garLoopResultBuilder]: For program point L623-1(lines 584 631) no Hoare annotation was computed. [2023-11-29 03:56:29,276 INFO L895 garLoopResultBuilder]: At program point L673(line 673) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T3_E~0)) (.cse2 (= ~T2_E~0 2)) (.cse3 (= ~E_3~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (not (= ~E_2~0 1))) (.cse6 (not (= ~E_2~0 0))) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~m_pc~0 0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (= ~t3_i~0 1)) (.cse15 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0)) (.cse17 (= ~M_E~0 2)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2023-11-29 03:56:29,276 INFO L895 garLoopResultBuilder]: At program point L673-1(line 673) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T3_E~0)) (.cse2 (= ~T2_E~0 2)) (.cse3 (= ~E_3~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (not (= ~E_2~0 1))) (.cse6 (not (= ~E_2~0 0))) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~m_pc~0 0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (= ~t3_i~0 1)) (.cse15 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0)) (.cse17 (= ~M_E~0 2)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2023-11-29 03:56:29,276 INFO L899 garLoopResultBuilder]: For program point L376-1(lines 352 418) no Hoare annotation was computed. [2023-11-29 03:56:29,277 INFO L895 garLoopResultBuilder]: At program point L690(line 690) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,277 INFO L895 garLoopResultBuilder]: At program point L690-1(line 690) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,277 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 03:56:29,277 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 400) no Hoare annotation was computed. [2023-11-29 03:56:29,277 INFO L899 garLoopResultBuilder]: For program point L393-2(lines 393 400) no Hoare annotation was computed. [2023-11-29 03:56:29,278 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 132 167) no Hoare annotation was computed. [2023-11-29 03:56:29,278 INFO L895 garLoopResultBuilder]: At program point L674(line 674) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T3_E~0)) (.cse2 (= ~T2_E~0 2)) (.cse3 (= ~E_3~0 2)) (.cse4 (<= ~t1_pc~0 0)) (.cse5 (not (= ~E_2~0 1))) (.cse6 (not (= ~E_2~0 0))) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~m_pc~0 0)) (.cse11 (<= ~t3_pc~0 0)) (.cse12 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse14 (= ~t3_i~0 1)) (.cse15 (= ~E_1~0 2)) (.cse16 (= 0 ~t3_st~0)) (.cse17 (= ~M_E~0 2)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~m_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2023-11-29 03:56:29,278 INFO L899 garLoopResultBuilder]: For program point L608-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,278 INFO L895 garLoopResultBuilder]: At program point L691(line 691) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,278 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 346 424) no Hoare annotation was computed. [2023-11-29 03:56:29,279 INFO L895 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,279 INFO L899 garLoopResultBuilder]: For program point L659(lines 648 661) no Hoare annotation was computed. [2023-11-29 03:56:29,279 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 160) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse6 (<= ~t1_pc~0 0)) (.cse23 (= ~m_pc~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse22 (= ~t3_pc~0 1)) (.cse17 (= ~t1_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~T2_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~T3_E~0)) (.cse5 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (<= 2 ~E_3~0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (<= ~t3_pc~0 0)) (.cse15 (= ~t3_i~0 1)) (.cse16 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse20 .cse15 .cse22) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse23 .cse11 .cse12 .cse15 .cse22) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse22) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse14 .cse20 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse15 .cse22) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse22) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse23 .cse11 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse15 .cse16 .cse22) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse20 .cse15 .cse22) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse22) (and .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-29 03:56:29,279 INFO L895 garLoopResultBuilder]: At program point L81-1(lines 67 88) the Hoare annotation is: (let ((.cse21 (<= ~t3_pc~0 0)) (.cse22 (= 0 ~t3_st~0)) (.cse18 (= 0 ~t2_st~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse23 (<= ~t1_pc~0 0)) (.cse24 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T3_E~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (<= 2 ~t3_st~0)) (.cse9 (not (= ~E_2~0 0))) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse17 (= ~m_pc~0 0)) (.cse19 (= ~token~0 ~local~0)) (.cse14 (<= 2 ~t2_st~0)) (.cse15 (= ~t3_i~0 1)) (.cse16 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 1) .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse17 .cse18 .cse19 .cse15 .cse16 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse17 .cse21 .cse18 .cse19 .cse15 .cse22 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse17 .cse21 .cse14 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse21 .cse19 .cse14 .cse15 .cse22) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse24 .cse12 .cse13 .cse17 .cse21 .cse18 .cse15 .cse22 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse17 .cse18 .cse15 .cse16 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse19 .cse14 .cse15 .cse16))) [2023-11-29 03:56:29,279 INFO L899 garLoopResultBuilder]: For program point L593-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,279 INFO L899 garLoopResultBuilder]: For program point L362-1(lines 352 418) no Hoare annotation was computed. [2023-11-29 03:56:29,279 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 386) no Hoare annotation was computed. [2023-11-29 03:56:29,279 INFO L899 garLoopResultBuilder]: For program point L379-2(lines 379 386) no Hoare annotation was computed. [2023-11-29 03:56:29,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-29 03:56:29,280 INFO L899 garLoopResultBuilder]: For program point L297-1(lines 291 314) no Hoare annotation was computed. [2023-11-29 03:56:29,280 INFO L899 garLoopResultBuilder]: For program point L710(lines 710 714) no Hoare annotation was computed. [2023-11-29 03:56:29,280 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 678 715) the Hoare annotation is: (let ((.cse26 (= (+ ~local~0 1) ~token~0)) (.cse28 (= ~m_st~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse21 (<= 2 ~t3_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse16 (<= 2 ~t2_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse15 (<= ~t3_pc~0 0)) (.cse25 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~T2_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T3_E~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_2~0 0))) (.cse9 (<= 2 ~T1_E~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse19 (= 0 ~t2_st~0)) (.cse17 (= ~t3_i~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse22 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse27 .cse17 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse16 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse7 .cse21 .cse8 .cse9 .cse12 .cse13 .cse14 .cse19 .cse27 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse22 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse28 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 (= ~token~0 (+ 2 ~local~0)) .cse13 .cse16 .cse17 .cse18 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse12 .cse13 .cse15 .cse19 .cse17 .cse18 .cse25) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse19 .cse17 .cse18 .cse22))) [2023-11-29 03:56:29,280 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 108) no Hoare annotation was computed. [2023-11-29 03:56:29,280 INFO L899 garLoopResultBuilder]: For program point L695(line 695) no Hoare annotation was computed. [2023-11-29 03:56:29,281 INFO L895 garLoopResultBuilder]: At program point L183-1(lines 183 196) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~m_st~0)) (.cse21 (= ~m_pc~0 1)) (.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~T2_E~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 2 ~T3_E~0)) (.cse7 (= ~m_st~0 0)) (.cse19 (<= ~t1_pc~0 0)) (.cse8 (not (= ~E_2~0 1))) (.cse9 (not (= ~E_2~0 0))) (.cse10 (<= 2 ~T1_E~0)) (.cse20 (= ~t1_st~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (<= 2 ~E_3~0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (<= 2 ~t2_st~0)) (.cse17 (= ~t3_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse9 .cse10 .cse20 .cse21 .cse12 .cse13 .cse22 .cse17 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse16 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse22 .cse15 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse17 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse22 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse22 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse22 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 (= ~token~0 (+ 3 ~local~0)) .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse20 .cse21 .cse12 .cse13 .cse22 .cse15 .cse17 .cse23) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse22 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse22 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse16 .cse17) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse21 .cse12 .cse13 .cse22 .cse17 .cse23) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-11-29 03:56:29,281 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 372) no Hoare annotation was computed. [2023-11-29 03:56:29,281 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 365 372) no Hoare annotation was computed. [2023-11-29 03:56:29,281 INFO L899 garLoopResultBuilder]: For program point L613-1(lines 587 630) no Hoare annotation was computed. [2023-11-29 03:56:29,283 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:56:29,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:56:29,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:56:29 BoogieIcfgContainer [2023-11-29 03:56:29,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:56:29,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:56:29,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:56:29,371 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:56:29,372 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:50:23" (3/4) ... [2023-11-29 03:56:29,373 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-29 03:56:29,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-29 03:56:29,386 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-29 03:56:29,387 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 03:56:29,388 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 03:56:29,389 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 03:56:29,606 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 03:56:29,606 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 03:56:29,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:56:29,607 INFO L158 Benchmark]: Toolchain (without parser) took 367220.65ms. Allocated memory was 161.5MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 131.1MB in the beginning and 11.5GB in the end (delta: -11.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-29 03:56:29,607 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:56:29,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.37ms. Allocated memory is still 161.5MB. Free memory was 130.9MB in the beginning and 115.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 03:56:29,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.39ms. Allocated memory is still 161.5MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:56:29,608 INFO L158 Benchmark]: Boogie Preprocessor took 53.39ms. Allocated memory is still 161.5MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:56:29,608 INFO L158 Benchmark]: RCFGBuilder took 548.64ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 83.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 03:56:29,609 INFO L158 Benchmark]: TraceAbstraction took 366036.69ms. Allocated memory was 161.5MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 83.0MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 9.0GB. Max. memory is 16.1GB. [2023-11-29 03:56:29,609 INFO L158 Benchmark]: Witness Printer took 234.94ms. Allocated memory is still 13.0GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:56:29,610 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.15ms. Allocated memory is still 121.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.37ms. Allocated memory is still 161.5MB. Free memory was 130.9MB in the beginning and 115.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.39ms. Allocated memory is still 161.5MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.39ms. Allocated memory is still 161.5MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.64ms. Allocated memory is still 161.5MB. Free memory was 110.7MB in the beginning and 83.9MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 366036.69ms. Allocated memory was 161.5MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 83.0MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 9.0GB. Max. memory is 16.1GB. * Witness Printer took 234.94ms. Allocated memory is still 13.0GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 365.9s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.1s, AutomataDifference: 99.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 161.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9980 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9747 mSDsluCounter, 17180 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9307 mSDsCounter, 778 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12260 IncrementalHoareTripleChecker+Invalid, 13038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 778 mSolverCounterUnsat, 7873 mSDtfsCounter, 12260 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5244 GetRequests, 4977 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118656occurred in iteration=22, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 88.0s AutomataMinimizationTime, 38 MinimizatonAttempts, 79275 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 95359 PreInvPairs, 96576 NumberOfFragments, 54364 HoareAnnotationTreeSize, 95359 FomulaSimplifications, 147259 FormulaSimplificationTreeSizeReduction, 61.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 384360 FormulaSimplificationTreeSizeReductionInter, 99.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 9715 NumberOfCodeBlocks, 9715 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 9651 ConstructedInterpolants, 0 QuantifiedInterpolants, 15777 SizeOfPredicates, 4 NumberOfNonLiveVariables, 14849 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 64 InterpolantComputations, 38 PerfectInterpolantSequences, 4819/5679 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == (3 + local))) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1)) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0)) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == (3 + local))) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (token == (2 + local))) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t2_pc <= 0))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t2_pc <= 0))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t2_pc <= 0))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == (3 + local))) && (2 <= t2_st)) && (t3_i == 1))) || ((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t2_pc <= 0))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t2_pc <= 0))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1))) || ((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t2_pc <= 0))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (t3_i == 1)) && (0 == t3_st)) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (token == local)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (token == (2 + local))) && (t2_i == 1)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (t3_i == 1)) && (0 == t3_st))) - InvariantResult [Line: 678]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == (3 + local))) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (token == local)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && ((local + 1) == token)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (t3_pc == 1)) && (t2_pc <= 0))) || ((((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (m_st == 0)) && (t1_pc <= 0)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (token == local)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((2 <= E_1) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && (t1_pc <= 0)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && (2 <= t3_st)) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (2 <= t2_st)) && (t3_i == 1)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t1_st == 0)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || ((((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (m_pc == 1)) && (2 <= E_3)) && (token == (2 + local))) && (t2_i == 1)) && (2 <= t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (m_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (t3_pc <= 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t2_pc <= 0))) || (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (2 <= E_1)) && (2 <= T2_E)) && (t1_i == 1)) && (2 <= E_M)) && (2 <= T3_E)) && (2 <= m_st)) && !((E_2 == 1))) && !((E_2 == 0))) && (2 <= T1_E)) && (t2_pc == 1)) && (2 <= E_3)) && (t2_i == 1)) && (m_pc == 0)) && (0 == t2_st)) && (t3_i == 1)) && (0 == t3_st)) && (t3_pc == 1))) RESULT: Ultimate proved your program to be correct! [2023-11-29 03:56:29,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0a59584-9e23-409e-9b04-bf138681bce3/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE