/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:33:12,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:33:12,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 02:33:12,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:33:12,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:33:13,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:33:13,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:33:13,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:33:13,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:33:13,024 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:33:13,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:33:13,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:33:13,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:33:13,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:33:13,026 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:33:13,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:33:13,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:33:13,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:33:13,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:33:13,029 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:33:13,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:33:13,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:33:13,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:33:13,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:33:13,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:33:13,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:33:13,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:33:13,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:33:13,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:33:13,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:33:13,032 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:33:13,032 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2023-12-22 02:33:13,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:33:13,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:33:13,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:33:13,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:33:13,246 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:33:13,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-22 02:33:14,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:33:14,525 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:33:14,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-22 02:33:14,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be0c0608/0ccbe69b084f42379e67766adc22b6d1/FLAGa1e9f2f40 [2023-12-22 02:33:14,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be0c0608/0ccbe69b084f42379e67766adc22b6d1 [2023-12-22 02:33:14,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:33:14,567 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:33:14,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:33:14,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:33:14,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:33:14,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6afa69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14, skipping insertion in model container [2023-12-22 02:33:14,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:33:14,732 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-22 02:33:14,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-22 02:33:14,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:33:14,797 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:33:14,807 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2023-12-22 02:33:14,822 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2023-12-22 02:33:14,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:33:14,860 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:33:14,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14 WrapperNode [2023-12-22 02:33:14,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:33:14,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:33:14,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:33:14,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:33:14,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,914 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 449 [2023-12-22 02:33:14,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:33:14,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:33:14,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:33:14,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:33:14,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,935 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-12-22 02:33:14,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:33:14,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:33:14,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:33:14,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:33:14,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (1/1) ... [2023-12-22 02:33:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:33:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:33:14,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-22 02:33:15,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-22 02:33:15,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:33:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:33:15,035 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:33:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-22 02:33:15,035 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-22 02:33:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:33:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:33:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-22 02:33:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:33:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:33:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-22 02:33:15,036 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-22 02:33:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:33:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-22 02:33:15,037 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-22 02:33:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-22 02:33:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-22 02:33:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:33:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:33:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:33:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:33:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-22 02:33:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-22 02:33:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:33:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:33:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:33:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:33:15,139 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:33:15,141 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:33:15,569 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:33:15,612 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:33:15,612 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-22 02:33:15,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:33:15 BoogieIcfgContainer [2023-12-22 02:33:15,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:33:15,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:33:15,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:33:15,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:33:15,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:33:14" (1/3) ... [2023-12-22 02:33:15,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bea74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:33:15, skipping insertion in model container [2023-12-22 02:33:15,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:33:14" (2/3) ... [2023-12-22 02:33:15,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bea74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:33:15, skipping insertion in model container [2023-12-22 02:33:15,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:33:15" (3/3) ... [2023-12-22 02:33:15,618 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2023-12-22 02:33:15,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:33:15,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:33:15,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:33:15,676 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;@4870a40e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:33:15,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:33:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-22 02:33:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:15,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:15,689 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] [2023-12-22 02:33:15,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:15,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash -998187491, now seen corresponding path program 1 times [2023-12-22 02:33:15,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998201614] [2023-12-22 02:33:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:15,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:15,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-22 02:33:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:15,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:15,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:15,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:15,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998201614] [2023-12-22 02:33:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998201614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:15,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:15,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:15,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250801665] [2023-12-22 02:33:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:15,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:15,949 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 168 states have internal predecessors, (265), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:16,071 INFO L93 Difference]: Finished difference Result 405 states and 627 transitions. [2023-12-22 02:33:16,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:16,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:16,080 INFO L225 Difference]: With dead ends: 405 [2023-12-22 02:33:16,080 INFO L226 Difference]: Without dead ends: 204 [2023-12-22 02:33:16,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:16,085 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 119 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 438 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-22 02:33:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2023-12-22 02:33:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 163 states have internal predecessors, (239), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-22 02:33:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 297 transitions. [2023-12-22 02:33:16,127 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 297 transitions. Word has length 58 [2023-12-22 02:33:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:16,128 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 297 transitions. [2023-12-22 02:33:16,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 297 transitions. [2023-12-22 02:33:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:16,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:16,130 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] [2023-12-22 02:33:16,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:16,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:16,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:16,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1030398619, now seen corresponding path program 1 times [2023-12-22 02:33:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239205309] [2023-12-22 02:33:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:16,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:16,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:16,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 02:33:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:16,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:33:16,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:16,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:16,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239205309] [2023-12-22 02:33:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239205309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:33:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706550103] [2023-12-22 02:33:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:16,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:16,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:16,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:16,492 INFO L87 Difference]: Start difference. First operand 204 states and 297 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:16,925 INFO L93 Difference]: Finished difference Result 380 states and 550 transitions. [2023-12-22 02:33:16,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:16,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:16,930 INFO L225 Difference]: With dead ends: 380 [2023-12-22 02:33:16,930 INFO L226 Difference]: Without dead ends: 299 [2023-12-22 02:33:16,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:16,931 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 255 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:16,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 601 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 02:33:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-22 02:33:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 292. [2023-12-22 02:33:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 227 states have (on average 1.475770925110132) internal successors, (335), 233 states have internal predecessors, (335), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-12-22 02:33:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 420 transitions. [2023-12-22 02:33:16,956 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 420 transitions. Word has length 58 [2023-12-22 02:33:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:16,956 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 420 transitions. [2023-12-22 02:33:16,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 420 transitions. [2023-12-22 02:33:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:16,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:16,959 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] [2023-12-22 02:33:16,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:17,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:17,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash -60763428, now seen corresponding path program 1 times [2023-12-22 02:33:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:17,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567184609] [2023-12-22 02:33:17,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:17,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:17,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-22 02:33:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:17,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:17,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:17,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:17,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:17,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567184609] [2023-12-22 02:33:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567184609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:33:17,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252906624] [2023-12-22 02:33:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:17,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:33:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:17,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:33:17,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:17,257 INFO L87 Difference]: Start difference. First operand 292 states and 420 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:17,340 INFO L93 Difference]: Finished difference Result 463 states and 660 transitions. [2023-12-22 02:33:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-12-22 02:33:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:17,342 INFO L225 Difference]: With dead ends: 463 [2023-12-22 02:33:17,343 INFO L226 Difference]: Without dead ends: 301 [2023-12-22 02:33:17,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:17,344 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 6 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:17,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1360 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-12-22 02:33:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2023-12-22 02:33:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 236 states have internal predecessors, (337), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-12-22 02:33:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2023-12-22 02:33:17,362 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 58 [2023-12-22 02:33:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:17,362 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2023-12-22 02:33:17,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2023-12-22 02:33:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-22 02:33:17,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:17,364 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] [2023-12-22 02:33:17,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-22 02:33:17,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,568 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:17,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1990220570, now seen corresponding path program 1 times [2023-12-22 02:33:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427989695] [2023-12-22 02:33:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:17,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:17,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:17,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-22 02:33:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:17,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:17,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:17,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:17,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427989695] [2023-12-22 02:33:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427989695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895452190] [2023-12-22 02:33:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:17,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:17,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:17,704 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:17,760 INFO L93 Difference]: Finished difference Result 620 states and 866 transitions. [2023-12-22 02:33:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2023-12-22 02:33:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:17,763 INFO L225 Difference]: With dead ends: 620 [2023-12-22 02:33:17,763 INFO L226 Difference]: Without dead ends: 454 [2023-12-22 02:33:17,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:17,764 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 239 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:17,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 380 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-22 02:33:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2023-12-22 02:33:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 341 states have (on average 1.434017595307918) internal successors, (489), 349 states have internal predecessors, (489), 57 states have call successors, (57), 35 states have call predecessors, (57), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2023-12-22 02:33:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 611 transitions. [2023-12-22 02:33:17,787 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 611 transitions. Word has length 58 [2023-12-22 02:33:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:17,787 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 611 transitions. [2023-12-22 02:33:17,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2023-12-22 02:33:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:33:17,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:17,790 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] [2023-12-22 02:33:17,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:17,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1408145877, now seen corresponding path program 1 times [2023-12-22 02:33:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724000950] [2023-12-22 02:33:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:17,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:18,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-22 02:33:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:18,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:18,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:18,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:18,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:18,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724000950] [2023-12-22 02:33:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724000950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:33:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394864173] [2023-12-22 02:33:18,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:18,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:33:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:33:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:18,105 INFO L87 Difference]: Start difference. First operand 440 states and 611 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:18,210 INFO L93 Difference]: Finished difference Result 762 states and 1045 transitions. [2023-12-22 02:33:18,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:18,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2023-12-22 02:33:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:18,215 INFO L225 Difference]: With dead ends: 762 [2023-12-22 02:33:18,215 INFO L226 Difference]: Without dead ends: 452 [2023-12-22 02:33:18,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:18,216 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 3 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:18,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1365 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:18,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-12-22 02:33:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 448. [2023-12-22 02:33:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 347 states have (on average 1.420749279538905) internal successors, (493), 355 states have internal predecessors, (493), 57 states have call successors, (57), 35 states have call predecessors, (57), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2023-12-22 02:33:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 617 transitions. [2023-12-22 02:33:18,244 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 617 transitions. Word has length 59 [2023-12-22 02:33:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:18,244 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 617 transitions. [2023-12-22 02:33:18,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:33:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 617 transitions. [2023-12-22 02:33:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:33:18,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:18,247 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] [2023-12-22 02:33:18,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:18,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:18,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:18,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:18,453 INFO L85 PathProgramCache]: Analyzing trace with hash 515082157, now seen corresponding path program 1 times [2023-12-22 02:33:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290501295] [2023-12-22 02:33:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:18,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:18,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-22 02:33:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:18,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:18,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:18,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:18,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290501295] [2023-12-22 02:33:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290501295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:18,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578366553] [2023-12-22 02:33:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:18,571 INFO L87 Difference]: Start difference. First operand 448 states and 617 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:33:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:18,851 INFO L93 Difference]: Finished difference Result 1060 states and 1427 transitions. [2023-12-22 02:33:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-12-22 02:33:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:18,855 INFO L225 Difference]: With dead ends: 1060 [2023-12-22 02:33:18,856 INFO L226 Difference]: Without dead ends: 744 [2023-12-22 02:33:18,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:18,857 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 378 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:18,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 322 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2023-12-22 02:33:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 740. [2023-12-22 02:33:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 567 states have (on average 1.3756613756613756) internal successors, (780), 580 states have internal predecessors, (780), 91 states have call successors, (91), 63 states have call predecessors, (91), 80 states have return successors, (122), 99 states have call predecessors, (122), 89 states have call successors, (122) [2023-12-22 02:33:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 993 transitions. [2023-12-22 02:33:18,899 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 993 transitions. Word has length 59 [2023-12-22 02:33:18,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:18,899 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 993 transitions. [2023-12-22 02:33:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-22 02:33:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 993 transitions. [2023-12-22 02:33:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:33:18,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:18,901 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] [2023-12-22 02:33:18,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-22 02:33:19,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:19,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:19,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash -529059355, now seen corresponding path program 1 times [2023-12-22 02:33:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678112928] [2023-12-22 02:33:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:19,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:19,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:19,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:19,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 02:33:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:19,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:19,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:19,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:19,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678112928] [2023-12-22 02:33:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678112928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:19,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297529025] [2023-12-22 02:33:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:19,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:19,216 INFO L87 Difference]: Start difference. First operand 740 states and 993 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:19,307 INFO L93 Difference]: Finished difference Result 1930 states and 2573 transitions. [2023-12-22 02:33:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-12-22 02:33:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:19,311 INFO L225 Difference]: With dead ends: 1930 [2023-12-22 02:33:19,312 INFO L226 Difference]: Without dead ends: 1308 [2023-12-22 02:33:19,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:19,313 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 62 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:19,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 520 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-12-22 02:33:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1292. [2023-12-22 02:33:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 983 states have (on average 1.347914547304171) internal successors, (1325), 1001 states have internal predecessors, (1325), 157 states have call successors, (157), 119 states have call predecessors, (157), 150 states have return successors, (219), 174 states have call predecessors, (219), 155 states have call successors, (219) [2023-12-22 02:33:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1701 transitions. [2023-12-22 02:33:19,400 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1701 transitions. Word has length 60 [2023-12-22 02:33:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:19,400 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1701 transitions. [2023-12-22 02:33:19,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1701 transitions. [2023-12-22 02:33:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:19,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:19,402 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] [2023-12-22 02:33:19,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:19,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:19,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:19,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2816761, now seen corresponding path program 1 times [2023-12-22 02:33:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069808759] [2023-12-22 02:33:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:19,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:19,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:19,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-22 02:33:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:19,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:19,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:19,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:19,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:19,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069808759] [2023-12-22 02:33:19,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069808759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:19,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:19,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716708547] [2023-12-22 02:33:19,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:19,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:19,674 INFO L87 Difference]: Start difference. First operand 1292 states and 1701 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:19,740 INFO L93 Difference]: Finished difference Result 1404 states and 1869 transitions. [2023-12-22 02:33:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:19,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 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 61 [2023-12-22 02:33:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:19,744 INFO L225 Difference]: With dead ends: 1404 [2023-12-22 02:33:19,745 INFO L226 Difference]: Without dead ends: 1292 [2023-12-22 02:33:19,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:19,746 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 168 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:19,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 387 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-12-22 02:33:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1292. [2023-12-22 02:33:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 983 states have (on average 1.3468972533062056) internal successors, (1324), 1001 states have internal predecessors, (1324), 157 states have call successors, (157), 119 states have call predecessors, (157), 150 states have return successors, (219), 174 states have call predecessors, (219), 155 states have call successors, (219) [2023-12-22 02:33:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1700 transitions. [2023-12-22 02:33:19,805 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1700 transitions. Word has length 61 [2023-12-22 02:33:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:19,806 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1700 transitions. [2023-12-22 02:33:19,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1700 transitions. [2023-12-22 02:33:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:19,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:19,807 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] [2023-12-22 02:33:19,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:20,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:20,010 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:20,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1389602171, now seen corresponding path program 1 times [2023-12-22 02:33:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789574631] [2023-12-22 02:33:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:20,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:20,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:20,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-22 02:33:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:20,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:20,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:20,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:20,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789574631] [2023-12-22 02:33:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789574631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176615484] [2023-12-22 02:33:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:20,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:20,098 INFO L87 Difference]: Start difference. First operand 1292 states and 1700 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:20,456 INFO L93 Difference]: Finished difference Result 1517 states and 2041 transitions. [2023-12-22 02:33:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:20,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:20,462 INFO L225 Difference]: With dead ends: 1517 [2023-12-22 02:33:20,462 INFO L226 Difference]: Without dead ends: 1409 [2023-12-22 02:33:20,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:20,464 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 438 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:20,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 562 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-12-22 02:33:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1400. [2023-12-22 02:33:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1073 states have (on average 1.3625349487418452) internal successors, (1462), 1092 states have internal predecessors, (1462), 168 states have call successors, (168), 125 states have call predecessors, (168), 157 states have return successors, (231), 185 states have call predecessors, (231), 166 states have call successors, (231) [2023-12-22 02:33:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1861 transitions. [2023-12-22 02:33:20,530 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1861 transitions. Word has length 61 [2023-12-22 02:33:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:20,530 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1861 transitions. [2023-12-22 02:33:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1861 transitions. [2023-12-22 02:33:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:20,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:20,531 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] [2023-12-22 02:33:20,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:20,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:20,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:20,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 618846533, now seen corresponding path program 1 times [2023-12-22 02:33:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010274248] [2023-12-22 02:33:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:20,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:20,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:20,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-22 02:33:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:20,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:20,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:20,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:20,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010274248] [2023-12-22 02:33:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010274248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:20,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:20,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:20,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441550922] [2023-12-22 02:33:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:20,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:20,826 INFO L87 Difference]: Start difference. First operand 1400 states and 1861 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:21,176 INFO L93 Difference]: Finished difference Result 1616 states and 2190 transitions. [2023-12-22 02:33:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:21,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:21,181 INFO L225 Difference]: With dead ends: 1616 [2023-12-22 02:33:21,181 INFO L226 Difference]: Without dead ends: 1400 [2023-12-22 02:33:21,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:21,183 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 361 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:21,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 404 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2023-12-22 02:33:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1400. [2023-12-22 02:33:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1073 states have (on average 1.3560111835973905) internal successors, (1455), 1092 states have internal predecessors, (1455), 168 states have call successors, (168), 125 states have call predecessors, (168), 157 states have return successors, (231), 185 states have call predecessors, (231), 166 states have call successors, (231) [2023-12-22 02:33:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1854 transitions. [2023-12-22 02:33:21,257 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1854 transitions. Word has length 61 [2023-12-22 02:33:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1854 transitions. [2023-12-22 02:33:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1854 transitions. [2023-12-22 02:33:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:21,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:21,259 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] [2023-12-22 02:33:21,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:21,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:21,465 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:21,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 822182533, now seen corresponding path program 1 times [2023-12-22 02:33:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359504004] [2023-12-22 02:33:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:21,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:21,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:21,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-22 02:33:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:21,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:21,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:21,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:21,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359504004] [2023-12-22 02:33:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359504004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:21,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:21,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306598665] [2023-12-22 02:33:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:21,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:21,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:21,559 INFO L87 Difference]: Start difference. First operand 1400 states and 1854 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:21,912 INFO L93 Difference]: Finished difference Result 1662 states and 2248 transitions. [2023-12-22 02:33:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:21,917 INFO L225 Difference]: With dead ends: 1662 [2023-12-22 02:33:21,917 INFO L226 Difference]: Without dead ends: 1446 [2023-12-22 02:33:21,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:21,918 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 378 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:21,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 398 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2023-12-22 02:33:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1446. [2023-12-22 02:33:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1113 states have (on average 1.3513027852650494) internal successors, (1504), 1132 states have internal predecessors, (1504), 170 states have call successors, (170), 129 states have call predecessors, (170), 161 states have return successors, (233), 187 states have call predecessors, (233), 168 states have call successors, (233) [2023-12-22 02:33:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1907 transitions. [2023-12-22 02:33:21,990 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1907 transitions. Word has length 61 [2023-12-22 02:33:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:21,990 INFO L495 AbstractCegarLoop]: Abstraction has 1446 states and 1907 transitions. [2023-12-22 02:33:21,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1907 transitions. [2023-12-22 02:33:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:21,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:21,991 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] [2023-12-22 02:33:21,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:22,195 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:22,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash -348554299, now seen corresponding path program 1 times [2023-12-22 02:33:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:22,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194307369] [2023-12-22 02:33:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:22,197 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:22,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-22 02:33:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:22,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:22,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:22,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:22,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194307369] [2023-12-22 02:33:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194307369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:22,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:22,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631169033] [2023-12-22 02:33:22,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:22,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:22,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:22,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:22,278 INFO L87 Difference]: Start difference. First operand 1446 states and 1907 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:22,612 INFO L93 Difference]: Finished difference Result 1754 states and 2354 transitions. [2023-12-22 02:33:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:22,617 INFO L225 Difference]: With dead ends: 1754 [2023-12-22 02:33:22,618 INFO L226 Difference]: Without dead ends: 1492 [2023-12-22 02:33:22,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:22,619 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 371 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:22,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 391 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2023-12-22 02:33:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1492. [2023-12-22 02:33:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1153 states have (on average 1.3434518647007805) internal successors, (1549), 1172 states have internal predecessors, (1549), 172 states have call successors, (172), 133 states have call predecessors, (172), 165 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1956 transitions. [2023-12-22 02:33:22,712 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1956 transitions. Word has length 61 [2023-12-22 02:33:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:22,712 INFO L495 AbstractCegarLoop]: Abstraction has 1492 states and 1956 transitions. [2023-12-22 02:33:22,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1956 transitions. [2023-12-22 02:33:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:22,713 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:22,713 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] [2023-12-22 02:33:22,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:22,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:22,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 942223750, now seen corresponding path program 1 times [2023-12-22 02:33:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749093058] [2023-12-22 02:33:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:22,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:22,920 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:22,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-22 02:33:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:22,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:22,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:23,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:23,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749093058] [2023-12-22 02:33:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749093058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865012407] [2023-12-22 02:33:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:23,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:23,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:23,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:23,011 INFO L87 Difference]: Start difference. First operand 1492 states and 1956 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:23,368 INFO L93 Difference]: Finished difference Result 1840 states and 2444 transitions. [2023-12-22 02:33:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:23,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:23,375 INFO L225 Difference]: With dead ends: 1840 [2023-12-22 02:33:23,376 INFO L226 Difference]: Without dead ends: 1532 [2023-12-22 02:33:23,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:23,377 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 365 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:23,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 384 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2023-12-22 02:33:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2023-12-22 02:33:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1191 states have (on average 1.3333333333333333) internal successors, (1588), 1210 states have internal predecessors, (1588), 172 states have call successors, (172), 135 states have call predecessors, (172), 167 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1995 transitions. [2023-12-22 02:33:23,478 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1995 transitions. Word has length 61 [2023-12-22 02:33:23,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:23,478 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1995 transitions. [2023-12-22 02:33:23,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:23,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1995 transitions. [2023-12-22 02:33:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:23,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:23,479 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] [2023-12-22 02:33:23,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:23,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:23,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -158434618, now seen corresponding path program 1 times [2023-12-22 02:33:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192099757] [2023-12-22 02:33:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:23,685 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:23,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-22 02:33:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:23,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:23,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:23,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:23,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192099757] [2023-12-22 02:33:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192099757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670704802] [2023-12-22 02:33:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:23,752 INFO L87 Difference]: Start difference. First operand 1532 states and 1995 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:23,920 INFO L93 Difference]: Finished difference Result 1911 states and 2507 transitions. [2023-12-22 02:33:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:23,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 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 61 [2023-12-22 02:33:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:23,925 INFO L225 Difference]: With dead ends: 1911 [2023-12-22 02:33:23,926 INFO L226 Difference]: Without dead ends: 1564 [2023-12-22 02:33:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:23,927 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 20 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:23,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 776 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2023-12-22 02:33:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1536. [2023-12-22 02:33:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1195 states have (on average 1.3271966527196652) internal successors, (1586), 1214 states have internal predecessors, (1586), 172 states have call successors, (172), 135 states have call predecessors, (172), 167 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1993 transitions. [2023-12-22 02:33:24,012 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1993 transitions. Word has length 61 [2023-12-22 02:33:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:24,012 INFO L495 AbstractCegarLoop]: Abstraction has 1536 states and 1993 transitions. [2023-12-22 02:33:24,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1993 transitions. [2023-12-22 02:33:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:24,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:24,013 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] [2023-12-22 02:33:24,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:24,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:24,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:24,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 501096904, now seen corresponding path program 1 times [2023-12-22 02:33:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851590375] [2023-12-22 02:33:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:24,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:24,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-22 02:33:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:24,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:24,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:24,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:24,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851590375] [2023-12-22 02:33:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851590375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753349656] [2023-12-22 02:33:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:24,290 INFO L87 Difference]: Start difference. First operand 1536 states and 1993 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:24,416 INFO L93 Difference]: Finished difference Result 1907 states and 2487 transitions. [2023-12-22 02:33:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 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 61 [2023-12-22 02:33:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:24,423 INFO L225 Difference]: With dead ends: 1907 [2023-12-22 02:33:24,423 INFO L226 Difference]: Without dead ends: 1556 [2023-12-22 02:33:24,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:24,426 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 11 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:24,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 780 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2023-12-22 02:33:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1540. [2023-12-22 02:33:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1199 states have (on average 1.3211009174311927) internal successors, (1584), 1218 states have internal predecessors, (1584), 172 states have call successors, (172), 135 states have call predecessors, (172), 167 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1991 transitions. [2023-12-22 02:33:24,519 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1991 transitions. Word has length 61 [2023-12-22 02:33:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:24,519 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 1991 transitions. [2023-12-22 02:33:24,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1991 transitions. [2023-12-22 02:33:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:24,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:24,520 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] [2023-12-22 02:33:24,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:24,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:24,731 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:24,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 775856518, now seen corresponding path program 1 times [2023-12-22 02:33:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916259110] [2023-12-22 02:33:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:24,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:24,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:24,733 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:24,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-22 02:33:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:24,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:24,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:24,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:24,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916259110] [2023-12-22 02:33:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916259110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897837382] [2023-12-22 02:33:24,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:24,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:24,802 INFO L87 Difference]: Start difference. First operand 1540 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:24,937 INFO L93 Difference]: Finished difference Result 1903 states and 2467 transitions. [2023-12-22 02:33:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 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 61 [2023-12-22 02:33:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:24,942 INFO L225 Difference]: With dead ends: 1903 [2023-12-22 02:33:24,942 INFO L226 Difference]: Without dead ends: 1548 [2023-12-22 02:33:24,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:24,944 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 2 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:24,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 778 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-12-22 02:33:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1544. [2023-12-22 02:33:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1203 states have (on average 1.315045719035744) internal successors, (1582), 1222 states have internal predecessors, (1582), 172 states have call successors, (172), 135 states have call predecessors, (172), 167 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1989 transitions. [2023-12-22 02:33:25,031 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1989 transitions. Word has length 61 [2023-12-22 02:33:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:25,031 INFO L495 AbstractCegarLoop]: Abstraction has 1544 states and 1989 transitions. [2023-12-22 02:33:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1989 transitions. [2023-12-22 02:33:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:25,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:25,032 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] [2023-12-22 02:33:25,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:25,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:25,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:25,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1595882744, now seen corresponding path program 1 times [2023-12-22 02:33:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153633080] [2023-12-22 02:33:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:25,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:25,238 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:25,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-22 02:33:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:25,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:33:25,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:25,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:25,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153633080] [2023-12-22 02:33:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153633080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:25,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312203437] [2023-12-22 02:33:25,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:25,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:25,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:25,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:25,352 INFO L87 Difference]: Start difference. First operand 1544 states and 1989 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:25,699 INFO L93 Difference]: Finished difference Result 1904 states and 2446 transitions. [2023-12-22 02:33:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:25,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-12-22 02:33:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:25,704 INFO L225 Difference]: With dead ends: 1904 [2023-12-22 02:33:25,704 INFO L226 Difference]: Without dead ends: 1544 [2023-12-22 02:33:25,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:25,705 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 316 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:25,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 376 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2023-12-22 02:33:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2023-12-22 02:33:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1203 states have (on average 1.3092269326683292) internal successors, (1575), 1222 states have internal predecessors, (1575), 172 states have call successors, (172), 135 states have call predecessors, (172), 167 states have return successors, (235), 189 states have call predecessors, (235), 170 states have call successors, (235) [2023-12-22 02:33:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1982 transitions. [2023-12-22 02:33:25,794 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1982 transitions. Word has length 61 [2023-12-22 02:33:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:25,794 INFO L495 AbstractCegarLoop]: Abstraction has 1544 states and 1982 transitions. [2023-12-22 02:33:25,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:33:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1982 transitions. [2023-12-22 02:33:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:33:25,795 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:25,795 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] [2023-12-22 02:33:25,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:25,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:25,998 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:25,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1173180918, now seen corresponding path program 1 times [2023-12-22 02:33:25,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:25,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591978048] [2023-12-22 02:33:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:26,000 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:26,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-22 02:33:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:26,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:26,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:26,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:26,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591978048] [2023-12-22 02:33:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591978048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:33:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24650201] [2023-12-22 02:33:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:26,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:26,198 INFO L87 Difference]: Start difference. First operand 1544 states and 1982 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:33:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:26,362 INFO L93 Difference]: Finished difference Result 2241 states and 2851 transitions. [2023-12-22 02:33:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2023-12-22 02:33:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:26,369 INFO L225 Difference]: With dead ends: 2241 [2023-12-22 02:33:26,369 INFO L226 Difference]: Without dead ends: 1882 [2023-12-22 02:33:26,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:26,371 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 212 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:26,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 412 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2023-12-22 02:33:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1880. [2023-12-22 02:33:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1489 states have (on average 1.2894560107454667) internal successors, (1920), 1511 states have internal predecessors, (1920), 199 states have call successors, (199), 157 states have call predecessors, (199), 190 states have return successors, (263), 214 states have call predecessors, (263), 197 states have call successors, (263) [2023-12-22 02:33:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2382 transitions. [2023-12-22 02:33:26,520 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2382 transitions. Word has length 61 [2023-12-22 02:33:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:26,520 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2382 transitions. [2023-12-22 02:33:26,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:33:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2382 transitions. [2023-12-22 02:33:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-22 02:33:26,521 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:26,521 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] [2023-12-22 02:33:26,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:26,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:26,725 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:26,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:26,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1574279004, now seen corresponding path program 1 times [2023-12-22 02:33:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429945048] [2023-12-22 02:33:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:26,729 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:26,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-22 02:33:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:26,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:26,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:26,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:26,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429945048] [2023-12-22 02:33:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429945048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512831016] [2023-12-22 02:33:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:26,820 INFO L87 Difference]: Start difference. First operand 1880 states and 2382 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:26,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:26,958 INFO L93 Difference]: Finished difference Result 3334 states and 4259 transitions. [2023-12-22 02:33:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:26,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2023-12-22 02:33:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:26,965 INFO L225 Difference]: With dead ends: 3334 [2023-12-22 02:33:26,965 INFO L226 Difference]: Without dead ends: 2172 [2023-12-22 02:33:26,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:26,969 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 214 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 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-12-22 02:33:26,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 364 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2023-12-22 02:33:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2148. [2023-12-22 02:33:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1691 states have (on average 1.2856298048492016) internal successors, (2174), 1717 states have internal predecessors, (2174), 231 states have call successors, (231), 185 states have call predecessors, (231), 224 states have return successors, (303), 248 states have call predecessors, (303), 229 states have call successors, (303) [2023-12-22 02:33:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2708 transitions. [2023-12-22 02:33:27,133 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 2708 transitions. Word has length 66 [2023-12-22 02:33:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:27,133 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 2708 transitions. [2023-12-22 02:33:27,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2708 transitions. [2023-12-22 02:33:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-22 02:33:27,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:27,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:27,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:27,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:27,340 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:27,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2074207797, now seen corresponding path program 1 times [2023-12-22 02:33:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103975284] [2023-12-22 02:33:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:27,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:27,342 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:27,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-22 02:33:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:27,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:27,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:27,422 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:27,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:27,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103975284] [2023-12-22 02:33:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103975284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:27,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:27,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000106677] [2023-12-22 02:33:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:27,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:27,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:27,423 INFO L87 Difference]: Start difference. First operand 2148 states and 2708 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:27,718 INFO L93 Difference]: Finished difference Result 2465 states and 3111 transitions. [2023-12-22 02:33:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:33:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2023-12-22 02:33:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:27,726 INFO L225 Difference]: With dead ends: 2465 [2023-12-22 02:33:27,726 INFO L226 Difference]: Without dead ends: 2462 [2023-12-22 02:33:27,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:27,727 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 499 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:27,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 347 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2023-12-22 02:33:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2442. [2023-12-22 02:33:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1914 states have (on average 1.2863113897596656) internal successors, (2462), 1943 states have internal predecessors, (2462), 263 states have call successors, (263), 213 states have call predecessors, (263), 263 states have return successors, (354), 288 states have call predecessors, (354), 262 states have call successors, (354) [2023-12-22 02:33:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3079 transitions. [2023-12-22 02:33:27,886 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3079 transitions. Word has length 67 [2023-12-22 02:33:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:27,886 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3079 transitions. [2023-12-22 02:33:27,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3079 transitions. [2023-12-22 02:33:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-22 02:33:27,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:27,887 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:27,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:28,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:28,109 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:28,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash 123364814, now seen corresponding path program 1 times [2023-12-22 02:33:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085264126] [2023-12-22 02:33:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:28,111 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-22 02:33:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:28,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:28,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:28,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:33:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:28,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:28,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085264126] [2023-12-22 02:33:28,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085264126] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:33:28,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:33:28,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:33:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605683506] [2023-12-22 02:33:28,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:33:28,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:33:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:28,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:33:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:28,492 INFO L87 Difference]: Start difference. First operand 2442 states and 3079 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:33:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:29,144 INFO L93 Difference]: Finished difference Result 4698 states and 5987 transitions. [2023-12-22 02:33:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:33:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 68 [2023-12-22 02:33:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:29,165 INFO L225 Difference]: With dead ends: 4698 [2023-12-22 02:33:29,166 INFO L226 Difference]: Without dead ends: 4695 [2023-12-22 02:33:29,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:33:29,167 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 793 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:29,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1380 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2023-12-22 02:33:29,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 3594. [2023-12-22 02:33:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 2790 states have (on average 1.2960573476702508) internal successors, (3616), 2833 states have internal predecessors, (3616), 395 states have call successors, (395), 325 states have call predecessors, (395), 407 states have return successors, (548), 438 states have call predecessors, (548), 394 states have call successors, (548) [2023-12-22 02:33:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4559 transitions. [2023-12-22 02:33:29,452 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4559 transitions. Word has length 68 [2023-12-22 02:33:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:29,452 INFO L495 AbstractCegarLoop]: Abstraction has 3594 states and 4559 transitions. [2023-12-22 02:33:29,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-22 02:33:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4559 transitions. [2023-12-22 02:33:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 02:33:29,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:29,454 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:29,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-22 02:33:29,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:29,657 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:29,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2067840267, now seen corresponding path program 2 times [2023-12-22 02:33:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646838565] [2023-12-22 02:33:29,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:33:29,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:29,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:29,659 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:29,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-22 02:33:29,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:33:29,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:33:29,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:29,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:29,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:29,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646838565] [2023-12-22 02:33:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646838565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:29,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:29,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710268533] [2023-12-22 02:33:29,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:29,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:29,721 INFO L87 Difference]: Start difference. First operand 3594 states and 4559 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:29,927 INFO L93 Difference]: Finished difference Result 5078 states and 6509 transitions. [2023-12-22 02:33:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2023-12-22 02:33:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:29,936 INFO L225 Difference]: With dead ends: 5078 [2023-12-22 02:33:29,936 INFO L226 Difference]: Without dead ends: 2478 [2023-12-22 02:33:29,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:29,941 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 251 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:29,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 426 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2023-12-22 02:33:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2474. [2023-12-22 02:33:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 1950 states have (on average 1.2707692307692309) internal successors, (2478), 1975 states have internal predecessors, (2478), 263 states have call successors, (263), 213 states have call predecessors, (263), 259 states have return successors, (338), 288 states have call predecessors, (338), 262 states have call successors, (338) [2023-12-22 02:33:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3079 transitions. [2023-12-22 02:33:30,155 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3079 transitions. Word has length 71 [2023-12-22 02:33:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:30,156 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 3079 transitions. [2023-12-22 02:33:30,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-22 02:33:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3079 transitions. [2023-12-22 02:33:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-22 02:33:30,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:30,157 INFO L195 NwaCegarLoop]: trace histogram [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-12-22 02:33:30,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:30,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:30,360 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:30,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -963374144, now seen corresponding path program 1 times [2023-12-22 02:33:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504421999] [2023-12-22 02:33:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:30,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:30,362 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:30,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-22 02:33:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:30,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:30,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:33:30,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:30,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504421999] [2023-12-22 02:33:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504421999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:30,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:30,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045636496] [2023-12-22 02:33:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:30,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:30,438 INFO L87 Difference]: Start difference. First operand 2474 states and 3079 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:33:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:30,817 INFO L93 Difference]: Finished difference Result 5861 states and 7337 transitions. [2023-12-22 02:33:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:30,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2023-12-22 02:33:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:30,826 INFO L225 Difference]: With dead ends: 5861 [2023-12-22 02:33:30,827 INFO L226 Difference]: Without dead ends: 3451 [2023-12-22 02:33:30,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:30,831 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 84 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:30,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 582 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2023-12-22 02:33:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2023-12-22 02:33:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2681 states have (on average 1.26781051846326) internal successors, (3399), 2716 states have internal predecessors, (3399), 378 states have call successors, (378), 311 states have call predecessors, (378), 390 states have return successors, (521), 426 states have call predecessors, (521), 377 states have call successors, (521) [2023-12-22 02:33:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4298 transitions. [2023-12-22 02:33:31,102 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4298 transitions. Word has length 76 [2023-12-22 02:33:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:31,103 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 4298 transitions. [2023-12-22 02:33:31,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:33:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4298 transitions. [2023-12-22 02:33:31,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-22 02:33:31,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:31,105 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-12-22 02:33:31,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-22 02:33:31,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:31,309 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:31,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -101607307, now seen corresponding path program 1 times [2023-12-22 02:33:31,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:31,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276369930] [2023-12-22 02:33:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:31,311 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:31,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-22 02:33:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:31,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:31,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:33:31,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:31,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276369930] [2023-12-22 02:33:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276369930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:31,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975740171] [2023-12-22 02:33:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:31,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:31,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:31,419 INFO L87 Difference]: Start difference. First operand 3451 states and 4298 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:31,918 INFO L93 Difference]: Finished difference Result 6216 states and 7752 transitions. [2023-12-22 02:33:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2023-12-22 02:33:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:31,926 INFO L225 Difference]: With dead ends: 6216 [2023-12-22 02:33:31,926 INFO L226 Difference]: Without dead ends: 3485 [2023-12-22 02:33:31,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:31,931 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 332 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:31,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 296 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2023-12-22 02:33:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 3485. [2023-12-22 02:33:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2698 states have (on average 1.2535211267605635) internal successors, (3382), 2750 states have internal predecessors, (3382), 378 states have call successors, (378), 311 states have call predecessors, (378), 407 states have return successors, (521), 426 states have call predecessors, (521), 377 states have call successors, (521) [2023-12-22 02:33:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4281 transitions. [2023-12-22 02:33:32,213 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4281 transitions. Word has length 85 [2023-12-22 02:33:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:32,214 INFO L495 AbstractCegarLoop]: Abstraction has 3485 states and 4281 transitions. [2023-12-22 02:33:32,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4281 transitions. [2023-12-22 02:33:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-22 02:33:32,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:32,216 INFO L195 NwaCegarLoop]: trace histogram [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-12-22 02:33:32,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-12-22 02:33:32,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:32,419 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:32,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1927183056, now seen corresponding path program 1 times [2023-12-22 02:33:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120319206] [2023-12-22 02:33:32,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:32,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:32,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:32,433 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:32,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-22 02:33:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:32,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:32,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:33:32,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:32,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120319206] [2023-12-22 02:33:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120319206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112320770] [2023-12-22 02:33:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:32,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:32,506 INFO L87 Difference]: Start difference. First operand 3485 states and 4281 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:33:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:32,826 INFO L93 Difference]: Finished difference Result 5847 states and 7201 transitions. [2023-12-22 02:33:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:32,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2023-12-22 02:33:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:32,834 INFO L225 Difference]: With dead ends: 5847 [2023-12-22 02:33:32,834 INFO L226 Difference]: Without dead ends: 3488 [2023-12-22 02:33:32,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:32,837 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 87 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:32,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 572 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2023-12-22 02:33:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3485. [2023-12-22 02:33:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2698 states have (on average 1.2416604892512972) internal successors, (3350), 2750 states have internal predecessors, (3350), 378 states have call successors, (378), 311 states have call predecessors, (378), 407 states have return successors, (489), 426 states have call predecessors, (489), 377 states have call successors, (489) [2023-12-22 02:33:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4217 transitions. [2023-12-22 02:33:33,170 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4217 transitions. Word has length 86 [2023-12-22 02:33:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:33,170 INFO L495 AbstractCegarLoop]: Abstraction has 3485 states and 4217 transitions. [2023-12-22 02:33:33,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:33:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4217 transitions. [2023-12-22 02:33:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:33:33,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:33,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:33,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:33,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:33,377 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:33,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash -365375365, now seen corresponding path program 1 times [2023-12-22 02:33:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095528381] [2023-12-22 02:33:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:33,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:33,379 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:33,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-22 02:33:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:33,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:33,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:33:33,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:33,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095528381] [2023-12-22 02:33:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095528381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:33:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321325492] [2023-12-22 02:33:33,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:33,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:33,513 INFO L87 Difference]: Start difference. First operand 3485 states and 4217 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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-12-22 02:33:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:33,847 INFO L93 Difference]: Finished difference Result 4740 states and 5756 transitions. [2023-12-22 02:33:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:33,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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 99 [2023-12-22 02:33:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:33,858 INFO L225 Difference]: With dead ends: 4740 [2023-12-22 02:33:33,859 INFO L226 Difference]: Without dead ends: 4045 [2023-12-22 02:33:33,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:33,861 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 203 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:33,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 411 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2023-12-22 02:33:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 4039. [2023-12-22 02:33:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4039 states, 3168 states have (on average 1.2342171717171717) internal successors, (3910), 3224 states have internal predecessors, (3910), 424 states have call successors, (424), 347 states have call predecessors, (424), 445 states have return successors, (537), 470 states have call predecessors, (537), 423 states have call successors, (537) [2023-12-22 02:33:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 4871 transitions. [2023-12-22 02:33:34,201 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 4871 transitions. Word has length 99 [2023-12-22 02:33:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:34,201 INFO L495 AbstractCegarLoop]: Abstraction has 4039 states and 4871 transitions. [2023-12-22 02:33:34,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 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-12-22 02:33:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 4871 transitions. [2023-12-22 02:33:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:33:34,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:34,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:34,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-22 02:33:34,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:34,407 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:34,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1939802652, now seen corresponding path program 1 times [2023-12-22 02:33:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137122982] [2023-12-22 02:33:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:34,410 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:34,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-22 02:33:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:34,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:33:34,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:33:34,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:34,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137122982] [2023-12-22 02:33:34,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137122982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:34,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:34,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:34,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153565182] [2023-12-22 02:33:34,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:34,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:34,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:34,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:34,567 INFO L87 Difference]: Start difference. First operand 4039 states and 4871 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:35,191 INFO L93 Difference]: Finished difference Result 6434 states and 7770 transitions. [2023-12-22 02:33:35,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 99 [2023-12-22 02:33:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:35,205 INFO L225 Difference]: With dead ends: 6434 [2023-12-22 02:33:35,205 INFO L226 Difference]: Without dead ends: 5186 [2023-12-22 02:33:35,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:35,208 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 313 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:35,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 453 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2023-12-22 02:33:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5184. [2023-12-22 02:33:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4134 states have (on average 1.2213352685050798) internal successors, (5049), 4203 states have internal predecessors, (5049), 519 states have call successors, (519), 419 states have call predecessors, (519), 529 states have return successors, (668), 565 states have call predecessors, (668), 518 states have call successors, (668) [2023-12-22 02:33:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6236 transitions. [2023-12-22 02:33:35,703 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6236 transitions. Word has length 99 [2023-12-22 02:33:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:35,703 INFO L495 AbstractCegarLoop]: Abstraction has 5184 states and 6236 transitions. [2023-12-22 02:33:35,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6236 transitions. [2023-12-22 02:33:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 02:33:35,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:35,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:35,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:35,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:35,910 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:35,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1911302362, now seen corresponding path program 1 times [2023-12-22 02:33:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444538737] [2023-12-22 02:33:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:35,913 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:35,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-22 02:33:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:35,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:35,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-22 02:33:35,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:35,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:35,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444538737] [2023-12-22 02:33:35,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444538737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636159884] [2023-12-22 02:33:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:35,998 INFO L87 Difference]: Start difference. First operand 5184 states and 6236 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-12-22 02:33:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:36,394 INFO L93 Difference]: Finished difference Result 7030 states and 8435 transitions. [2023-12-22 02:33:36,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:36,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 99 [2023-12-22 02:33:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:36,421 INFO L225 Difference]: With dead ends: 7030 [2023-12-22 02:33:36,421 INFO L226 Difference]: Without dead ends: 4637 [2023-12-22 02:33:36,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:36,425 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 151 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:36,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 365 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4637 states. [2023-12-22 02:33:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4637 to 4637. [2023-12-22 02:33:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 3674 states have (on average 1.2250952640174197) internal successors, (4501), 3738 states have internal predecessors, (4501), 470 states have call successors, (470), 383 states have call predecessors, (470), 491 states have return successors, (605), 518 states have call predecessors, (605), 469 states have call successors, (605) [2023-12-22 02:33:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 5576 transitions. [2023-12-22 02:33:36,783 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 5576 transitions. Word has length 99 [2023-12-22 02:33:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:36,783 INFO L495 AbstractCegarLoop]: Abstraction has 4637 states and 5576 transitions. [2023-12-22 02:33:36,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-12-22 02:33:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 5576 transitions. [2023-12-22 02:33:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-22 02:33:36,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:36,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:36,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:36,991 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:36,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1525344543, now seen corresponding path program 1 times [2023-12-22 02:33:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929007834] [2023-12-22 02:33:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:36,993 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:36,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-22 02:33:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:37,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:33:37,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:33:37,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:37,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929007834] [2023-12-22 02:33:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929007834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532307002] [2023-12-22 02:33:37,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:37,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:37,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:37,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:37,149 INFO L87 Difference]: Start difference. First operand 4637 states and 5576 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:37,817 INFO L93 Difference]: Finished difference Result 7987 states and 9585 transitions. [2023-12-22 02:33:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 101 [2023-12-22 02:33:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:37,829 INFO L225 Difference]: With dead ends: 7987 [2023-12-22 02:33:37,830 INFO L226 Difference]: Without dead ends: 6141 [2023-12-22 02:33:37,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:37,834 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 304 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:37,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 431 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6141 states. [2023-12-22 02:33:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6141 to 6139. [2023-12-22 02:33:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6139 states, 4937 states have (on average 1.2124772128823171) internal successors, (5986), 5022 states have internal predecessors, (5986), 595 states have call successors, (595), 475 states have call predecessors, (595), 605 states have return successors, (776), 645 states have call predecessors, (776), 594 states have call successors, (776) [2023-12-22 02:33:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 7357 transitions. [2023-12-22 02:33:38,343 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 7357 transitions. Word has length 101 [2023-12-22 02:33:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:38,343 INFO L495 AbstractCegarLoop]: Abstraction has 6139 states and 7357 transitions. [2023-12-22 02:33:38,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:33:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 7357 transitions. [2023-12-22 02:33:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-22 02:33:38,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:38,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:38,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-12-22 02:33:38,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:38,550 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:38,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1886113763, now seen corresponding path program 1 times [2023-12-22 02:33:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142941092] [2023-12-22 02:33:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:38,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:38,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:38,552 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:38,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-22 02:33:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:38,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:38,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-22 02:33:38,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:38,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142941092] [2023-12-22 02:33:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142941092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245899672] [2023-12-22 02:33:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:38,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:38,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:38,642 INFO L87 Difference]: Start difference. First operand 6139 states and 7357 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-22 02:33:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:39,264 INFO L93 Difference]: Finished difference Result 9483 states and 11330 transitions. [2023-12-22 02:33:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 101 [2023-12-22 02:33:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:39,280 INFO L225 Difference]: With dead ends: 9483 [2023-12-22 02:33:39,281 INFO L226 Difference]: Without dead ends: 6135 [2023-12-22 02:33:39,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:39,288 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 149 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:39,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 364 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6135 states. [2023-12-22 02:33:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6135 to 6135. [2023-12-22 02:33:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6135 states, 4936 states have (on average 1.2123176661264181) internal successors, (5984), 5020 states have internal predecessors, (5984), 592 states have call successors, (592), 475 states have call predecessors, (592), 605 states have return successors, (773), 642 states have call predecessors, (773), 591 states have call successors, (773) [2023-12-22 02:33:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6135 states to 6135 states and 7349 transitions. [2023-12-22 02:33:39,786 INFO L78 Accepts]: Start accepts. Automaton has 6135 states and 7349 transitions. Word has length 101 [2023-12-22 02:33:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:39,786 INFO L495 AbstractCegarLoop]: Abstraction has 6135 states and 7349 transitions. [2023-12-22 02:33:39,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-12-22 02:33:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6135 states and 7349 transitions. [2023-12-22 02:33:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-22 02:33:39,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:39,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:39,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:39,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:39,994 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:39,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 896081244, now seen corresponding path program 1 times [2023-12-22 02:33:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844685615] [2023-12-22 02:33:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:39,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:39,996 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:39,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-22 02:33:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:40,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:40,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:33:40,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:40,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:40,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844685615] [2023-12-22 02:33:40,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844685615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:40,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:40,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:40,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183469561] [2023-12-22 02:33:40,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:40,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:40,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:40,079 INFO L87 Difference]: Start difference. First operand 6135 states and 7349 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (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-12-22 02:33:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:40,637 INFO L93 Difference]: Finished difference Result 9489 states and 11402 transitions. [2023-12-22 02:33:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (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 103 [2023-12-22 02:33:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:40,659 INFO L225 Difference]: With dead ends: 9489 [2023-12-22 02:33:40,659 INFO L226 Difference]: Without dead ends: 7429 [2023-12-22 02:33:40,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:40,665 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 113 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:40,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 608 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2023-12-22 02:33:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7429. [2023-12-22 02:33:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7429 states, 6030 states have (on average 1.204311774461028) internal successors, (7262), 6122 states have internal predecessors, (7262), 702 states have call successors, (702), 555 states have call predecessors, (702), 695 states have return successors, (923), 754 states have call predecessors, (923), 701 states have call successors, (923) [2023-12-22 02:33:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 8887 transitions. [2023-12-22 02:33:41,268 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 8887 transitions. Word has length 103 [2023-12-22 02:33:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:41,268 INFO L495 AbstractCegarLoop]: Abstraction has 7429 states and 8887 transitions. [2023-12-22 02:33:41,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (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-12-22 02:33:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 8887 transitions. [2023-12-22 02:33:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-22 02:33:41,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:41,273 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:41,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:41,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:41,477 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:41,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1291156472, now seen corresponding path program 1 times [2023-12-22 02:33:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:41,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [640428309] [2023-12-22 02:33:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:41,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:41,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:41,479 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-22 02:33:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:41,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:33:41,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-22 02:33:41,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:41,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [640428309] [2023-12-22 02:33:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [640428309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:33:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770639741] [2023-12-22 02:33:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:41,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:33:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:33:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:41,587 INFO L87 Difference]: Start difference. First operand 7429 states and 8887 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:33:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:42,052 INFO L93 Difference]: Finished difference Result 8701 states and 10442 transitions. [2023-12-22 02:33:42,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:33:42,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2023-12-22 02:33:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:42,066 INFO L225 Difference]: With dead ends: 8701 [2023-12-22 02:33:42,067 INFO L226 Difference]: Without dead ends: 5936 [2023-12-22 02:33:42,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:33:42,072 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 32 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:42,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1239 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2023-12-22 02:33:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 5854. [2023-12-22 02:33:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5854 states, 4888 states have (on average 1.1916939443535188) internal successors, (5825), 4942 states have internal predecessors, (5825), 499 states have call successors, (499), 381 states have call predecessors, (499), 465 states have return successors, (650), 531 states have call predecessors, (650), 498 states have call successors, (650) [2023-12-22 02:33:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5854 states to 5854 states and 6974 transitions. [2023-12-22 02:33:42,476 INFO L78 Accepts]: Start accepts. Automaton has 5854 states and 6974 transitions. Word has length 131 [2023-12-22 02:33:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:42,477 INFO L495 AbstractCegarLoop]: Abstraction has 5854 states and 6974 transitions. [2023-12-22 02:33:42,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-22 02:33:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5854 states and 6974 transitions. [2023-12-22 02:33:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-22 02:33:42,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:42,482 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:42,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-12-22 02:33:42,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:42,683 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:42,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1288356857, now seen corresponding path program 1 times [2023-12-22 02:33:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076042578] [2023-12-22 02:33:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:42,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:42,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:42,684 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:42,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-22 02:33:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:42,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:42,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:33:42,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:42,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:42,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076042578] [2023-12-22 02:33:42,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076042578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:42,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:42,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:33:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195711409] [2023-12-22 02:33:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:42,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:42,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:42,856 INFO L87 Difference]: Start difference. First operand 5854 states and 6974 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-12-22 02:33:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:43,442 INFO L93 Difference]: Finished difference Result 11785 states and 14040 transitions. [2023-12-22 02:33:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:43,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 129 [2023-12-22 02:33:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:43,457 INFO L225 Difference]: With dead ends: 11785 [2023-12-22 02:33:43,457 INFO L226 Difference]: Without dead ends: 7146 [2023-12-22 02:33:43,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:43,465 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 182 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:43,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 379 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2023-12-22 02:33:43,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 7128. [2023-12-22 02:33:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7128 states, 5962 states have (on average 1.1806440791680644) internal successors, (7039), 6024 states have internal predecessors, (7039), 609 states have call successors, (609), 461 states have call predecessors, (609), 555 states have return successors, (782), 643 states have call predecessors, (782), 608 states have call successors, (782) [2023-12-22 02:33:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 8430 transitions. [2023-12-22 02:33:43,979 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 8430 transitions. Word has length 129 [2023-12-22 02:33:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:43,979 INFO L495 AbstractCegarLoop]: Abstraction has 7128 states and 8430 transitions. [2023-12-22 02:33:43,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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-12-22 02:33:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 8430 transitions. [2023-12-22 02:33:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-22 02:33:43,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:43,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:43,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:44,188 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:44,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -506822965, now seen corresponding path program 1 times [2023-12-22 02:33:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545800773] [2023-12-22 02:33:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:44,190 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:44,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-22 02:33:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:44,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:44,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:33:44,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:44,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:44,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545800773] [2023-12-22 02:33:44,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545800773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:44,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:44,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:33:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472202002] [2023-12-22 02:33:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:44,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:44,308 INFO L87 Difference]: Start difference. First operand 7128 states and 8430 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-22 02:33:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:45,106 INFO L93 Difference]: Finished difference Result 8383 states and 9953 transitions. [2023-12-22 02:33:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:45,107 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), 3 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 145 [2023-12-22 02:33:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:45,120 INFO L225 Difference]: With dead ends: 8383 [2023-12-22 02:33:45,120 INFO L226 Difference]: Without dead ends: 7356 [2023-12-22 02:33:45,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:45,123 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 136 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:45,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 567 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 02:33:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7356 states. [2023-12-22 02:33:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7356 to 7185. [2023-12-22 02:33:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 6002 states have (on average 1.177940686437854) internal successors, (7070), 6068 states have internal predecessors, (7070), 618 states have call successors, (618), 472 states have call predecessors, (618), 563 states have return successors, (793), 645 states have call predecessors, (793), 617 states have call successors, (793) [2023-12-22 02:33:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 8481 transitions. [2023-12-22 02:33:45,614 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 8481 transitions. Word has length 145 [2023-12-22 02:33:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:45,615 INFO L495 AbstractCegarLoop]: Abstraction has 7185 states and 8481 transitions. [2023-12-22 02:33:45,615 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), 3 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-22 02:33:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 8481 transitions. [2023-12-22 02:33:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-22 02:33:45,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:45,620 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:45,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-22 02:33:45,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:45,824 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:45,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1362634231, now seen corresponding path program 1 times [2023-12-22 02:33:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308238] [2023-12-22 02:33:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:45,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:45,826 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:45,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-22 02:33:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:45,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-22 02:33:45,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-22 02:33:46,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:46,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308238] [2023-12-22 02:33:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:46,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:46,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746479725] [2023-12-22 02:33:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:46,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:46,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:46,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:46,007 INFO L87 Difference]: Start difference. First operand 7185 states and 8481 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-22 02:33:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:46,835 INFO L93 Difference]: Finished difference Result 9469 states and 11245 transitions. [2023-12-22 02:33:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:46,836 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2023-12-22 02:33:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:46,851 INFO L225 Difference]: With dead ends: 9469 [2023-12-22 02:33:46,851 INFO L226 Difference]: Without dead ends: 8230 [2023-12-22 02:33:46,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:46,857 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 159 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:46,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 409 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2023-12-22 02:33:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 8025. [2023-12-22 02:33:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8025 states, 6652 states have (on average 1.176037282020445) internal successors, (7823), 6740 states have internal predecessors, (7823), 704 states have call successors, (704), 538 states have call predecessors, (704), 667 states have return successors, (923), 747 states have call predecessors, (923), 703 states have call successors, (923) [2023-12-22 02:33:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8025 states to 8025 states and 9450 transitions. [2023-12-22 02:33:47,473 INFO L78 Accepts]: Start accepts. Automaton has 8025 states and 9450 transitions. Word has length 147 [2023-12-22 02:33:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:47,474 INFO L495 AbstractCegarLoop]: Abstraction has 8025 states and 9450 transitions. [2023-12-22 02:33:47,474 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, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-22 02:33:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8025 states and 9450 transitions. [2023-12-22 02:33:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-22 02:33:47,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:47,479 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, 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-12-22 02:33:47,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:47,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:47,680 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:47,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1683666049, now seen corresponding path program 1 times [2023-12-22 02:33:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290530877] [2023-12-22 02:33:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:47,682 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:47,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-12-22 02:33:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:47,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:47,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-22 02:33:47,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:47,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290530877] [2023-12-22 02:33:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290530877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:47,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:47,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037341325] [2023-12-22 02:33:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:47,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:33:47,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:47,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:33:47,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:33:47,827 INFO L87 Difference]: Start difference. First operand 8025 states and 9450 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:33:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:48,659 INFO L93 Difference]: Finished difference Result 13991 states and 16545 transitions. [2023-12-22 02:33:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 147 [2023-12-22 02:33:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:48,674 INFO L225 Difference]: With dead ends: 13991 [2023-12-22 02:33:48,674 INFO L226 Difference]: Without dead ends: 8079 [2023-12-22 02:33:48,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:48,684 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 318 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:48,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 367 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8079 states. [2023-12-22 02:33:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8079 to 8079. [2023-12-22 02:33:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8079 states, 6694 states have (on average 1.1653719749028981) internal successors, (7801), 6788 states have internal predecessors, (7801), 704 states have call successors, (704), 538 states have call predecessors, (704), 679 states have return successors, (881), 753 states have call predecessors, (881), 703 states have call successors, (881) [2023-12-22 02:33:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8079 states to 8079 states and 9386 transitions. [2023-12-22 02:33:49,328 INFO L78 Accepts]: Start accepts. Automaton has 8079 states and 9386 transitions. Word has length 147 [2023-12-22 02:33:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 8079 states and 9386 transitions. [2023-12-22 02:33:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:33:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8079 states and 9386 transitions. [2023-12-22 02:33:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-22 02:33:49,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:49,333 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, 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-12-22 02:33:49,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:49,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:49,534 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:49,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash 381088562, now seen corresponding path program 1 times [2023-12-22 02:33:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652568023] [2023-12-22 02:33:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:49,536 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:49,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-12-22 02:33:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:49,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:49,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:33:49,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:49,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652568023] [2023-12-22 02:33:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652568023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827607189] [2023-12-22 02:33:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:49,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:49,641 INFO L87 Difference]: Start difference. First operand 8079 states and 9386 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-22 02:33:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:50,215 INFO L93 Difference]: Finished difference Result 11773 states and 13708 transitions. [2023-12-22 02:33:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 148 [2023-12-22 02:33:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:50,225 INFO L225 Difference]: With dead ends: 11773 [2023-12-22 02:33:50,226 INFO L226 Difference]: Without dead ends: 7073 [2023-12-22 02:33:50,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:50,231 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 112 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:50,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 605 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2023-12-22 02:33:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 7071. [2023-12-22 02:33:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7071 states, 5842 states have (on average 1.1648408079424855) internal successors, (6805), 5926 states have internal predecessors, (6805), 620 states have call successors, (620), 474 states have call predecessors, (620), 607 states have return successors, (783), 671 states have call predecessors, (783), 619 states have call successors, (783) [2023-12-22 02:33:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 8208 transitions. [2023-12-22 02:33:50,796 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 8208 transitions. Word has length 148 [2023-12-22 02:33:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:50,797 INFO L495 AbstractCegarLoop]: Abstraction has 7071 states and 8208 transitions. [2023-12-22 02:33:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-22 02:33:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 8208 transitions. [2023-12-22 02:33:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-22 02:33:50,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:50,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:50,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-12-22 02:33:51,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,008 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:51,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 89807054, now seen corresponding path program 1 times [2023-12-22 02:33:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823475008] [2023-12-22 02:33:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:51,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:51,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:51,010 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:51,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-22 02:33:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:51,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:51,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-22 02:33:51,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:51,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823475008] [2023-12-22 02:33:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823475008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:33:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585927969] [2023-12-22 02:33:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:51,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:51,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:51,113 INFO L87 Difference]: Start difference. First operand 7071 states and 8208 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:33:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:51,907 INFO L93 Difference]: Finished difference Result 9094 states and 10602 transitions. [2023-12-22 02:33:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:33:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 162 [2023-12-22 02:33:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:51,916 INFO L225 Difference]: With dead ends: 9094 [2023-12-22 02:33:51,916 INFO L226 Difference]: Without dead ends: 6832 [2023-12-22 02:33:51,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-22 02:33:51,919 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 336 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:51,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 405 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2023-12-22 02:33:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6680. [2023-12-22 02:33:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6680 states, 5549 states have (on average 1.1627320237880698) internal successors, (6452), 5623 states have internal predecessors, (6452), 575 states have call successors, (575), 435 states have call predecessors, (575), 554 states have return successors, (712), 622 states have call predecessors, (712), 574 states have call successors, (712) [2023-12-22 02:33:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 7739 transitions. [2023-12-22 02:33:52,432 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 7739 transitions. Word has length 162 [2023-12-22 02:33:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:52,432 INFO L495 AbstractCegarLoop]: Abstraction has 6680 states and 7739 transitions. [2023-12-22 02:33:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-22 02:33:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 7739 transitions. [2023-12-22 02:33:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-22 02:33:52,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:52,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:33:52,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-22 02:33:52,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:52,638 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:52,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -197617655, now seen corresponding path program 1 times [2023-12-22 02:33:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:52,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880349540] [2023-12-22 02:33:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:52,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:52,641 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:52,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-12-22 02:33:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:52,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:52,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-22 02:33:52,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:52,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880349540] [2023-12-22 02:33:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880349540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:52,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008088761] [2023-12-22 02:33:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:52,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:52,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:52,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:52,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:52,761 INFO L87 Difference]: Start difference. First operand 6680 states and 7739 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:53,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:53,179 INFO L93 Difference]: Finished difference Result 8460 states and 9796 transitions. [2023-12-22 02:33:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 177 [2023-12-22 02:33:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:53,185 INFO L225 Difference]: With dead ends: 8460 [2023-12-22 02:33:53,185 INFO L226 Difference]: Without dead ends: 3298 [2023-12-22 02:33:53,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:53,190 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 115 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:53,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 550 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2023-12-22 02:33:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2023-12-22 02:33:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2687 states have (on average 1.1470040937848902) internal successors, (3082), 2723 states have internal predecessors, (3082), 311 states have call successors, (311), 231 states have call predecessors, (311), 298 states have return successors, (378), 344 states have call predecessors, (378), 310 states have call successors, (378) [2023-12-22 02:33:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 3771 transitions. [2023-12-22 02:33:53,514 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 3771 transitions. Word has length 177 [2023-12-22 02:33:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:53,514 INFO L495 AbstractCegarLoop]: Abstraction has 3298 states and 3771 transitions. [2023-12-22 02:33:53,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 3771 transitions. [2023-12-22 02:33:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-22 02:33:53,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:53,516 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:33:53,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-12-22 02:33:53,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,718 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:53,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1357687958, now seen corresponding path program 1 times [2023-12-22 02:33:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156403923] [2023-12-22 02:33:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:53,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:53,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:53,722 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:53,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-12-22 02:33:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:53,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:53,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-22 02:33:53,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:53,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:53,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156403923] [2023-12-22 02:33:53,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156403923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:53,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:53,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193574243] [2023-12-22 02:33:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:53,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:53,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:53,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:53,832 INFO L87 Difference]: Start difference. First operand 3298 states and 3771 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-22 02:33:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:54,158 INFO L93 Difference]: Finished difference Result 4316 states and 4939 transitions. [2023-12-22 02:33:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 178 [2023-12-22 02:33:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:54,167 INFO L225 Difference]: With dead ends: 4316 [2023-12-22 02:33:54,168 INFO L226 Difference]: Without dead ends: 3298 [2023-12-22 02:33:54,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:54,170 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 122 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:54,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 573 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2023-12-22 02:33:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2023-12-22 02:33:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2687 states have (on average 1.1410494975809453) internal successors, (3066), 2723 states have internal predecessors, (3066), 311 states have call successors, (311), 231 states have call predecessors, (311), 298 states have return successors, (378), 344 states have call predecessors, (378), 310 states have call successors, (378) [2023-12-22 02:33:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 3755 transitions. [2023-12-22 02:33:54,467 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 3755 transitions. Word has length 178 [2023-12-22 02:33:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:54,467 INFO L495 AbstractCegarLoop]: Abstraction has 3298 states and 3755 transitions. [2023-12-22 02:33:54,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-12-22 02:33:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 3755 transitions. [2023-12-22 02:33:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-22 02:33:54,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:54,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:33:54,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:54,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:54,671 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:54,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1795933408, now seen corresponding path program 1 times [2023-12-22 02:33:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:54,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213573275] [2023-12-22 02:33:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:54,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:54,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:54,673 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:54,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-22 02:33:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:54,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:54,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-22 02:33:54,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:54,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213573275] [2023-12-22 02:33:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213573275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:54,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394005218] [2023-12-22 02:33:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:54,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:54,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:54,809 INFO L87 Difference]: Start difference. First operand 3298 states and 3755 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:55,203 INFO L93 Difference]: Finished difference Result 4918 states and 5602 transitions. [2023-12-22 02:33:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 180 [2023-12-22 02:33:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:55,210 INFO L225 Difference]: With dead ends: 4918 [2023-12-22 02:33:55,210 INFO L226 Difference]: Without dead ends: 3504 [2023-12-22 02:33:55,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:55,213 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 233 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:55,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 375 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2023-12-22 02:33:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3502. [2023-12-22 02:33:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 2857 states have (on average 1.135106755337767) internal successors, (3243), 2896 states have internal predecessors, (3243), 330 states have call successors, (330), 245 states have call predecessors, (330), 313 states have return successors, (405), 361 states have call predecessors, (405), 329 states have call successors, (405) [2023-12-22 02:33:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 3978 transitions. [2023-12-22 02:33:55,566 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 3978 transitions. Word has length 180 [2023-12-22 02:33:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:55,566 INFO L495 AbstractCegarLoop]: Abstraction has 3502 states and 3978 transitions. [2023-12-22 02:33:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 3978 transitions. [2023-12-22 02:33:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-22 02:33:55,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:55,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:33:55,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-22 02:33:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:55,769 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:55,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1604635817, now seen corresponding path program 1 times [2023-12-22 02:33:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450296845] [2023-12-22 02:33:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:55,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:55,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:55,771 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:55,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-12-22 02:33:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:55,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:55,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-22 02:33:55,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:55,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450296845] [2023-12-22 02:33:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450296845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:55,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702668738] [2023-12-22 02:33:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:55,871 INFO L87 Difference]: Start difference. First operand 3502 states and 3978 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:56,230 INFO L93 Difference]: Finished difference Result 4944 states and 5602 transitions. [2023-12-22 02:33:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2023-12-22 02:33:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:56,236 INFO L225 Difference]: With dead ends: 4944 [2023-12-22 02:33:56,236 INFO L226 Difference]: Without dead ends: 3502 [2023-12-22 02:33:56,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:56,238 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 126 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:56,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 509 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2023-12-22 02:33:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3502. [2023-12-22 02:33:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 2857 states have (on average 1.1288064403220162) internal successors, (3225), 2896 states have internal predecessors, (3225), 330 states have call successors, (330), 245 states have call predecessors, (330), 313 states have return successors, (405), 361 states have call predecessors, (405), 329 states have call successors, (405) [2023-12-22 02:33:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 3960 transitions. [2023-12-22 02:33:56,593 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 3960 transitions. Word has length 181 [2023-12-22 02:33:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 3502 states and 3960 transitions. [2023-12-22 02:33:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-22 02:33:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 3960 transitions. [2023-12-22 02:33:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-22 02:33:56,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:56,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:33:56,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Ended with exit code 0 [2023-12-22 02:33:56,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:56,799 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:56,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -565730445, now seen corresponding path program 1 times [2023-12-22 02:33:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588588199] [2023-12-22 02:33:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:56,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:56,801 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:56,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-22 02:33:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:56,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:56,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 02:33:57,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:33:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-22 02:33:57,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588588199] [2023-12-22 02:33:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588588199] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:33:57,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:33:57,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2023-12-22 02:33:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811293550] [2023-12-22 02:33:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:57,152 INFO L87 Difference]: Start difference. First operand 3502 states and 3960 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-22 02:33:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:57,743 INFO L93 Difference]: Finished difference Result 3504 states and 3962 transitions. [2023-12-22 02:33:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:33:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 183 [2023-12-22 02:33:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:57,747 INFO L225 Difference]: With dead ends: 3504 [2023-12-22 02:33:57,747 INFO L226 Difference]: Without dead ends: 1713 [2023-12-22 02:33:57,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:57,750 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 425 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:57,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1068 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:33:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2023-12-22 02:33:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1713. [2023-12-22 02:33:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1355 states have (on average 1.1859778597785977) internal successors, (1607), 1379 states have internal predecessors, (1607), 167 states have call successors, (167), 131 states have call predecessors, (167), 190 states have return successors, (226), 202 states have call predecessors, (226), 166 states have call successors, (226) [2023-12-22 02:33:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2000 transitions. [2023-12-22 02:33:57,973 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2000 transitions. Word has length 183 [2023-12-22 02:33:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:57,973 INFO L495 AbstractCegarLoop]: Abstraction has 1713 states and 2000 transitions. [2023-12-22 02:33:57,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-22 02:33:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2000 transitions. [2023-12-22 02:33:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-22 02:33:57,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:57,976 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-12-22 02:33:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:58,177 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:58,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1822245264, now seen corresponding path program 1 times [2023-12-22 02:33:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544251804] [2023-12-22 02:33:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:58,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:58,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:58,179 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-22 02:33:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:58,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:33:58,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-22 02:33:58,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:58,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544251804] [2023-12-22 02:33:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544251804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:33:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911820291] [2023-12-22 02:33:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:58,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:33:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:33:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:58,383 INFO L87 Difference]: Start difference. First operand 1713 states and 2000 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-22 02:33:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:58,717 INFO L93 Difference]: Finished difference Result 4216 states and 4984 transitions. [2023-12-22 02:33:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:33:58,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 229 [2023-12-22 02:33:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:58,721 INFO L225 Difference]: With dead ends: 4216 [2023-12-22 02:33:58,721 INFO L226 Difference]: Without dead ends: 1748 [2023-12-22 02:33:58,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:33:58,724 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:58,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 225 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:33:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2023-12-22 02:33:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1713. [2023-12-22 02:33:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1355 states have (on average 1.1763837638376384) internal successors, (1594), 1379 states have internal predecessors, (1594), 167 states have call successors, (167), 131 states have call predecessors, (167), 190 states have return successors, (226), 202 states have call predecessors, (226), 166 states have call successors, (226) [2023-12-22 02:33:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 1987 transitions. [2023-12-22 02:33:58,928 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 1987 transitions. Word has length 229 [2023-12-22 02:33:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:58,928 INFO L495 AbstractCegarLoop]: Abstraction has 1713 states and 1987 transitions. [2023-12-22 02:33:58,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-22 02:33:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 1987 transitions. [2023-12-22 02:33:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-22 02:33:58,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:58,931 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-22 02:33:58,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:59,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,131 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:59,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -294932154, now seen corresponding path program 1 times [2023-12-22 02:33:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:59,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113459720] [2023-12-22 02:33:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:59,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:59,133 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-12-22 02:33:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:59,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:59,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:33:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-22 02:33:59,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:33:59,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:33:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113459720] [2023-12-22 02:33:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113459720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:33:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:33:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:33:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569499991] [2023-12-22 02:33:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:33:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:33:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:33:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:33:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:33:59,274 INFO L87 Difference]: Start difference. First operand 1713 states and 1987 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-22 02:33:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:33:59,559 INFO L93 Difference]: Finished difference Result 2526 states and 2940 transitions. [2023-12-22 02:33:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:33:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 230 [2023-12-22 02:33:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:33:59,561 INFO L225 Difference]: With dead ends: 2526 [2023-12-22 02:33:59,561 INFO L226 Difference]: Without dead ends: 884 [2023-12-22 02:33:59,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:33:59,563 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 75 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:33:59,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 264 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:33:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2023-12-22 02:33:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 802. [2023-12-22 02:33:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 627 states have (on average 1.1467304625199362) internal successors, (719), 635 states have internal predecessors, (719), 84 states have call successors, (84), 71 states have call predecessors, (84), 90 states have return successors, (113), 95 states have call predecessors, (113), 83 states have call successors, (113) [2023-12-22 02:33:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 916 transitions. [2023-12-22 02:33:59,669 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 916 transitions. Word has length 230 [2023-12-22 02:33:59,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:33:59,670 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 916 transitions. [2023-12-22 02:33:59,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 3 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-22 02:33:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 916 transitions. [2023-12-22 02:33:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-22 02:33:59,671 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:33:59,671 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:33:59,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-12-22 02:33:59,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,877 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:33:59,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:33:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash -676105984, now seen corresponding path program 1 times [2023-12-22 02:33:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:33:59,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391415717] [2023-12-22 02:33:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:33:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:33:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:33:59,878 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:33:59,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-12-22 02:33:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:33:59,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:33:59,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-22 02:34:00,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:00,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391415717] [2023-12-22 02:34:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391415717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:34:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365602003] [2023-12-22 02:34:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:00,031 INFO L87 Difference]: Start difference. First operand 802 states and 916 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:34:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:00,274 INFO L93 Difference]: Finished difference Result 1539 states and 1768 transitions. [2023-12-22 02:34:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:34:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 233 [2023-12-22 02:34:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:00,275 INFO L225 Difference]: With dead ends: 1539 [2023-12-22 02:34:00,275 INFO L226 Difference]: Without dead ends: 826 [2023-12-22 02:34:00,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:00,276 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:00,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 258 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:34:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-12-22 02:34:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 808. [2023-12-22 02:34:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 631 states have (on average 1.1458003169572109) internal successors, (723), 639 states have internal predecessors, (723), 85 states have call successors, (85), 72 states have call predecessors, (85), 91 states have return successors, (115), 96 states have call predecessors, (115), 84 states have call successors, (115) [2023-12-22 02:34:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 923 transitions. [2023-12-22 02:34:00,379 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 923 transitions. Word has length 233 [2023-12-22 02:34:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:00,379 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 923 transitions. [2023-12-22 02:34:00,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-22 02:34:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 923 transitions. [2023-12-22 02:34:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-22 02:34:00,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:00,381 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:34:00,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2023-12-22 02:34:00,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:00,581 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:00,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1459777218, now seen corresponding path program 1 times [2023-12-22 02:34:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231420546] [2023-12-22 02:34:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:00,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:00,583 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:00,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-22 02:34:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:00,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:34:00,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-12-22 02:34:00,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:00,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231420546] [2023-12-22 02:34:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231420546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:00,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:34:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933696263] [2023-12-22 02:34:00,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:00,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:34:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:34:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:00,720 INFO L87 Difference]: Start difference. First operand 808 states and 923 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:34:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:00,842 INFO L93 Difference]: Finished difference Result 1521 states and 1761 transitions. [2023-12-22 02:34:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:34:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 233 [2023-12-22 02:34:00,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:00,843 INFO L225 Difference]: With dead ends: 1521 [2023-12-22 02:34:00,843 INFO L226 Difference]: Without dead ends: 802 [2023-12-22 02:34:00,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:34:00,844 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 71 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:00,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:34:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2023-12-22 02:34:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 799. [2023-12-22 02:34:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 623 states have (on average 1.130016051364366) internal successors, (704), 631 states have internal predecessors, (704), 85 states have call successors, (85), 72 states have call predecessors, (85), 90 states have return successors, (114), 95 states have call predecessors, (114), 84 states have call successors, (114) [2023-12-22 02:34:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 903 transitions. [2023-12-22 02:34:00,964 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 903 transitions. Word has length 233 [2023-12-22 02:34:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:00,964 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 903 transitions. [2023-12-22 02:34:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:34:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 903 transitions. [2023-12-22 02:34:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-22 02:34:00,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:34:00,966 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-22 02:34:00,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2023-12-22 02:34:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:01,166 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:34:01,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:34:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -998633619, now seen corresponding path program 1 times [2023-12-22 02:34:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:34:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099846837] [2023-12-22 02:34:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:34:01,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:34:01,169 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:34:01,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2023-12-22 02:34:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:34:01,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:34:01,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:34:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-22 02:34:01,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:34:01,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:34:01,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099846837] [2023-12-22 02:34:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099846837] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:34:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:34:01,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 02:34:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318227883] [2023-12-22 02:34:01,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:34:01,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:34:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:34:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:34:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:34:01,297 INFO L87 Difference]: Start difference. First operand 799 states and 903 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:34:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:34:01,475 INFO L93 Difference]: Finished difference Result 1012 states and 1140 transitions. [2023-12-22 02:34:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:34:01,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 234 [2023-12-22 02:34:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:34:01,476 INFO L225 Difference]: With dead ends: 1012 [2023-12-22 02:34:01,476 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:34:01,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:34:01,478 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 62 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:34:01,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:34:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:34:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:34:01,479 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-12-22 02:34:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:34:01,479 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2023-12-22 02:34:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:34:01,479 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:34:01,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-22 02:34:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:34:01,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:34:01,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:34:01,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:34:01,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Ended with exit code 0 [2023-12-22 02:34:01,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:34:01,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:35:09,970 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 926 936) no Hoare annotation was computed. [2023-12-22 02:35:09,970 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 926 936) no Hoare annotation was computed. [2023-12-22 02:35:09,973 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 926 936) the Hoare annotation is: (let ((.cse35 (= ~t1_st~0 (_ bv2 32))) (.cse28 (= ~t2_st~0 (_ bv2 32))) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse12 (= (_ bv2 32) ~m_st~0))) (let ((.cse26 (and .cse28 .cse10 .cse12)) (.cse24 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse36 (not (= ~local~0 ~token~0))) (.cse25 (= (_ bv1 32) ~m_pc~0)) (.cse1 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse38 (and .cse12 .cse35 (= |old(~t2_st~0)| ~t2_st~0))) (.cse34 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse23 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse37 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse17 (not (= (_ bv2 32) ~E_1~0))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse2 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse3 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse30 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse6 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~m_i~0))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse13 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse31 (not (= (_ bv0 32) ~m_pc~0))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) ~T2_E~0))) (.cse18 (not (= (_ bv2 32) ~E_M~0))) (.cse19 (not (= (_ bv1 32) ~t2_i~0))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse32 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (= |old(~m_st~0)| ~m_st~0)) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse33 (not (= (_ bv2 32) ~E_2~0))) (.cse22 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse23 .cse15 .cse16 .cse24 .cse25 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22) (or .cse0 .cse2 (and .cse27 .cse28 .cse29) .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse31 .cse14 .cse15 .cse16 .cse24 .cse18 .cse19 .cse20 .cse32 .cse21 .cse33 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse14 .cse23 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse26 .cse21 .cse22) (or .cse0 .cse2 .cse4 (and .cse27 .cse28 .cse35) .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse36 .cse14 .cse23 .cse37 .cse15 .cse16 .cse24 .cse18 .cse19 .cse20 .cse21 .cse33 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse13 .cse36 .cse31 .cse14 .cse37 .cse15 .cse16 (and .cse27 .cse11 .cse35) .cse18 .cse19 .cse20 .cse21 .cse33 .cse22) (or .cse0 .cse1 .cse2 .cse38 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse23 .cse37 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse21 .cse33 .cse22) (or .cse0 .cse1 .cse2 .cse38 .cse4 .cse5 .cse6 .cse7 .cse34 .cse8 .cse9 .cse14 .cse23 .cse37 .cse15 .cse16 .cse17 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse19 .cse20 .cse21 .cse33 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse7 .cse8 .cse9 .cse13 .cse31 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse32 .cse21 (and .cse27 .cse29 .cse11) .cse33 .cse22)))) [2023-12-22 02:35:09,973 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2023-12-22 02:35:09,973 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2023-12-22 02:35:09,973 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-22 02:35:09,974 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse38 (= (_ bv2 32) ~q_write_ev~0)) (.cse37 (= (_ bv2 32) ~q_read_ev~0)) (.cse18 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse39 (= ~q_req_up~0 (_ bv0 32)))) (let ((.cse24 (and .cse18 .cse19 .cse39)) (.cse9 (= ~c_dr_pc~0 (_ bv1 32))) (.cse29 (and .cse38 .cse37 .cse39)) (.cse30 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse25 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse27 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse28 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse31 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse7 (not (= ~q_free~0 (_ bv0 32)))) (.cse32 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse23 (not (= |old(~q_req_up~0)| (_ bv0 32)))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse36 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse1 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse2 (not (= (_ bv0 32) ~m_st~0))) (.cse26 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse35 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse3 (not (= (_ bv2 32) ~T1_E~0))) (.cse4 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse5 (not (= ~local~0 ~token~0))) (.cse6 (not (= (_ bv0 32) ~m_pc~0))) (.cse8 (not (= (_ bv2 32) ~T2_E~0))) (.cse10 (not (= ~t1_st~0 (_ bv0 32)))) (.cse11 (not (= (_ bv2 32) ~E_1~0))) (.cse12 (not (= ~t2_st~0 (_ bv0 32)))) (.cse13 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse14 (not (= |old(~q_req_up~0)| (_ bv1 32)))) (.cse15 (not (= (_ bv2 32) ~E_M~0))) (.cse16 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse17 (= ~q_req_up~0 (_ bv1 32))) (.cse20 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= (_ bv2 32) ~E_2~0))) (.cse33 (not (= ~q_free~0 (_ bv1 32)))) (.cse34 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse19) .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse2 .cse26 .cse27 .cse3 (not (= ~c_dr_st~0 (_ bv0 32))) .cse28 .cse29 .cse23 .cse4 .cse5 .cse6 .cse30 .cse31 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse32 .cse16 .cse21 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse2 .cse26 .cse35 .cse3 .cse29 .cse23 .cse4 .cse6 .cse30 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse20 .cse21 .cse22 .cse33 .cse34) (or .cse0 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse10 .cse11 .cse12 .cse13 (and .cse17 .cse37 .cse18) .cse14 .cse15 .cse16 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse35 .cse3 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse20 .cse21 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse29 .cse23 .cse4 .cse6 .cse30 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse20 .cse21 .cse22) (or .cse0 .cse25 .cse1 .cse27 .cse3 .cse28 .cse6 .cse31 .cse8 .cse19 .cse11 .cse13 .cse15 .cse32 .cse21 .cse22 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse19 .cse11 .cse13 .cse15 .cse32 .cse21 .cse22) (or .cse0 .cse36 .cse1 .cse2 .cse26 (and .cse38 .cse19 .cse39) .cse35 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse20 .cse21 .cse22 .cse33 .cse34) (or .cse0 .cse36 .cse1 .cse2 .cse26 .cse35 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse38 .cse17 .cse19) .cse20 .cse21 .cse22 .cse33 .cse34)))) [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 689) no Hoare annotation was computed. [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L680-2(lines 680 689) no Hoare annotation was computed. [2023-12-22 02:35:09,979 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 648) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L672(lines 660 674) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L681(lines 681 686) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 670) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 921) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L661-2(lines 661 670) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L917-2(lines 892 925) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L653(lines 641 655) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L909(lines 909 913) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L909-2(lines 909 913) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 892 925) the Hoare annotation is: (let ((.cse38 (= ~t1_st~0 (_ bv2 32))) (.cse10 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse34 (= ~t2_st~0 (_ bv2 32))) (.cse35 (= ~t1_st~0 (_ bv0 32))) (.cse12 (= (_ bv2 32) ~m_st~0))) (let ((.cse25 (and .cse34 .cse35 .cse12)) (.cse32 (and .cse34 .cse10 .cse12)) (.cse29 (not (= ~local~0 ~token~0))) (.cse31 (= (_ bv1 32) ~m_pc~0)) (.cse40 (and .cse12 .cse38 (= |old(~t2_st~0)| ~t2_st~0))) (.cse23 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse13 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse36 (not (= (_ bv0 32) ~m_pc~0))) (.cse26 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse33 (= |old(~m_st~0)| ~m_st~0)) (.cse24 (not (= |old(~t2_st~0)| (_ bv2 32)))) (.cse41 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32))))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse2 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse3 (not (= |old(~t2_st~0)| (_ bv0 32)))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse6 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~m_i~0))) (.cse28 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse30 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse39 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (not (= (_ bv2 32) ~T2_E~0))) (.cse17 (not (= (_ bv2 32) ~E_1~0))) (.cse18 (not (= (_ bv2 32) ~E_M~0))) (.cse19 (not (= (_ bv1 32) ~t2_i~0))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse37 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse21 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= (_ bv2 32) ~E_2~0))) (.cse22 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse24 .cse17 .cse25 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse23 .cse6 .cse7 .cse28 .cse8 .cse9 .cse29 .cse14 .cse30 .cse15 .cse16 .cse24 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse30 .cse15 .cse16 .cse24 .cse31 .cse17 .cse18 .cse19 .cse20 .cse32 .cse21 .cse22) (or .cse0 .cse2 (and .cse33 .cse34 .cse35) .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse36 .cse14 .cse15 .cse16 .cse24 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse14 .cse30 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse37 .cse32 .cse21 .cse22) (or .cse0 .cse2 .cse4 (and .cse33 .cse34 .cse38) .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse29 .cse14 .cse30 .cse39 .cse15 .cse16 .cse24 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse39 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 (and .cse34 .cse12 .cse38) .cse21 .cse27 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse13 .cse29 .cse36 .cse14 .cse39 .cse15 .cse16 (and .cse33 .cse11 .cse38) .cse18 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse40 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse30 .cse39 .cse15 .cse16 .cse31 .cse17 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse40 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse14 .cse30 .cse39 .cse15 .cse16 .cse17 .cse41 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse13 .cse36 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse26 .cse21 (and .cse33 .cse35 .cse11) .cse27 .cse22) (or .cse0 (not (= |old(~m_st~0)| (_ bv0 32))) .cse2 .cse4 (and .cse34 (= (_ bv0 32) ~m_st~0) .cse38) .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse14 .cse30 .cse39 .cse15 .cse16 .cse24 .cse17 .cse41 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse28 .cse8 .cse9 .cse14 .cse30 (and .cse11 .cse12 .cse38) .cse39 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse21 .cse27 .cse22)))) [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 905) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point L901-2(lines 901 905) no Hoare annotation was computed. [2023-12-22 02:35:09,980 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 892 925) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 667) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point L691(lines 679 693) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 651) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse26 (= (_ bv2 32) ~c_dr_st~0))) (let ((.cse23 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse13 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse15 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse25 (not (= ~q_free~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (and (= ~p_dw_st~0 (_ bv2 32)) .cse26)) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse6 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse24 (not (= ~local~0 ~token~0))) (.cse33 (= ~c_dr_pc~0 (_ bv1 32))) (.cse9 (not (= ~t1_st~0 (_ bv0 32)))) (.cse11 (not (= ~t2_st~0 (_ bv0 32)))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse28 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse29 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse32 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse30 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) ~m_pc~0))) (.cse31 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) ~T2_E~0))) (.cse10 (not (= (_ bv2 32) ~E_1~0))) (.cse12 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse14 (not (= (_ bv2 32) ~E_M~0))) (.cse27 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse18 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= (_ bv2 32) ~E_2~0))) (.cse21 (not (= ~q_free~0 (_ bv1 32)))) (.cse22 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 (not (= (_ bv1 32) ~q_write_ev~0)) .cse3 .cse5 .cse6 .cse24 .cse7 .cse25 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse5 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse26) .cse7 .cse25 .cse8 .cse10 .cse12 .cse14 .cse27 .cse16 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse28 .cse3 .cse29 .cse5 .cse30 (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse6 .cse24 .cse7 .cse31 .cse8 (and .cse32 (= ~c_dr_st~0 (_ bv0 32))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse24 .cse7 .cse25 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse2 .cse28 .cse29 (and .cse32 .cse26) .cse5 .cse30 .cse7 .cse31 .cse8 .cse10 .cse12 .cse14 .cse27 .cse16 .cse18 .cse19 .cse21 .cse22)))) [2023-12-22 02:35:09,981 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse37 (= (_ bv2 32) ~E_2~0)) (.cse5 (= activate_threads1_~tmp~1 (_ bv0 32))) (.cse32 (= ~p_last_write~0 ~q_buf_0~0)) (.cse33 (= (_ bv2 32) ~E_M~0)) (.cse35 (= (_ bv2 32) ~q_read_ev~0)) (.cse36 (= ~p_dw_i~0 (_ bv1 32))) (.cse41 (= (_ bv2 32) ~E_1~0)) (.cse34 (= (_ bv2 32) ~T2_E~0)) (.cse42 (= (_ bv0 32) ~m_pc~0)) (.cse39 (= (_ bv2 32) ~T1_E~0)) (.cse38 (= (_ bv2 32) ~M_E~0)) (.cse40 (= ~p_last_write~0 ~c_last_read~0)) (.cse43 (= ~q_free~0 (_ bv1 32))) (.cse50 (= ~p_dw_st~0 (_ bv0 32))) (.cse45 (= ~p_num_write~0 ~c_num_read~0)) (.cse27 (= ~p_dw_st~0 (_ bv2 32))) (.cse44 (= (_ bv2 32) ~c_dr_st~0))) (let ((.cse30 (= ~p_dw_st~0 |old(~p_dw_st~0)|)) (.cse24 (= ~c_dr_pc~0 (_ bv1 32))) (.cse48 (and .cse27 .cse44)) (.cse31 (not .cse45)) (.cse46 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse2 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse47 (and .cse50 .cse44)) (.cse4 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse13 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse17 (not .cse43)) (.cse18 (not .cse40)) (.cse19 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse0 (not .cse38)) (.cse49 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse20 (not (= (_ bv0 32) ~m_st~0))) (.cse3 (not .cse39)) (.cse21 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse22 (not (= ~local~0 ~token~0))) (.cse6 (not .cse42)) (.cse23 (not (= ~q_free~0 (_ bv0 32)))) (.cse8 (not .cse34)) (.cse25 (not (= ~t1_st~0 (_ bv0 32)))) (.cse9 (not .cse41)) (.cse26 (not (= ~t2_st~0 (_ bv0 32)))) (.cse10 (not .cse36)) (.cse11 (not .cse35)) (.cse12 (not .cse33)) (.cse14 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse28 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse15 (not .cse32)) (.cse51 (and .cse5 .cse27 .cse44)) (.cse16 (not .cse37)) (.cse29 (not (= (_ bv2 32) |old(~p_dw_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse20 .cse3 .cse21 .cse22 .cse6 .cse23 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 (and .cse5 .cse27) .cse14 .cse28 .cse15 .cse16 .cse29) (or .cse0 (and .cse5 .cse30) .cse3 .cse6 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse20 .cse31 (and .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse5 .cse39 .cse27 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) .cse3 .cse21 .cse6 .cse8 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse46 .cse14 .cse28 .cse15 .cse16 .cse29 .cse17 .cse18) (or .cse0 .cse47 .cse3 (and .cse30 .cse44) .cse6 .cse23 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse48 .cse0 .cse20 .cse31 .cse47 .cse3 .cse21 .cse22 .cse6 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse28 .cse15 .cse16 .cse29 .cse17 .cse18) (or .cse19 .cse0 (and .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse5 .cse39 .cse27 .cse40 .cse41 .cse42 .cse43 .cse45) .cse20 .cse31 .cse3 .cse21 .cse22 .cse6 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse28 .cse15 .cse16 .cse29 .cse17 .cse18) (or .cse19 .cse48 .cse0 .cse20 .cse47 .cse3 .cse21 .cse22 .cse6 .cse23 .cse8 .cse24 .cse25 .cse9 .cse26 .cse10 .cse12 .cse14 .cse28 .cse15 .cse16 .cse29) (or .cse19 .cse48 .cse0 .cse49 .cse20 .cse31 .cse3 .cse21 .cse22 .cse6 .cse8 (and .cse50 .cse44 (= (_ bv1 32) ~q_read_ev~0)) .cse25 .cse9 .cse26 .cse10 .cse12 .cse46 .cse14 .cse28 .cse15 .cse16 .cse29 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse21 .cse22 .cse6 .cse7 .cse8 .cse25 (and .cse5 .cse50 (= ~c_dr_st~0 (_ bv0 32))) .cse9 .cse26 .cse10 .cse11 .cse12 .cse46 .cse13 .cse28 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse20 .cse3 .cse21 .cse6 .cse23 .cse8 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse46 .cse14 .cse28 .cse15 .cse51 .cse16 .cse29) (or .cse0 .cse1 .cse2 .cse47 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse49 (not (= (_ bv1 32) ~q_write_ev~0)) .cse20 .cse3 .cse21 .cse22 .cse6 .cse23 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse14 .cse28 .cse15 .cse51 .cse16 .cse29)))) [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2023-12-22 02:35:09,981 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse26 (= (_ bv2 32) ~c_dr_st~0))) (let ((.cse23 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse13 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse15 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse25 (not (= ~q_free~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (and (= ~p_dw_st~0 (_ bv2 32)) .cse26)) (.cse3 (not (= (_ bv0 32) ~m_st~0))) (.cse4 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse6 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse24 (not (= ~local~0 ~token~0))) (.cse33 (= ~c_dr_pc~0 (_ bv1 32))) (.cse9 (not (= ~t1_st~0 (_ bv0 32)))) (.cse11 (not (= ~t2_st~0 (_ bv0 32)))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse20 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse2 (not (= (_ bv2 32) ~M_E~0))) (.cse28 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse29 (not (= |old(~p_dw_st~0)| (_ bv0 32)))) (.cse32 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv2 32) ~T1_E~0))) (.cse30 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv0 32) ~m_pc~0))) (.cse31 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse8 (not (= (_ bv2 32) ~T2_E~0))) (.cse10 (not (= (_ bv2 32) ~E_1~0))) (.cse12 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse14 (not (= (_ bv2 32) ~E_M~0))) (.cse27 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse18 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= (_ bv2 32) ~E_2~0))) (.cse21 (not (= ~q_free~0 (_ bv1 32)))) (.cse22 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse23 (not (= (_ bv1 32) ~q_write_ev~0)) .cse3 .cse5 .cse6 .cse24 .cse7 .cse25 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse5 (and (= ~p_dw_st~0 |old(~p_dw_st~0)|) .cse26) .cse7 .cse25 .cse8 .cse10 .cse12 .cse14 .cse27 .cse16 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse2 .cse28 .cse3 .cse29 .cse5 .cse30 (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse6 .cse24 .cse7 .cse31 .cse8 (and .cse32 (= ~c_dr_st~0 (_ bv0 32))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse27 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse24 .cse7 .cse25 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse33 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse2 .cse28 .cse29 (and .cse32 .cse26) .cse5 .cse30 .cse7 .cse31 .cse8 .cse10 .cse12 .cse14 .cse27 .cse16 .cse18 .cse19 .cse21 .cse22)))) [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 695 702) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 695 702) the Hoare annotation is: true [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L830-1(lines 819 852) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L820-1(lines 819 852) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L845-1(lines 816 853) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 816 853) the Hoare annotation is: (let ((.cse2 (not (= (_ bv0 32) ~m_st~0))) (.cse13 (not (= (_ bv0 32) ~m_pc~0))) (.cse23 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse26 (not (= ~t2_st~0 (_ bv2 32)))) (.cse12 (not (= ~local~0 ~token~0))) (.cse17 (not (= ~t1_st~0 (_ bv0 32)))) (.cse30 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse11 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse6 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~m_i~0))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse10 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse27 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse28 (= (_ bv1 32) ~m_pc~0)) (.cse18 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse19 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse20 (not (= ~t2_st~0 (_ bv0 32)))) (.cse21 (not (= (_ bv1 32) ~t2_i~0))) (.cse31 (not (= ~t1_st~0 (_ bv2 32)))) (.cse29 (not (= (_ bv2 32) ~m_st~0))) (.cse22 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse24 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse18 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse19 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25))) [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L835-1(lines 819 852) no Hoare annotation was computed. [2023-12-22 02:35:09,982 INFO L899 garLoopResultBuilder]: For program point L825-1(lines 819 852) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L840-1(lines 819 852) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 816 853) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse20 (= (_ bv2 32) ~q_write_ev~0)) (.cse35 (= (_ bv2 32) ~q_read_ev~0))) (let ((.cse5 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse30 (and .cse20 .cse35)) (.cse25 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse26 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse27 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse29 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse6 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse23 (not (= ~q_free~0 (_ bv1 32)))) (.cse24 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse2 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse28 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse31 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~M_E~0))) (.cse3 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse4 (not (= (_ bv0 32) ~m_st~0))) (.cse7 (not (= (_ bv2 32) ~T1_E~0))) (.cse8 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse9 (not (= ~local~0 ~token~0))) (.cse10 (not (= (_ bv0 32) ~m_pc~0))) (.cse32 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= (_ bv2 32) ~T2_E~0))) (.cse33 (= ~c_dr_pc~0 (_ bv1 32))) (.cse34 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse21)) (.cse12 (not (= ~t1_st~0 (_ bv0 32)))) (.cse13 (not (= (_ bv2 32) ~E_1~0))) (.cse14 (not (= ~t2_st~0 (_ bv0 32)))) (.cse15 (not (= ~p_dw_i~0 (_ bv1 32)))) (.cse16 (not (= (_ bv2 32) ~E_M~0))) (.cse17 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse18 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse19 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= (_ bv2 32) ~E_2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (and .cse20 .cse21) .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse25 .cse4 .cse5 .cse26 .cse7 (not (= ~c_dr_st~0 (_ bv0 32))) .cse27 .cse8 .cse9 .cse10 .cse28 .cse29 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse19 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse28 .cse32 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23 .cse24) (or .cse1 .cse25 .cse3 .cse26 .cse7 .cse27 .cse10 .cse29 .cse11 .cse21 .cse13 .cse15 .cse16 .cse31 .cse19 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 (and .cse35 (= (_ bv0 32) ~q_write_ev~0)) .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse28 .cse32 (not (= |old(~q_write_ev~0)| (_ bv0 32))) .cse11 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (or .cse1 .cse3 .cse7 .cse10 .cse32 .cse11 .cse21 .cse13 .cse15 .cse16 .cse31 .cse19 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse33 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22)))) [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L103(lines 91 105) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L960-1(lines 949 982) no Hoare annotation was computed. [2023-12-22 02:35:09,983 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L895 garLoopResultBuilder]: At program point L795-1(lines 757 809) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 757 809) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 132 171) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse24 (= ~p_dw_st~0 (_ bv0 32))) (.cse27 (= ~c_dr_pc~0 (_ bv0 32))) (.cse23 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse22 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse25 (= ~local~0 ~token~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse22 .cse10 .cse15 .cse16 .cse27 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse21) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 (_ bv0 32)) .cse5 (= ~p_num_write~0 (_ bv0 32)) .cse6 .cse8 .cse10 .cse13 .cse24 .cse15 .cse16 .cse27 .cse18 .cse19 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse25 .cse21 (= ~c_dr_st~0 (_ bv0 32))))) [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L895 garLoopResultBuilder]: At program point L1029-1(lines 1029 1066) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 805) no Hoare annotation was computed. [2023-12-22 02:35:09,984 INFO L899 garLoopResultBuilder]: For program point L798-2(lines 798 805) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse23 (= (_ bv2 32) ~q_read_ev~0)) (.cse5 (= ~q_req_up~0 (_ bv1 32))) (.cse24 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse27 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~E_M~0)) (.cse3 (= (_ bv2 32) ~T2_E~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse26 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~M_E~0)) (.cse10 (= (_ bv0 32) ~m_st~0)) (.cse11 (= (_ bv2 32) ~T1_E~0)) (.cse12 (= ~t2_st~0 (_ bv0 32))) (.cse13 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse15 (= ~t2_pc~0 (_ bv0 32))) (.cse16 (= (_ bv2 32) ~E_1~0)) (.cse17 (= (_ bv0 32) ~m_pc~0)) (.cse25 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= ~local~0 ~token~0)) (.cse19 (= ~q_free~0 (_ bv1 32))) (.cse20 (= (_ bv2 32) ~c_dr_st~0)) (.cse21 (= ~p_num_write~0 ~c_num_read~0)) (.cse22 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse23 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse25 .cse20 .cse22) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse26 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse24 .cse11 .cse16 .cse17 .cse27 .cse20) (and .cse1 .cse2 .cse3 .cse6 .cse26 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse25 .cse18 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 (= ~c_num_read~0 (_ bv0 32)) .cse6 (= ~p_num_write~0 (_ bv0 32)) .cse7 .cse9 .cse11 .cse14 (= ~p_dw_st~0 (_ bv0 32)) .cse16 .cse17 .cse27 .cse19 .cse20 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse22))) [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 566 601) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L965-1(lines 949 982) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 757 809) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 1014 1072) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 522 565) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 578) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse24 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32))) (.cse26 (= ~q_req_up~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse28 (= ~c_num_read~0 (_ bv0 32))) (.cse32 (= ~p_num_write~0 (_ bv0 32))) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32))) (.cse34 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse19 (= ~q_free~0 (_ bv1 32))) (.cse20 (= (_ bv2 32) ~c_dr_st~0)) (.cse21 (= ~p_num_write~0 ~c_num_read~0)) (.cse25 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse33 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse29 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse27 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= ~local~0 ~token~0)) (.cse22 (= ~t1_pc~0 (_ bv0 32))) (.cse31 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (_ bv1 32)) .cse26 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse30 .cse18 .cse22 .cse31 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28 .cse5 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse22 .cse31 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse26 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse20 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse29 .cse10 .cse15 .cse16 .cse30 .cse20) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse28 .cse5 .cse32 .cse6 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse30 .cse19 .cse20 .cse23) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse33 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse31))) [2023-12-22 02:35:09,985 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2023-12-22 02:35:09,985 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse23 (= ~c_dr_pc~0 (_ bv0 32))) (.cse24 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse22 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse25 (= ~local~0 ~token~0)) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse22 .cse10 .cse15 .cse16 .cse23 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse24 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse21) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 (_ bv0 32)) .cse5 (= ~p_num_write~0 (_ bv0 32)) .cse6 .cse8 .cse10 .cse13 (= ~p_dw_st~0 (_ bv0 32)) .cse15 .cse16 .cse23 .cse18 .cse19 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (= (_ bv0 32) ~q_write_ev~0) .cse25 .cse19 .cse21))) [2023-12-22 02:35:09,986 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse22 (= ~q_free~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv1 32))) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse25 (= ~c_dr_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse26 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse24 (= ~local~0 ~token~0)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (= (_ bv1 32) ~q_write_ev~0) .cse24 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse22 .cse10 .cse15 .cse16 .cse25 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse26 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19 .cse21) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 (_ bv0 32)) .cse5 (= ~p_num_write~0 (_ bv0 32)) .cse6 .cse8 .cse10 .cse13 (= ~p_dw_st~0 (_ bv0 32)) .cse15 .cse16 .cse25 .cse18 .cse19 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 413 455) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L895 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L1001-1(line 1001) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 777) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L770-2(lines 770 777) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse28 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse29 (= (_ bv1 32) ~q_write_ev~0)) (.cse26 (= (_ bv1 32) ~q_read_ev~0)) (.cse22 (= ~q_free~0 (_ bv0 32))) (.cse27 (= ~p_dw_pc~0 (_ bv1 32))) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse24 (= ~p_dw_st~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse23 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse25 (= ~local~0 ~token~0)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= (_ bv2 32) ~c_dr_st~0)) (.cse20 (= ~p_num_write~0 ~c_num_read~0)) (.cse21 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse26) (and .cse27 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse25 .cse19 .cse21) (and .cse27 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse28 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse25 .cse21 (= ~c_dr_st~0 (_ bv0 32))) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse26) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse22 .cse10 .cse15 .cse16 .cse30 .cse19) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse24 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse25 .cse19 .cse21) (and .cse27 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 (_ bv0 32)) .cse5 (= ~p_num_write~0 (_ bv0 32)) .cse6 .cse8 .cse10 .cse13 .cse24 .cse15 .cse16 .cse30 .cse18 .cse19 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 751 815) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 614) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1008) no Hoare annotation was computed. [2023-12-22 02:35:09,986 INFO L899 garLoopResultBuilder]: For program point L970-1(lines 949 982) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 173 225) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L409(lines 398 411) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2023-12-22 02:35:09,987 INFO L895 garLoopResultBuilder]: At program point L1037(line 1037) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point transmit2_returnLabel#1(lines 602 637) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L707-2(lines 706 724) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 340 393) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse22 (= ~t2_st~0 (_ bv0 32))) (.cse23 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= ~local~0 ~token~0)) (.cse16 (= ~t1_st~0 (_ bv2 32))) (.cse17 (= ~t1_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t2_st~0 (_ bv2 32))) (.cse21 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse12 (= (_ bv1 32) ~m_i~0)) (.cse24 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse25 (= ~t1_pc~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14 .cse18 .cse25 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse18 .cse25 .cse19 .cse20))) [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L543-1(line 543) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2023-12-22 02:35:09,987 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-12-22 02:35:09,988 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse24 (= ~p_num_write~0 (_ bv0 32))) (.cse26 (= ~q_free~0 (_ bv1 32))) (.cse27 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_req_up~0 (_ bv1 32))) (.cse28 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse18 (= ~local~0 ~token~0)) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse22 (= (_ bv2 32) ~q_read_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~M_E~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse25 (= ~q_req_up~0 (_ bv0 32))) (.cse23 (= (_ bv2 32) ~c_dr_st~0)) (.cse19 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (_ bv1 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse22 .cse6 .cse7 .cse8 .cse9 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse23 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse26 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse24 .cse7 .cse9 .cse12 .cse15 .cse16 .cse17 .cse26 .cse23) (and .cse0 .cse1 .cse2 .cse22 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse26 .cse23 .cse27 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse6 .cse28 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse26 .cse23 .cse27 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse23 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse6 .cse28 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse18 .cse23 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse6 .cse7 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse23 .cse19 .cse21))) [2023-12-22 02:35:09,988 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2023-12-22 02:35:09,988 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-22 02:35:09,988 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,988 INFO L895 garLoopResultBuilder]: At program point L1041-1(line 1041) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,988 INFO L899 garLoopResultBuilder]: For program point L975-1(lines 946 983) no Hoare annotation was computed. [2023-12-22 02:35:09,988 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse24 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32))) (.cse26 (= ~q_req_up~0 (_ bv1 32))) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse28 (= ~c_num_read~0 (_ bv0 32))) (.cse32 (= ~p_num_write~0 (_ bv0 32))) (.cse13 (= ~p_dw_st~0 (_ bv0 32))) (.cse30 (= ~c_dr_pc~0 (_ bv0 32))) (.cse23 (= ~p_dw_pc~0 (_ bv0 32))) (.cse34 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse12 (= ~p_last_write~0 ~c_last_read~0)) (.cse19 (= ~q_free~0 (_ bv1 32))) (.cse20 (= (_ bv2 32) ~c_dr_st~0)) (.cse21 (= ~p_num_write~0 ~c_num_read~0)) (.cse25 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse33 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse29 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse27 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= ~local~0 ~token~0)) (.cse22 (= ~t1_pc~0 (_ bv0 32))) (.cse31 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (_ bv1 32)) .cse26 .cse28 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse30 .cse18 .cse22 .cse31 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28 .cse5 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse30 .cse17 .cse18 .cse19 .cse22 .cse31 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse33 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse26 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse18 .cse20 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse29 .cse10 .cse15 .cse16 .cse30 .cse20) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse28 .cse5 .cse32 .cse6 .cse8 .cse10 .cse12 .cse13 .cse15 .cse16 .cse30 .cse19 .cse20 .cse23) (and .cse0 .cse1 .cse2 .cse5 .cse34 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse33 .cse29 .cse9 .cse10 .cse11 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse31))) [2023-12-22 02:35:09,989 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2023-12-22 02:35:09,989 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse17 (= ~q_req_up~0 (_ bv0 32))) (.cse13 (= ~p_last_write~0 ~c_last_read~0)) (.cse18 (= ~q_free~0 (_ bv1 32))) (.cse19 (= ~p_num_write~0 ~c_num_read~0)) (.cse24 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_i~0 (_ bv1 32))) (.cse22 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~M_E~0)) (.cse9 (= (_ bv0 32) ~m_st~0)) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~t2_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse14 (= ~t2_pc~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~E_1~0)) (.cse16 (= (_ bv0 32) ~m_pc~0)) (.cse23 (= ~local~0 ~token~0)) (.cse20 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= |ULTIMATE.start_eval1_~tmp___1~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (= ~p_dw_st~0 (_ bv0 32)) .cse14 .cse15 .cse16 .cse17 .cse23 .cse18 .cse19 .cse20 (= ~p_dw_pc~0 (_ bv0 32)) .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 (= ~q_req_up~0 (_ bv1 32)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse18 .cse19 .cse20 .cse21) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse5 .cse22 .cse6 .cse7 .cse8 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse23 .cse20 .cse21))) [2023-12-22 02:35:09,989 INFO L895 garLoopResultBuilder]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,989 INFO L899 garLoopResultBuilder]: For program point L712-1(lines 706 724) no Hoare annotation was computed. [2023-12-22 02:35:09,989 INFO L899 garLoopResultBuilder]: For program point L250-1(lines 241 258) no Hoare annotation was computed. [2023-12-22 02:35:09,989 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,989 INFO L899 garLoopResultBuilder]: For program point L1010(lines 999 1012) no Hoare annotation was computed. [2023-12-22 02:35:09,989 INFO L895 garLoopResultBuilder]: At program point L581-1(lines 581 594) the Hoare annotation is: (let ((.cse17 (= (_ bv2 32) ~m_st~0)) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse22 (= ~t2_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse23 (= (_ bv0 32) ~m_st~0)) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse21 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse24 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse25 (= ~local~0 ~token~0)) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~t1_pc~0 (_ bv1 32)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= (_ bv1 32) ~m_pc~0)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse25 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse24 .cse15 .cse16 .cse25 .cse18 .cse19 .cse20))) [2023-12-22 02:35:09,989 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 757 809) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L895 garLoopResultBuilder]: At program point L617-1(lines 617 630) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 (_ bv1 32))) (.cse22 (= (_ bv2 32) ~m_st~0)) (.cse16 (= ~t1_st~0 (_ bv2 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse21 (= ~t1_st~0 (_ bv0 32))) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~m_st~0)) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse12 (= (_ bv1 32) ~m_i~0)) (.cse13 (= (_ bv2 32) ~E_1~0)) (.cse25 (= (_ bv0 32) ~m_pc~0)) (.cse14 (= ~c_dr_pc~0 (_ bv0 32))) (.cse15 (= ~q_req_up~0 (_ bv0 32))) (.cse24 (= ~local~0 ~token~0)) (.cse18 (= (_ bv1 32) ~t1_i~0)) (.cse23 (= ~t1_pc~0 (_ bv0 32))) (.cse19 (= ~c_dr_st~0 (_ bv0 32))) (.cse20 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~t2_pc~0 (_ bv1 32)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse18 .cse23 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse24 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 (not (= (_ bv1 32) ~m_pc~0)) .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse24 .cse18 .cse23 .cse19 .cse20))) [2023-12-22 02:35:09,990 INFO L895 garLoopResultBuilder]: At program point L551-1(lines 537 558) the Hoare annotation is: (let ((.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse8 (= ~t2_st~0 (_ bv2 32))) (.cse22 (= ~t1_st~0 (_ bv0 32))) (.cse24 (= ~t1_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~T1_E~0)) (.cse26 (= ~t2_st~0 (_ bv0 32))) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse27 (= ~t2_pc~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse23 (= (_ bv0 32) ~m_pc~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse25 (= ~local~0 ~token~0)) (.cse17 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse19 (= (_ bv1 32) ~t1_i~0)) (.cse20 (= ~c_dr_st~0 (_ bv0 32))) (.cse21 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse19 .cse24 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse22 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse27 .cse14 .cse23 .cse15 .cse16 .cse19 .cse24 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse27 .cse14 .cse23 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21))) [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 703 725) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_dw_i~0 (_ bv1 32)) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= ~q_free~0 (_ bv1 32)) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1057) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L1048-2(lines 1048 1057) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 791) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L784-2(lines 784 791) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 954) no Hoare annotation was computed. [2023-12-22 02:35:09,990 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 949 982) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 (_ bv0 32)) .cse7 (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 .cse10 (= ~t2_pc~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse14 (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse15))) [2023-12-22 02:35:09,991 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 (_ bv0 32)) .cse7 (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 .cse10 (= ~t2_pc~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse14 (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse15))) [2023-12-22 02:35:09,991 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~p_dw_i~0 (_ bv1 32))) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= (_ bv2 32) ~M_E~0)) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= (_ bv0 32) ~m_pc~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_free~0 (_ bv1 32))) (.cse15 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) .cse3 .cse4 .cse5 .cse6 (= ~t1_st~0 (_ bv0 32)) .cse7 (= (_ bv0 32) ~m_st~0) .cse8 (= ~t2_st~0 (_ bv0 32)) .cse9 .cse10 (= ~t2_pc~0 (_ bv0 32)) .cse11 .cse12 .cse13 (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) .cse14 (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (_ bv2 32) ~c_dr_st~0) .cse15))) [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L1085(lines 1085 1091) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L895 garLoopResultBuilder]: At program point L1052(line 1052) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L1052-1(line 1052) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L895 garLoopResultBuilder]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse18 (= ~t2_pc~0 (_ bv1 32))) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse19 (= ~t2_st~0 (_ bv2 32))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~T1_E~0)) (.cse8 (= ~p_last_write~0 ~c_last_read~0)) (.cse9 (= ~p_dw_st~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~m_i~0)) (.cse11 (= (_ bv2 32) ~E_1~0)) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_req_up~0 (_ bv0 32))) (.cse14 (= (_ bv2 32) ~m_st~0)) (.cse15 (= (_ bv1 32) ~t1_i~0)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse17 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t2_st~0 (_ bv0 32)) .cse8 .cse9 .cse10 (= ~t2_pc~0 (_ bv0 32)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse18 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~t1_pc~0 (_ bv1 32)) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= (_ bv1 32) ~m_pc~0)) .cse15 .cse16 .cse17))) [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L591-1(line 591) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 1090) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L955-1(lines 949 982) no Hoare annotation was computed. [2023-12-22 02:35:09,991 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 534) no Hoare annotation was computed. [2023-12-22 02:35:09,992 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse5 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= ~p_num_write~0 (_ bv0 32))) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse19 (= ~c_dr_pc~0 (_ bv0 32))) (.cse25 (= ~p_dw_pc~0 (_ bv0 32))) (.cse30 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse14 (= ~p_last_write~0 ~c_last_read~0)) (.cse22 (= ~q_free~0 (_ bv1 32))) (.cse27 (= (_ bv2 32) ~c_dr_st~0)) (.cse28 (= ~p_num_write~0 ~c_num_read~0)) (.cse31 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse6 (= ~p_dw_i~0 (_ bv1 32))) (.cse8 (= (_ bv2 32) ~E_2~0)) (.cse9 (= ~t1_st~0 (_ bv0 32))) (.cse10 (= (_ bv2 32) ~M_E~0)) (.cse29 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv0 32) ~m_st~0)) (.cse12 (= (_ bv2 32) ~T1_E~0)) (.cse13 (= ~t2_st~0 (_ bv0 32))) (.cse26 (= ~p_dw_st~0 (_ bv2 32))) (.cse16 (= ~t2_pc~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~E_1~0)) (.cse18 (= (_ bv0 32) ~m_pc~0)) (.cse20 (= ~q_req_up~0 (_ bv0 32))) (.cse21 (= ~local~0 ~token~0)) (.cse23 (= ~t1_pc~0 (_ bv0 32))) (.cse24 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse16 .cse17 .cse18 .cse20 .cse22 .cse27 .cse28 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse20 .cse27 .cse23) (and .cse0 .cse1 .cse2 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse27 .cse28 .cse23) (and .cse31 .cse0 .cse1 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse27 .cse28 .cse23) (and .cse0 .cse1 .cse2 .cse6 .cse8 .cse10 .cse29 .cse12 .cse17 .cse18 .cse19 .cse27) (and .cse0 .cse1 .cse2 .cse6 .cse30 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse27 .cse23) (and .cse0 .cse1 .cse2 .cse6 .cse30 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse27 .cse23) (and .cse31 .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse27 .cse28 .cse23) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse22 .cse27 .cse25) (and .cse0 .cse1 .cse2 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse27 .cse28 .cse23) (and .cse31 .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse9 .cse10 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse29 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23 .cse24))) [2023-12-22 02:35:09,992 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2023-12-22 02:35:09,992 INFO L895 garLoopResultBuilder]: At program point L1022(line 1022) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:35:09,992 INFO L899 garLoopResultBuilder]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2023-12-22 02:35:09,992 INFO L895 garLoopResultBuilder]: At program point L758(line 758) the Hoare annotation is: (let ((.cse18 (= ~t1_st~0 (_ bv2 32))) (.cse19 (not (= (_ bv1 32) ~m_pc~0))) (.cse10 (= ~t2_st~0 (_ bv0 32))) (.cse24 (= ~t2_pc~0 (_ bv0 32))) (.cse25 (= ~t1_pc~0 (_ bv1 32))) (.cse3 (= ~t2_pc~0 (_ bv1 32))) (.cse26 (= (_ bv0 32) ~m_st~0)) (.cse27 (= (_ bv0 32) ~m_pc~0)) (.cse28 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= (_ bv2 32) ~T2_E~0)) (.cse4 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (= (_ bv1 32) ~t2_i~0)) (.cse6 (= ~p_num_write~0 (_ bv0 32))) (.cse7 (= (_ bv2 32) ~E_2~0)) (.cse23 (= ~t2_st~0 (_ bv2 32))) (.cse29 (= ~t1_st~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~T1_E~0)) (.cse11 (= ~p_last_write~0 ~c_last_read~0)) (.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse13 (= (_ bv1 32) ~m_i~0)) (.cse14 (= (_ bv2 32) ~E_1~0)) (.cse15 (= ~c_dr_pc~0 (_ bv0 32))) (.cse16 (= ~q_req_up~0 (_ bv0 32))) (.cse17 (= (_ bv2 32) ~m_st~0)) (.cse20 (= (_ bv1 32) ~t1_i~0)) (.cse30 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= ~c_dr_st~0 (_ bv0 32))) (.cse22 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse25 .cse20 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse26 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse25 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse26 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse28 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse30 .cse21 .cse22))) [2023-12-22 02:35:09,992 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2023-12-22 02:35:09,992 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~T2_E~0)) (.cse2 (= ~t2_pc~0 (_ bv1 32))) (.cse3 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= (_ bv1 32) ~t2_i~0)) (.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~E_2~0)) (.cse7 (= ~q_free~0 (_ bv0 32))) (.cse8 (= (_ bv2 32) ~T1_E~0)) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= (_ bv1 32) ~m_i~0)) (.cse12 (= (_ bv2 32) ~E_1~0)) (.cse13 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= ~q_req_up~0 (_ bv0 32))) (.cse15 (= (_ bv2 32) ~m_st~0)) (.cse16 (= ~t1_st~0 (_ bv2 32))) (.cse17 (= (_ bv1 32) ~t1_i~0)) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (_ bv1 32) ~m_pc~0)) .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~t1_pc~0 (_ bv1 32)) .cse17 (= ~token~0 (bvadd ~local~0 (_ bv2 32))) .cse18 .cse19))) [2023-12-22 02:35:09,992 INFO L899 garLoopResultBuilder]: For program point L627-1(line 627) no Hoare annotation was computed. [2023-12-22 02:35:09,992 INFO L899 garLoopResultBuilder]: For program point $Ultimate##104(lines 551 557) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L895 garLoopResultBuilder]: At program point L1024(line 1024) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:35:09,993 INFO L895 garLoopResultBuilder]: At program point L1024-1(line 1024) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L760(line 760) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L895 garLoopResultBuilder]: At program point L1025(line 1025) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= ~c_num_read~0 (_ bv0 32)) (= (_ bv1 32) ~t2_i~0) (= ~p_num_write~0 (_ bv0 32)) (= (_ bv2 32) ~E_2~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~t2_st~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= ~t2_pc~0 (_ bv0 32)) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L84(lines 72 86) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L275(lines 262 277) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2023-12-22 02:35:09,993 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2023-12-22 02:35:09,993 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L734(lines 734 744) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 745) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L747(lines 729 749) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 726 750) the Hoare annotation is: true [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L738(lines 738 743) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 726 750) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse46 (= (_ bv2 32) ~E_2~0)) (.cse41 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= (_ bv2 32) ~E_M~0)) (.cse45 (= ~p_dw_i~0 (_ bv1 32))) (.cse51 (= (_ bv2 32) ~E_1~0)) (.cse48 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse43 (= (_ bv2 32) ~T2_E~0)) (.cse50 (= (_ bv2 32) |old(~q_read_ev~0)|)) (.cse52 (= (_ bv0 32) ~m_pc~0)) (.cse49 (= (_ bv2 32) ~T1_E~0)) (.cse47 (= (_ bv2 32) ~M_E~0)) (.cse27 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= (_ bv2 32) ~q_write_ev~0)) (.cse44 (= (_ bv2 32) ~q_read_ev~0))) (let ((.cse35 (and .cse26 .cse44)) (.cse30 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse33 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse34 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse36 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse37 (= ~c_dr_pc~0 (_ bv1 32))) (.cse38 (and (= |old(~q_write_ev~0)| ~q_write_ev~0) .cse27)) (.cse3 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse24 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse31 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse39 (and .cse26 (= (_ bv1 32) ~q_read_ev~0))) (.cse25 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse40 (not (= |old(~q_read_ev~0)| (_ bv1 32)))) (.cse28 (not (= ~q_free~0 (_ bv1 32)))) (.cse29 (not (= ~p_last_write~0 ~c_last_read~0))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not .cse47)) (.cse2 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse4 (not (= (_ bv0 32) ~m_st~0))) (.cse5 (not .cse49)) (.cse32 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse6 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse7 (not (= ~local~0 ~token~0))) (.cse8 (not .cse52)) (.cse9 (not .cse50)) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not .cse43)) (.cse12 (not .cse48)) (.cse13 (not (= ~t1_st~0 (_ bv0 32)))) (.cse14 (not .cse51)) (.cse15 (not (= ~t2_st~0 (_ bv0 32)))) (.cse16 (not (= |old(~q_write_ev~0)| (_ bv1 32)))) (.cse17 (not .cse45)) (.cse18 (not .cse42)) (.cse19 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse20 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse21 (not .cse41)) (.cse22 (not .cse46)) (.cse23 (and .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 (= (_ bv1 32) ~q_write_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse25 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse26 .cse27) .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse30 .cse4 .cse24 .cse31 .cse5 .cse32 .cse33 .cse6 .cse7 .cse8 .cse9 .cse34 .cse11 .cse35 .cse13 .cse14 .cse15 .cse17 .cse18 .cse36 .cse19 .cse21 .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse37 .cse38 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse31 .cse25 .cse5 .cse6 .cse7 .cse8 .cse11 .cse37 .cse38 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse25 .cse5 .cse6 .cse8 .cse9 .cse11 .cse35 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28 .cse29) (or .cse1 .cse30 .cse3 .cse31 .cse5 .cse33 .cse8 .cse34 .cse11 .cse27 .cse14 .cse17 .cse18 .cse36 .cse21 .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse3 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse11 .cse37 .cse38 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28 .cse29) (or .cse1 .cse3 .cse5 .cse8 .cse10 .cse11 .cse27 .cse14 .cse17 .cse18 .cse36 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse37 .cse38 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse3 .cse4 .cse24 .cse39 .cse25 .cse5 .cse6 .cse7 .cse8 .cse11 .cse40 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse31 .cse39 .cse25 .cse5 .cse6 .cse7 .cse8 .cse11 .cse40 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse21 .cse22 .cse28 .cse29) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L863-1(lines 857 890) no Hoare annotation was computed. [2023-12-22 02:35:09,994 INFO L899 garLoopResultBuilder]: For program point L878-1(lines 857 890) no Hoare annotation was computed. [2023-12-22 02:35:09,995 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 854 891) the Hoare annotation is: (let ((.cse2 (not (= (_ bv0 32) ~m_st~0))) (.cse13 (not (= (_ bv0 32) ~m_pc~0))) (.cse23 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse26 (not (= ~t2_st~0 (_ bv2 32)))) (.cse12 (not (= ~local~0 ~token~0))) (.cse17 (not (= ~t1_st~0 (_ bv0 32)))) (.cse30 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse11 (not (= ~t2_pc~0 (_ bv0 32)))) (.cse0 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse3 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse4 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse5 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse6 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~m_i~0))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse10 (not (= (_ bv2 32) |old(~E_2~0)|))) (.cse14 (not (= ~q_free~0 (_ bv0 32)))) (.cse27 (not (= ~t2_pc~0 (_ bv1 32)))) (.cse15 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T2_E~0) (= (_ bv2 32) ~E_2~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse28 (= (_ bv1 32) ~m_pc~0)) (.cse18 (not (= (_ bv2 32) |old(~T2_E~0)|))) (.cse19 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse20 (not (= ~t2_st~0 (_ bv0 32)))) (.cse21 (not (= (_ bv1 32) ~t2_i~0))) (.cse31 (not (= ~t1_st~0 (_ bv2 32)))) (.cse29 (not (= (_ bv2 32) ~m_st~0))) (.cse22 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse24 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse18 (not (= ~token~0 (bvadd ~local~0 (_ bv2 32)))) .cse19 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse29 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse26 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse14 .cse27 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse27 .cse15 .cse16 .cse28 .cse18 .cse19 .cse20 .cse21 .cse31 .cse29 .cse22 .cse24 .cse25))) [2023-12-22 02:35:09,995 INFO L899 garLoopResultBuilder]: For program point L868-1(lines 857 890) no Hoare annotation was computed. [2023-12-22 02:35:09,995 INFO L899 garLoopResultBuilder]: For program point L858-1(lines 857 890) no Hoare annotation was computed. [2023-12-22 02:35:09,995 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 854 891) no Hoare annotation was computed. [2023-12-22 02:35:09,995 INFO L899 garLoopResultBuilder]: For program point L883-1(lines 854 891) no Hoare annotation was computed. [2023-12-22 02:35:09,995 INFO L899 garLoopResultBuilder]: For program point L873-1(lines 857 890) no Hoare annotation was computed. [2023-12-22 02:35:09,998 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:35:09,999 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:35:10,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:35:10 BoogieIcfgContainer [2023-12-22 02:35:10,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:35:10,054 INFO L158 Benchmark]: Toolchain (without parser) took 115486.86ms. Allocated memory was 208.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 158.5MB in the beginning and 802.6MB in the end (delta: -644.1MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-22 02:35:10,054 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 208.7MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:35:10,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.56ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 139.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-22 02:35:10,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.11ms. Allocated memory is still 208.7MB. Free memory was 139.1MB in the beginning and 136.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 02:35:10,067 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 208.7MB. Free memory was 136.3MB in the beginning and 132.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 02:35:10,067 INFO L158 Benchmark]: RCFGBuilder took 657.67ms. Allocated memory was 208.7MB in the beginning and 351.3MB in the end (delta: 142.6MB). Free memory was 132.4MB in the beginning and 292.1MB in the end (delta: -159.7MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2023-12-22 02:35:10,067 INFO L158 Benchmark]: TraceAbstraction took 114439.77ms. Allocated memory was 351.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 291.8MB in the beginning and 802.6MB in the end (delta: -510.8MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-22 02:35:10,068 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.54ms. Allocated memory is still 208.7MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.56ms. Allocated memory is still 208.7MB. Free memory was 158.3MB in the beginning and 139.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.11ms. Allocated memory is still 208.7MB. Free memory was 139.1MB in the beginning and 136.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 208.7MB. Free memory was 136.3MB in the beginning and 132.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 657.67ms. Allocated memory was 208.7MB in the beginning and 351.3MB in the end (delta: 142.6MB). Free memory was 132.4MB in the beginning and 292.1MB in the end (delta: -159.7MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. * TraceAbstraction took 114439.77ms. Allocated memory was 351.3MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 291.8MB in the beginning and 802.6MB in the end (delta: -510.8MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * 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: 496]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 28]: 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 15 procedures, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 114.3s, OverallIterations: 48, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 68.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10037 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9785 mSDsluCounter, 25433 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14042 mSDsCounter, 971 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7956 IncrementalHoareTripleChecker+Invalid, 8927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 971 mSolverCounterUnsat, 11391 mSDtfsCounter, 7956 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5505 GetRequests, 5383 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8079occurred in iteration=36, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 48 MinimizatonAttempts, 2041 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 6963 PreInvPairs, 7664 NumberOfFragments, 32228 HoareAnnotationTreeSize, 6963 FormulaSimplifications, 6549 FormulaSimplificationTreeSizeReduction, 9.3s HoareSimplificationTime, 52 FormulaSimplificationsInter, 137371 FormulaSimplificationTreeSizeReductionInter, 58.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 5269 NumberOfCodeBlocks, 5269 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 5470 ConstructedInterpolants, 0 QuantifiedInterpolants, 9133 SizeOfPredicates, 10 NumberOfNonLiveVariables, 11239 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 50 InterpolantComputations, 47 PerfectInterpolantSequences, 3125/3190 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 2 specifications checked. All of them hold - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0)) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (q_req_up == 1)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (t1_pc == 0))) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (((local + 1) % 4294967296) == token)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t2_st == 2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (t2_pc == 1)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (token == ((local + 2) % 4294967296))) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && !((1 == m_pc))) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (1 == t2_i)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_num_write == 1)) && (q_req_up == 1)) && (c_num_read == 0)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0)) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (q_req_up == 1)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (2 == c_dr_st))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (q_req_up == 1)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == c_dr_st)) && (t1_pc == 0))) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0)) && (p_dw_pc == 0)) && (tmp___1 == 1)) || (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (q_req_up == 1)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_num_write == 1)) && (q_req_up == 1)) && (c_num_read == 0)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0)) && (tmp___1 == 1))) || ((((((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (q_req_up == 1)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (q_req_up == 1)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_read_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && (2 == E_2)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 0)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (2 == c_dr_st)) && (t1_pc == 0))) || (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (c_num_read == 0)) && (p_dw_i == 1)) && (p_num_write == 0)) && (2 == E_2)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (p_dw_pc == 0))) || ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (2 == T2_E)) && (p_dw_i == 1)) && !((c_dr_pc == 1))) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == E_M)) && (2 == T2_E)) && (2 == q_write_ev)) && (p_dw_i == 1)) && (2 == E_2)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (t2_st == 0)) && (p_dw_st == 2)) && (t2_pc == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_req_up == 0)) && (local == token)) && (t1_pc == 0)) && (c_dr_st == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:35:10,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...