/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/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:39:14,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:39:14,127 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-25 07:39:14,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:39:14,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:39:14,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:39:14,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:39:14,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:39:14,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:39:14,157 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:39:14,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:39:14,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:39:14,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:39:14,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:39:14,159 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:39:14,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:39:14,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:39:14,159 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:39:14,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:39:14,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:39:14,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:39:14,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:39:14,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:39:14,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:39:14,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:39:14,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:39:14,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:39:14,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:39:14,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:39:14,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:39:14,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:39:14,164 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:39:14,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:39:14,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:39:14,164 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:39:14,165 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-25 07:39:14,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:39:14,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:39:14,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:39:14,370 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:39:14,371 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:39:14,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2023-12-25 07:39:15,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:39:15,506 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:39:15,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2023-12-25 07:39:15,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40da757a8/f5141ec9ce76476a9ef2589e7116ad76/FLAG5e1080f9e [2023-12-25 07:39:15,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40da757a8/f5141ec9ce76476a9ef2589e7116ad76 [2023-12-25 07:39:15,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:39:15,529 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:39:15,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:39:15,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:39:15,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:39:15,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7194ff03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15, skipping insertion in model container [2023-12-25 07:39:15,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,556 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:39:15,674 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2023-12-25 07:39:15,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:39:15,688 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:39:15,717 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2023-12-25 07:39:15,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:39:15,728 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:39:15,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15 WrapperNode [2023-12-25 07:39:15,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:39:15,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:39:15,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:39:15,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:39:15,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,756 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 208 [2023-12-25 07:39:15,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:39:15,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:39:15,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:39:15,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:39:15,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,776 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-25 07:39:15,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:39:15,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:39:15,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:39:15,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:39:15,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (1/1) ... [2023-12-25 07:39:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:39:15,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:39:15,820 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-25 07:39:15,822 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-25 07:39:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:39:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:39:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:39:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:39:15,893 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:39:15,896 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:39:16,125 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:39:16,148 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:39:16,149 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 07:39:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:39:16 BoogieIcfgContainer [2023-12-25 07:39:16,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:39:16,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:39:16,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:39:16,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:39:16,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:39:15" (1/3) ... [2023-12-25 07:39:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55989348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:39:16, skipping insertion in model container [2023-12-25 07:39:16,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:39:15" (2/3) ... [2023-12-25 07:39:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55989348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:39:16, skipping insertion in model container [2023-12-25 07:39:16,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:39:16" (3/3) ... [2023-12-25 07:39:16,155 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2023-12-25 07:39:16,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:39:16,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:39:16,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:39:16,201 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;@47f1208d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:39:16,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:39:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 states have internal predecessors, (90), 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-25 07:39:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:39:16,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:16,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:16,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1356555257, now seen corresponding path program 1 times [2023-12-25 07:39:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104866902] [2023-12-25 07:39:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:16,222 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-25 07:39:16,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:16,224 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-25 07:39:16,276 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-25 07:39:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:16,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 07:39:16,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:16,343 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-25 07:39:16,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:16,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:16,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104866902] [2023-12-25 07:39:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104866902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:16,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:39:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437844906] [2023-12-25 07:39:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:16,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 07:39:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 07:39:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:39:16,371 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 52 states have internal predecessors, (90), 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-25 07:39:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:16,398 INFO L93 Difference]: Finished difference Result 85 states and 143 transitions. [2023-12-25 07:39:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 07:39:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) Word has length 16 [2023-12-25 07:39:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:16,407 INFO L225 Difference]: With dead ends: 85 [2023-12-25 07:39:16,407 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 07:39:16,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 07:39:16,414 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:16,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 07:39:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-25 07:39:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 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-25 07:39:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2023-12-25 07:39:16,444 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 16 [2023-12-25 07:39:16,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:16,444 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2023-12-25 07:39:16,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-25 07:39:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2023-12-25 07:39:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-25 07:39:16,446 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:16,451 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 (2)] Ended with exit code 0 [2023-12-25 07:39:16,651 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-25 07:39:16,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:16,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 769749243, now seen corresponding path program 1 times [2023-12-25 07:39:16,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:16,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292994153] [2023-12-25 07:39:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:16,655 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-25 07:39:16,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:16,657 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-25 07:39:16,665 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-25 07:39:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:16,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:39:16,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:16,762 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-25 07:39:16,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:16,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:16,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292994153] [2023-12-25 07:39:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292994153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:16,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:39:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384115529] [2023-12-25 07:39:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:16,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:39:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:39:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:16,771 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 07:39:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:16,823 INFO L93 Difference]: Finished difference Result 85 states and 137 transitions. [2023-12-25 07:39:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:39:16,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2023-12-25 07:39:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:16,825 INFO L225 Difference]: With dead ends: 85 [2023-12-25 07:39:16,826 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 07:39:16,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-25 07:39:16,828 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:16,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 07:39:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-25 07:39:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-25 07:39:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-25 07:39:16,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 16 [2023-12-25 07:39:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:16,839 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-25 07:39:16,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 07:39:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-25 07:39:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 07:39:16,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:16,840 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] [2023-12-25 07:39:16,846 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-25 07:39:17,041 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-25 07:39:17,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 84756620, now seen corresponding path program 1 times [2023-12-25 07:39:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423922086] [2023-12-25 07:39:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,043 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-25 07:39:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,044 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-25 07:39:17,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 (4)] Waiting until timeout for monitored process [2023-12-25 07:39:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:17,270 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-25 07:39:17,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:17,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423922086] [2023-12-25 07:39:17,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423922086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:17,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367090781] [2023-12-25 07:39:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:17,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:17,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:17,281 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-25 07:39:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:17,361 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2023-12-25 07:39:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) Word has length 31 [2023-12-25 07:39:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:17,365 INFO L225 Difference]: With dead ends: 175 [2023-12-25 07:39:17,365 INFO L226 Difference]: Without dead ends: 144 [2023-12-25 07:39:17,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:17,368 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 207 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 188 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.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:17,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 188 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:39:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-25 07:39:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 109. [2023-12-25 07:39:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.5) internal successors, (162), 108 states have internal predecessors, (162), 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-25 07:39:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 162 transitions. [2023-12-25 07:39:17,387 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 162 transitions. Word has length 31 [2023-12-25 07:39:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:17,387 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 162 transitions. [2023-12-25 07:39:17,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-25 07:39:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 162 transitions. [2023-12-25 07:39:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 07:39:17,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:17,389 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] [2023-12-25 07:39:17,395 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 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:17,596 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-25 07:39:17,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -912973924, now seen corresponding path program 1 times [2023-12-25 07:39:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322191026] [2023-12-25 07:39:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,598 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-25 07:39:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,599 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-25 07:39:17,601 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-25 07:39:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:17,689 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-25 07:39:17,689 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:17,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322191026] [2023-12-25 07:39:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322191026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:17,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460697785] [2023-12-25 07:39:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:17,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:17,692 INFO L87 Difference]: Start difference. First operand 109 states and 162 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-25 07:39:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:17,713 INFO L93 Difference]: Finished difference Result 271 states and 418 transitions. [2023-12-25 07:39:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2023-12-25 07:39:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:17,715 INFO L225 Difference]: With dead ends: 271 [2023-12-25 07:39:17,715 INFO L226 Difference]: Without dead ends: 182 [2023-12-25 07:39:17,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-25 07:39:17,720 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:17,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 103 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-25 07:39:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2023-12-25 07:39:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.5) internal successors, (264), 176 states have internal predecessors, (264), 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-25 07:39:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2023-12-25 07:39:17,737 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 33 [2023-12-25 07:39:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:17,737 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2023-12-25 07:39:17,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-25 07:39:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2023-12-25 07:39:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 07:39:17,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:17,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:17,752 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-25 07:39:17,944 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-25 07:39:17,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:17,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1815029063, now seen corresponding path program 1 times [2023-12-25 07:39:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108076689] [2023-12-25 07:39:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:17,946 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-25 07:39:17,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:17,947 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-25 07:39:17,972 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-25 07:39:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:17,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:39:17,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,012 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-25 07:39:18,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108076689] [2023-12-25 07:39:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108076689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:39:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621936978] [2023-12-25 07:39:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 07:39:18,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 07:39:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 07:39:18,014 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-25 07:39:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,036 INFO L93 Difference]: Finished difference Result 191 states and 281 transitions. [2023-12-25 07:39:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 07:39:18,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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) Word has length 34 [2023-12-25 07:39:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,038 INFO L225 Difference]: With dead ends: 191 [2023-12-25 07:39:18,038 INFO L226 Difference]: Without dead ends: 189 [2023-12-25 07:39:18,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-25 07:39:18,038 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 187 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-25 07:39:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2023-12-25 07:39:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4728260869565217) internal successors, (271), 184 states have internal predecessors, (271), 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-25 07:39:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2023-12-25 07:39:18,047 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 34 [2023-12-25 07:39:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,048 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2023-12-25 07:39:18,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-25 07:39:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2023-12-25 07:39:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:39:18,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:18,056 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-25 07:39:18,250 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-25 07:39:18,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1381419564, now seen corresponding path program 1 times [2023-12-25 07:39:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384125634] [2023-12-25 07:39:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,252 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-25 07:39:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,253 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-25 07:39:18,255 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-25 07:39:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,359 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-25 07:39:18,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384125634] [2023-12-25 07:39:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384125634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172973555] [2023-12-25 07:39:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,360 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 07:39:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,374 INFO L93 Difference]: Finished difference Result 491 states and 731 transitions. [2023-12-25 07:39:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:18,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2023-12-25 07:39:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,375 INFO L225 Difference]: With dead ends: 491 [2023-12-25 07:39:18,375 INFO L226 Difference]: Without dead ends: 326 [2023-12-25 07:39:18,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 07:39:18,378 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-12-25 07:39:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2023-12-25 07:39:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4643962848297214) internal successors, (473), 323 states have internal predecessors, (473), 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-25 07:39:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 473 transitions. [2023-12-25 07:39:18,386 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 473 transitions. Word has length 35 [2023-12-25 07:39:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,387 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 473 transitions. [2023-12-25 07:39:18,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 07:39:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 473 transitions. [2023-12-25 07:39:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 07:39:18,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,391 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] [2023-12-25 07:39:18,410 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-25 07:39:18,611 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-25 07:39:18,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash -492686124, now seen corresponding path program 1 times [2023-12-25 07:39:18,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160853736] [2023-12-25 07:39:18,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,615 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-25 07:39:18,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,616 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-25 07:39:18,641 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-25 07:39:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,675 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-25 07:39:18,675 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160853736] [2023-12-25 07:39:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160853736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749495572] [2023-12-25 07:39:18,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,677 INFO L87 Difference]: Start difference. First operand 324 states and 473 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 07:39:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:18,694 INFO L93 Difference]: Finished difference Result 884 states and 1295 transitions. [2023-12-25 07:39:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:18,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) Word has length 35 [2023-12-25 07:39:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:18,696 INFO L225 Difference]: With dead ends: 884 [2023-12-25 07:39:18,696 INFO L226 Difference]: Without dead ends: 580 [2023-12-25 07:39:18,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 07:39:18,698 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:18,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-12-25 07:39:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2023-12-25 07:39:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.4367417677642982) internal successors, (829), 577 states have internal predecessors, (829), 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-25 07:39:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 829 transitions. [2023-12-25 07:39:18,713 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 829 transitions. Word has length 35 [2023-12-25 07:39:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:18,713 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 829 transitions. [2023-12-25 07:39:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 07:39:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 829 transitions. [2023-12-25 07:39:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 07:39:18,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:18,715 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] [2023-12-25 07:39:18,734 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-25 07:39:18,920 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-25 07:39:18,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:18,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1137438489, now seen corresponding path program 1 times [2023-12-25 07:39:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302879966] [2023-12-25 07:39:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:18,921 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-25 07:39:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:18,922 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-25 07:39:18,947 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-25 07:39:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:18,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:18,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:18,982 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-25 07:39:18,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:18,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302879966] [2023-12-25 07:39:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302879966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:18,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:18,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:18,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330833010] [2023-12-25 07:39:18,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:18,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:18,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:18,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:18,984 INFO L87 Difference]: Start difference. First operand 578 states and 829 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-25 07:39:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:19,001 INFO L93 Difference]: Finished difference Result 1161 states and 1699 transitions. [2023-12-25 07:39:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2023-12-25 07:39:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:19,004 INFO L225 Difference]: With dead ends: 1161 [2023-12-25 07:39:19,004 INFO L226 Difference]: Without dead ends: 834 [2023-12-25 07:39:19,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-25 07:39:19,005 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:19,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2023-12-25 07:39:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 832. [2023-12-25 07:39:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.4332129963898916) internal successors, (1191), 831 states have internal predecessors, (1191), 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-25 07:39:19,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1191 transitions. [2023-12-25 07:39:19,020 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1191 transitions. Word has length 37 [2023-12-25 07:39:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:19,021 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1191 transitions. [2023-12-25 07:39:19,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-25 07:39:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1191 transitions. [2023-12-25 07:39:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 07:39:19,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:19,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:19,026 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-25 07:39:19,226 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-25 07:39:19,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:19,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash 124429978, now seen corresponding path program 1 times [2023-12-25 07:39:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758546806] [2023-12-25 07:39:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:19,227 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-25 07:39:19,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:19,228 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-25 07:39:19,229 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-25 07:39:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:19,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:19,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:19,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:19,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:19,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758546806] [2023-12-25 07:39:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758546806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027501282] [2023-12-25 07:39:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:19,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:19,300 INFO L87 Difference]: Start difference. First operand 832 states and 1191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-25 07:39:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:19,318 INFO L93 Difference]: Finished difference Result 1427 states and 2061 transitions. [2023-12-25 07:39:19,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:19,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2023-12-25 07:39:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:19,320 INFO L225 Difference]: With dead ends: 1427 [2023-12-25 07:39:19,320 INFO L226 Difference]: Without dead ends: 617 [2023-12-25 07:39:19,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-25 07:39:19,321 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 34 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:19,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 143 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-12-25 07:39:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2023-12-25 07:39:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4299674267100977) internal successors, (878), 614 states have internal predecessors, (878), 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-25 07:39:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 878 transitions. [2023-12-25 07:39:19,333 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 878 transitions. Word has length 49 [2023-12-25 07:39:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:19,333 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 878 transitions. [2023-12-25 07:39:19,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-25 07:39:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 878 transitions. [2023-12-25 07:39:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 07:39:19,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:19,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:19,338 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-25 07:39:19,536 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-25 07:39:19,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:19,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 854869599, now seen corresponding path program 1 times [2023-12-25 07:39:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:19,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660700537] [2023-12-25 07:39:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:19,538 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-25 07:39:19,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:19,539 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-25 07:39:19,567 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-25 07:39:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:19,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:19,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:20,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:20,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660700537] [2023-12-25 07:39:20,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660700537] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:20,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491827938] [2023-12-25 07:39:20,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:20,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:20,262 INFO L87 Difference]: Start difference. First operand 615 states and 878 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-25 07:39:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:21,158 INFO L93 Difference]: Finished difference Result 2143 states and 3049 transitions. [2023-12-25 07:39:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 07:39:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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) Word has length 51 [2023-12-25 07:39:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:21,163 INFO L225 Difference]: With dead ends: 2143 [2023-12-25 07:39:21,163 INFO L226 Difference]: Without dead ends: 1565 [2023-12-25 07:39:21,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-25 07:39:21,164 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 540 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:21,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 490 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:39:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-12-25 07:39:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1191. [2023-12-25 07:39:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 1.4336134453781513) internal successors, (1706), 1190 states have internal predecessors, (1706), 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-25 07:39:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1706 transitions. [2023-12-25 07:39:21,205 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1706 transitions. Word has length 51 [2023-12-25 07:39:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:21,205 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1706 transitions. [2023-12-25 07:39:21,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 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-25 07:39:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1706 transitions. [2023-12-25 07:39:21,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 07:39:21,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:21,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:21,211 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-25 07:39:21,409 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-25 07:39:21,409 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:21,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:21,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1839667455, now seen corresponding path program 1 times [2023-12-25 07:39:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595444117] [2023-12-25 07:39:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:21,410 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-25 07:39:21,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:21,411 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-25 07:39:21,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 (12)] Waiting until timeout for monitored process [2023-12-25 07:39:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:21,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:21,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:21,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:21,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595444117] [2023-12-25 07:39:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595444117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:21,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:21,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084110051] [2023-12-25 07:39:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:21,483 INFO L87 Difference]: Start difference. First operand 1191 states and 1706 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-25 07:39:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:21,509 INFO L93 Difference]: Finished difference Result 1771 states and 2542 transitions. [2023-12-25 07:39:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:21,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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) Word has length 53 [2023-12-25 07:39:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:21,511 INFO L225 Difference]: With dead ends: 1771 [2023-12-25 07:39:21,512 INFO L226 Difference]: Without dead ends: 617 [2023-12-25 07:39:21,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-25 07:39:21,513 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 28 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:21,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-12-25 07:39:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2023-12-25 07:39:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4006514657980456) internal successors, (860), 614 states have internal predecessors, (860), 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-25 07:39:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 860 transitions. [2023-12-25 07:39:21,534 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 860 transitions. Word has length 53 [2023-12-25 07:39:21,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:21,535 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 860 transitions. [2023-12-25 07:39:21,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-25 07:39:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 860 transitions. [2023-12-25 07:39:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-25 07:39:21,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:21,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:21,540 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-25 07:39:21,737 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-25 07:39:21,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:21,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 979138397, now seen corresponding path program 1 times [2023-12-25 07:39:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337724636] [2023-12-25 07:39:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:21,739 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-25 07:39:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:21,740 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-25 07:39:21,766 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-25 07:39:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:21,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:21,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:22,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:22,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337724636] [2023-12-25 07:39:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337724636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:22,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:22,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324907656] [2023-12-25 07:39:22,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:22,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:22,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:22,359 INFO L87 Difference]: Start difference. First operand 615 states and 860 transitions. Second operand has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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-25 07:39:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:23,011 INFO L93 Difference]: Finished difference Result 2195 states and 3072 transitions. [2023-12-25 07:39:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 07:39:23,011 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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) Word has length 54 [2023-12-25 07:39:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:23,015 INFO L225 Difference]: With dead ends: 2195 [2023-12-25 07:39:23,015 INFO L226 Difference]: Without dead ends: 1617 [2023-12-25 07:39:23,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2023-12-25 07:39:23,017 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 458 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:23,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 544 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:39:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2023-12-25 07:39:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1263. [2023-12-25 07:39:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 1.3803486529318543) internal successors, (1742), 1262 states have internal predecessors, (1742), 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-25 07:39:23,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1742 transitions. [2023-12-25 07:39:23,050 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1742 transitions. Word has length 54 [2023-12-25 07:39:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:23,051 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1742 transitions. [2023-12-25 07:39:23,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 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-25 07:39:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1742 transitions. [2023-12-25 07:39:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 07:39:23,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:23,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:23,068 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-25 07:39:23,254 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-25 07:39:23,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:23,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -564553527, now seen corresponding path program 1 times [2023-12-25 07:39:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843626254] [2023-12-25 07:39:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:23,255 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-25 07:39:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:23,256 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-25 07:39:23,257 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-25 07:39:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:23,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:39:23,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:23,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:23,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843626254] [2023-12-25 07:39:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843626254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 07:39:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967352161] [2023-12-25 07:39:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:39:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:39:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:39:23,350 INFO L87 Difference]: Start difference. First operand 1263 states and 1742 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-25 07:39:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:23,371 INFO L93 Difference]: Finished difference Result 1825 states and 2516 transitions. [2023-12-25 07:39:23,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:39:23,371 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), 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) Word has length 56 [2023-12-25 07:39:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:23,373 INFO L225 Difference]: With dead ends: 1825 [2023-12-25 07:39:23,374 INFO L226 Difference]: Without dead ends: 599 [2023-12-25 07:39:23,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-25 07:39:23,376 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:23,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2023-12-25 07:39:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2023-12-25 07:39:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.3406040268456376) internal successors, (799), 596 states have internal predecessors, (799), 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-25 07:39:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 799 transitions. [2023-12-25 07:39:23,395 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 799 transitions. Word has length 56 [2023-12-25 07:39:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:23,395 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 799 transitions. [2023-12-25 07:39:23,396 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), 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-25 07:39:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 799 transitions. [2023-12-25 07:39:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 07:39:23,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:23,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:23,401 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-25 07:39:23,598 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-25 07:39:23,599 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:23,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 351465427, now seen corresponding path program 1 times [2023-12-25 07:39:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973548985] [2023-12-25 07:39:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:23,599 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-25 07:39:23,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:23,600 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-25 07:39:23,604 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-25 07:39:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:23,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 07:39:23,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:24,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:24,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:24,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973548985] [2023-12-25 07:39:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973548985] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:24,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-25 07:39:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574797491] [2023-12-25 07:39:24,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:24,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 07:39:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:24,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 07:39:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-25 07:39:24,228 INFO L87 Difference]: Start difference. First operand 597 states and 799 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-25 07:39:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:24,826 INFO L93 Difference]: Finished difference Result 1671 states and 2232 transitions. [2023-12-25 07:39:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 07:39:24,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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) Word has length 57 [2023-12-25 07:39:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:24,830 INFO L225 Difference]: With dead ends: 1671 [2023-12-25 07:39:24,830 INFO L226 Difference]: Without dead ends: 1111 [2023-12-25 07:39:24,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-25 07:39:24,831 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 485 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:24,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 515 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:39:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2023-12-25 07:39:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 993. [2023-12-25 07:39:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.3195564516129032) internal successors, (1309), 992 states have internal predecessors, (1309), 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-25 07:39:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1309 transitions. [2023-12-25 07:39:24,865 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1309 transitions. Word has length 57 [2023-12-25 07:39:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:24,865 INFO L495 AbstractCegarLoop]: Abstraction has 993 states and 1309 transitions. [2023-12-25 07:39:24,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 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-25 07:39:24,865 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1309 transitions. [2023-12-25 07:39:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-25 07:39:24,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:24,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:24,871 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-25 07:39:25,068 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-25 07:39:25,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:25,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1204782347, now seen corresponding path program 1 times [2023-12-25 07:39:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232159302] [2023-12-25 07:39:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:25,069 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-25 07:39:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:25,070 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-25 07:39:25,071 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-25 07:39:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:25,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 07:39:25,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:39:25,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 07:39:25,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232159302] [2023-12-25 07:39:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232159302] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:25,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 07:39:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51864466] [2023-12-25 07:39:25,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:25,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:39:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:39:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:39:25,260 INFO L87 Difference]: Start difference. First operand 993 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-25 07:39:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:25,344 INFO L93 Difference]: Finished difference Result 2897 states and 3775 transitions. [2023-12-25 07:39:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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) Word has length 59 [2023-12-25 07:39:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:25,349 INFO L225 Difference]: With dead ends: 2897 [2023-12-25 07:39:25,349 INFO L226 Difference]: Without dead ends: 1941 [2023-12-25 07:39:25,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:39:25,352 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 46 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:25,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 241 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2023-12-25 07:39:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1921. [2023-12-25 07:39:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 1.2302083333333333) internal successors, (2362), 1920 states have internal predecessors, (2362), 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-25 07:39:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2362 transitions. [2023-12-25 07:39:25,406 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2362 transitions. Word has length 59 [2023-12-25 07:39:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:25,406 INFO L495 AbstractCegarLoop]: Abstraction has 1921 states and 2362 transitions. [2023-12-25 07:39:25,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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-25 07:39:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2362 transitions. [2023-12-25 07:39:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-25 07:39:25,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:25,410 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2023-12-25 07:39:25,414 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-25 07:39:25,612 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-25 07:39:25,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:25,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash -956462522, now seen corresponding path program 1 times [2023-12-25 07:39:25,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:25,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083390] [2023-12-25 07:39:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:25,613 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-25 07:39:25,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:25,614 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-25 07:39:25,618 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-25 07:39:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:25,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:25,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:26,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:26,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:26,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083390] [2023-12-25 07:39:26,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083390] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:26,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:26,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:26,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445823454] [2023-12-25 07:39:26,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:26,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:26,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:26,982 INFO L87 Difference]: Start difference. First operand 1921 states and 2362 transitions. Second operand has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 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-25 07:39:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:31,383 INFO L93 Difference]: Finished difference Result 3730 states and 4594 transitions. [2023-12-25 07:39:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-25 07:39:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 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) Word has length 94 [2023-12-25 07:39:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:31,390 INFO L225 Difference]: With dead ends: 3730 [2023-12-25 07:39:31,390 INFO L226 Difference]: Without dead ends: 2830 [2023-12-25 07:39:31,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1033, Invalid=5129, Unknown=0, NotChecked=0, Total=6162 [2023-12-25 07:39:31,394 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 642 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:31,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1963 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:39:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2023-12-25 07:39:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 1333. [2023-12-25 07:39:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.2334834834834836) internal successors, (1643), 1332 states have internal predecessors, (1643), 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-25 07:39:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1643 transitions. [2023-12-25 07:39:31,455 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1643 transitions. Word has length 94 [2023-12-25 07:39:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:31,456 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1643 transitions. [2023-12-25 07:39:31,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.6923076923076925) internal successors, (174), 26 states have internal predecessors, (174), 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-25 07:39:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1643 transitions. [2023-12-25 07:39:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-25 07:39:31,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:31,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:31,460 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-25 07:39:31,660 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-25 07:39:31,660 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:31,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -947820372, now seen corresponding path program 1 times [2023-12-25 07:39:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360474170] [2023-12-25 07:39:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:31,661 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-25 07:39:31,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:31,662 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-25 07:39:31,666 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-25 07:39:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:31,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 07:39:31,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:32,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:32,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:32,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360474170] [2023-12-25 07:39:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360474170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:32,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:32,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-25 07:39:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796169225] [2023-12-25 07:39:32,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:32,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:32,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:32,786 INFO L87 Difference]: Start difference. First operand 1333 states and 1643 transitions. Second operand has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 25 states have internal predecessors, (178), 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-25 07:39:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:33,900 INFO L93 Difference]: Finished difference Result 2233 states and 2790 transitions. [2023-12-25 07:39:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 07:39:33,900 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 25 states have internal predecessors, (178), 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) Word has length 95 [2023-12-25 07:39:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:33,903 INFO L225 Difference]: With dead ends: 2233 [2023-12-25 07:39:33,903 INFO L226 Difference]: Without dead ends: 1419 [2023-12-25 07:39:33,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=392, Invalid=1500, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 07:39:33,905 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 645 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:33,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 508 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 07:39:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2023-12-25 07:39:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1333. [2023-12-25 07:39:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.2214714714714714) internal successors, (1627), 1332 states have internal predecessors, (1627), 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-25 07:39:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1627 transitions. [2023-12-25 07:39:33,955 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1627 transitions. Word has length 95 [2023-12-25 07:39:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:33,955 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1627 transitions. [2023-12-25 07:39:33,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 25 states have internal predecessors, (178), 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-25 07:39:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1627 transitions. [2023-12-25 07:39:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-25 07:39:33,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:33,956 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:33,961 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-25 07:39:34,158 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-25 07:39:34,160 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:34,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash 281074604, now seen corresponding path program 1 times [2023-12-25 07:39:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:34,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266263605] [2023-12-25 07:39:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:34,160 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-25 07:39:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:34,161 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-25 07:39:34,163 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-25 07:39:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:34,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:34,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:35,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:35,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266263605] [2023-12-25 07:39:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266263605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:35,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:35,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778149522] [2023-12-25 07:39:35,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:35,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:35,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:35,413 INFO L87 Difference]: Start difference. First operand 1333 states and 1627 transitions. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-25 07:39:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:39,154 INFO L93 Difference]: Finished difference Result 3237 states and 3932 transitions. [2023-12-25 07:39:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-25 07:39:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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) Word has length 95 [2023-12-25 07:39:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:39,161 INFO L225 Difference]: With dead ends: 3237 [2023-12-25 07:39:39,161 INFO L226 Difference]: Without dead ends: 2989 [2023-12-25 07:39:39,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=881, Invalid=4089, Unknown=0, NotChecked=0, Total=4970 [2023-12-25 07:39:39,162 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 816 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:39,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1553 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 07:39:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2023-12-25 07:39:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1525. [2023-12-25 07:39:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.218503937007874) internal successors, (1857), 1524 states have internal predecessors, (1857), 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-25 07:39:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1857 transitions. [2023-12-25 07:39:39,239 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1857 transitions. Word has length 95 [2023-12-25 07:39:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:39,239 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1857 transitions. [2023-12-25 07:39:39,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-25 07:39:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1857 transitions. [2023-12-25 07:39:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-25 07:39:39,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:39,240 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2023-12-25 07:39:39,242 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-25 07:39:39,442 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-25 07:39:39,442 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:39,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 652100758, now seen corresponding path program 1 times [2023-12-25 07:39:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375772517] [2023-12-25 07:39:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:39,443 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-25 07:39:39,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:39,443 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-25 07:39:39,444 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-25 07:39:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:39,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:39:39,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:40,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:40,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375772517] [2023-12-25 07:39:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375772517] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:40,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-25 07:39:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774268674] [2023-12-25 07:39:40,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 07:39:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 07:39:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-25 07:39:40,748 INFO L87 Difference]: Start difference. First operand 1525 states and 1857 transitions. Second operand has 26 states, 26 states have (on average 7.153846153846154) internal successors, (186), 26 states have internal predecessors, (186), 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-25 07:39:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:44,095 INFO L93 Difference]: Finished difference Result 4225 states and 5121 transitions. [2023-12-25 07:39:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 07:39:44,096 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.153846153846154) internal successors, (186), 26 states have internal predecessors, (186), 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) Word has length 96 [2023-12-25 07:39:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:44,102 INFO L225 Difference]: With dead ends: 4225 [2023-12-25 07:39:44,102 INFO L226 Difference]: Without dead ends: 3283 [2023-12-25 07:39:44,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=760, Invalid=3796, Unknown=0, NotChecked=0, Total=4556 [2023-12-25 07:39:44,104 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 563 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:44,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1557 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:39:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2023-12-25 07:39:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2834. [2023-12-25 07:39:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2834 states, 2833 states have (on average 1.196611366043064) internal successors, (3390), 2833 states have internal predecessors, (3390), 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-25 07:39:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 3390 transitions. [2023-12-25 07:39:44,248 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 3390 transitions. Word has length 96 [2023-12-25 07:39:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:44,249 INFO L495 AbstractCegarLoop]: Abstraction has 2834 states and 3390 transitions. [2023-12-25 07:39:44,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.153846153846154) internal successors, (186), 26 states have internal predecessors, (186), 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-25 07:39:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 3390 transitions. [2023-12-25 07:39:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 07:39:44,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:44,251 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:44,254 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 (20)] Ended with exit code 0 [2023-12-25 07:39:44,453 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-25 07:39:44,454 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:44,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash -951482833, now seen corresponding path program 2 times [2023-12-25 07:39:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504860349] [2023-12-25 07:39:44,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:44,455 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-25 07:39:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:44,455 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-25 07:39:44,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 (21)] Waiting until timeout for monitored process [2023-12-25 07:39:44,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:44,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:44,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:44,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2023-12-25 07:39:44,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:44,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504860349] [2023-12-25 07:39:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504860349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:44,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63316629] [2023-12-25 07:39:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:44,838 INFO L87 Difference]: Start difference. First operand 2834 states and 3390 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-25 07:39:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:45,032 INFO L93 Difference]: Finished difference Result 3815 states and 4622 transitions. [2023-12-25 07:39:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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) Word has length 134 [2023-12-25 07:39:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:45,039 INFO L225 Difference]: With dead ends: 3815 [2023-12-25 07:39:45,040 INFO L226 Difference]: Without dead ends: 3436 [2023-12-25 07:39:45,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:45,041 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 109 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:45,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 233 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:39:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2023-12-25 07:39:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3358. [2023-12-25 07:39:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3357 states have (on average 1.192135835567471) internal successors, (4002), 3357 states have internal predecessors, (4002), 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-25 07:39:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4002 transitions. [2023-12-25 07:39:45,227 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4002 transitions. Word has length 134 [2023-12-25 07:39:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:45,227 INFO L495 AbstractCegarLoop]: Abstraction has 3358 states and 4002 transitions. [2023-12-25 07:39:45,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-25 07:39:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4002 transitions. [2023-12-25 07:39:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-25 07:39:45,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:45,230 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:45,232 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-25 07:39:45,431 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-25 07:39:45,432 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:45,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash -62589741, now seen corresponding path program 1 times [2023-12-25 07:39:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88364131] [2023-12-25 07:39:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:45,432 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-25 07:39:45,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:45,433 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-25 07:39:45,434 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-25 07:39:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:45,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:39:45,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 22 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:46,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 22 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:47,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:47,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88364131] [2023-12-25 07:39:47,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88364131] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:47,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:47,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-25 07:39:47,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894422119] [2023-12-25 07:39:47,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:47,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 07:39:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 07:39:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 07:39:47,132 INFO L87 Difference]: Start difference. First operand 3358 states and 4002 transitions. Second operand has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 35 states have internal predecessors, (262), 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-25 07:39:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:51,648 INFO L93 Difference]: Finished difference Result 4944 states and 5926 transitions. [2023-12-25 07:39:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-25 07:39:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 35 states have internal predecessors, (262), 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) Word has length 134 [2023-12-25 07:39:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:51,655 INFO L225 Difference]: With dead ends: 4944 [2023-12-25 07:39:51,655 INFO L226 Difference]: Without dead ends: 3562 [2023-12-25 07:39:51,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1744, Invalid=8968, Unknown=0, NotChecked=0, Total=10712 [2023-12-25 07:39:51,659 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1316 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:51,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1015 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 07:39:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2023-12-25 07:39:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3358. [2023-12-25 07:39:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3357 states have (on average 1.1861781352397975) internal successors, (3982), 3357 states have internal predecessors, (3982), 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-25 07:39:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 3982 transitions. [2023-12-25 07:39:51,882 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 3982 transitions. Word has length 134 [2023-12-25 07:39:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:51,882 INFO L495 AbstractCegarLoop]: Abstraction has 3358 states and 3982 transitions. [2023-12-25 07:39:51,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.277777777777778) internal successors, (262), 35 states have internal predecessors, (262), 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-25 07:39:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 3982 transitions. [2023-12-25 07:39:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:39:51,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:51,885 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:51,889 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 07:39:52,087 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-25 07:39:52,087 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:52,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1097525875, now seen corresponding path program 2 times [2023-12-25 07:39:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183216616] [2023-12-25 07:39:52,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:39:52,088 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-25 07:39:52,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:52,089 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-25 07:39:52,089 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-25 07:39:52,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 07:39:52,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:39:52,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:52,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2023-12-25 07:39:52,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:52,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:52,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183216616] [2023-12-25 07:39:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183216616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872879538] [2023-12-25 07:39:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:52,435 INFO L87 Difference]: Start difference. First operand 3358 states and 3982 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-25 07:39:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:52,632 INFO L93 Difference]: Finished difference Result 4002 states and 4805 transitions. [2023-12-25 07:39:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 135 [2023-12-25 07:39:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:52,640 INFO L225 Difference]: With dead ends: 4002 [2023-12-25 07:39:52,640 INFO L226 Difference]: Without dead ends: 3084 [2023-12-25 07:39:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:52,642 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 103 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:52,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 235 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:39:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2023-12-25 07:39:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3006. [2023-12-25 07:39:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 3005 states have (on average 1.1727121464226289) internal successors, (3524), 3005 states have internal predecessors, (3524), 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-25 07:39:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 3524 transitions. [2023-12-25 07:39:52,825 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 3524 transitions. Word has length 135 [2023-12-25 07:39:52,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:52,825 INFO L495 AbstractCegarLoop]: Abstraction has 3006 states and 3524 transitions. [2023-12-25 07:39:52,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-25 07:39:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 3524 transitions. [2023-12-25 07:39:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 07:39:52,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:52,827 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:52,829 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-25 07:39:53,029 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-25 07:39:53,029 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:53,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1056853773, now seen corresponding path program 1 times [2023-12-25 07:39:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811814951] [2023-12-25 07:39:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:53,030 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-25 07:39:53,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:53,031 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-25 07:39:53,036 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-25 07:39:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:53,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 07:39:53,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2023-12-25 07:39:53,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:39:53,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811814951] [2023-12-25 07:39:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811814951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:39:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:39:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 07:39:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446341184] [2023-12-25 07:39:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:39:53,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:39:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:39:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:53,417 INFO L87 Difference]: Start difference. First operand 3006 states and 3524 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-25 07:39:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:39:53,650 INFO L93 Difference]: Finished difference Result 3673 states and 4374 transitions. [2023-12-25 07:39:53,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 07:39:53,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) Word has length 135 [2023-12-25 07:39:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:39:53,655 INFO L225 Difference]: With dead ends: 3673 [2023-12-25 07:39:53,655 INFO L226 Difference]: Without dead ends: 3282 [2023-12-25 07:39:53,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:39:53,656 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:39:53,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 289 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:39:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2023-12-25 07:39:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3204. [2023-12-25 07:39:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.1685919450515143) internal successors, (3743), 3203 states have internal predecessors, (3743), 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-25 07:39:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3743 transitions. [2023-12-25 07:39:53,879 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3743 transitions. Word has length 135 [2023-12-25 07:39:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:39:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 3204 states and 3743 transitions. [2023-12-25 07:39:53,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-25 07:39:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3743 transitions. [2023-12-25 07:39:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:39:53,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:39:53,882 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:39:53,887 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-25 07:39:54,085 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-25 07:39:54,085 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:39:54,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:39:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -827134843, now seen corresponding path program 1 times [2023-12-25 07:39:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:39:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451899796] [2023-12-25 07:39:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:39:54,086 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-25 07:39:54,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:39:54,087 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-25 07:39:54,088 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-25 07:39:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:39:54,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:39:54,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:39:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:55,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:39:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 54 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:39:55,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:39:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451899796] [2023-12-25 07:39:55,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451899796] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:39:55,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:39:55,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:39:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073546652] [2023-12-25 07:39:55,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:39:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:39:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:39:55,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:39:55,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:39:55,760 INFO L87 Difference]: Start difference. First operand 3204 states and 3743 transitions. Second operand has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 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-25 07:40:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:40:05,706 INFO L93 Difference]: Finished difference Result 4915 states and 5764 transitions. [2023-12-25 07:40:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-12-25 07:40:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 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) Word has length 136 [2023-12-25 07:40:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:40:05,710 INFO L225 Difference]: With dead ends: 4915 [2023-12-25 07:40:05,711 INFO L226 Difference]: Without dead ends: 3701 [2023-12-25 07:40:05,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7336 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3215, Invalid=20655, Unknown=0, NotChecked=0, Total=23870 [2023-12-25 07:40:05,716 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 1175 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:40:05,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 2817 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-25 07:40:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2023-12-25 07:40:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3444. [2023-12-25 07:40:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3444 states, 3443 states have (on average 1.168167295962823) internal successors, (4022), 3443 states have internal predecessors, (4022), 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-25 07:40:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 4022 transitions. [2023-12-25 07:40:05,931 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 4022 transitions. Word has length 136 [2023-12-25 07:40:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:40:05,931 INFO L495 AbstractCegarLoop]: Abstraction has 3444 states and 4022 transitions. [2023-12-25 07:40:05,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.470588235294118) internal successors, (254), 34 states have internal predecessors, (254), 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-25 07:40:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 4022 transitions. [2023-12-25 07:40:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 07:40:05,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:40:05,933 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:40:05,939 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 07:40:06,136 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-25 07:40:06,136 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:40:06,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:40:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -944659763, now seen corresponding path program 1 times [2023-12-25 07:40:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:40:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55751025] [2023-12-25 07:40:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:40:06,137 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-25 07:40:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:40:06,138 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-25 07:40:06,139 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-25 07:40:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:40:06,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:40:06,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:40:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 134 proven. 52 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:40:07,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:40:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 134 proven. 52 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-25 07:40:08,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:40:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55751025] [2023-12-25 07:40:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55751025] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:40:08,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:40:08,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:40:08,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717998550] [2023-12-25 07:40:08,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:40:08,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:40:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:40:08,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:40:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:40:08,568 INFO L87 Difference]: Start difference. First operand 3444 states and 4022 transitions. Second operand has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 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-25 07:40:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:40:37,875 INFO L93 Difference]: Finished difference Result 9105 states and 10674 transitions. [2023-12-25 07:40:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2023-12-25 07:40:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 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) Word has length 136 [2023-12-25 07:40:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:40:37,884 INFO L225 Difference]: With dead ends: 9105 [2023-12-25 07:40:37,884 INFO L226 Difference]: Without dead ends: 7861 [2023-12-25 07:40:37,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18525 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=6345, Invalid=41397, Unknown=0, NotChecked=0, Total=47742 [2023-12-25 07:40:37,889 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 2122 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:40:37,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 2997 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-25 07:40:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2023-12-25 07:40:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 4029. [2023-12-25 07:40:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4029 states, 4028 states have (on average 1.1675769612711022) internal successors, (4703), 4028 states have internal predecessors, (4703), 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-25 07:40:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 4703 transitions. [2023-12-25 07:40:38,185 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 4703 transitions. Word has length 136 [2023-12-25 07:40:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:40:38,185 INFO L495 AbstractCegarLoop]: Abstraction has 4029 states and 4703 transitions. [2023-12-25 07:40:38,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.647058823529412) internal successors, (192), 34 states have internal predecessors, (192), 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-25 07:40:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 4703 transitions. [2023-12-25 07:40:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-25 07:40:38,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:40:38,188 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:40:38,190 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-25 07:40:38,388 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-25 07:40:38,388 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:40:38,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:40:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash -258233935, now seen corresponding path program 1 times [2023-12-25 07:40:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:40:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900905280] [2023-12-25 07:40:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:40:38,389 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-25 07:40:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:40:38,390 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-25 07:40:38,390 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-25 07:40:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:40:38,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:40:38,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:40:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 133 proven. 61 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:40:39,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:40:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 133 proven. 61 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:40:40,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:40:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900905280] [2023-12-25 07:40:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900905280] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:40:40,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:40:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:40:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406464838] [2023-12-25 07:40:40,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:40:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:40:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:40:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:40:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:40:40,788 INFO L87 Difference]: Start difference. First operand 4029 states and 4703 transitions. Second operand has 34 states, 34 states have (on average 6.0) internal successors, (204), 34 states have internal predecessors, (204), 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-25 07:41:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:41:20,913 INFO L93 Difference]: Finished difference Result 8346 states and 9808 transitions. [2023-12-25 07:41:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2023-12-25 07:41:20,913 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.0) internal successors, (204), 34 states have internal predecessors, (204), 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) Word has length 137 [2023-12-25 07:41:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:41:20,921 INFO L225 Difference]: With dead ends: 8346 [2023-12-25 07:41:20,921 INFO L226 Difference]: Without dead ends: 6938 [2023-12-25 07:41:20,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19336 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=7133, Invalid=41929, Unknown=0, NotChecked=0, Total=49062 [2023-12-25 07:41:20,925 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 2519 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:41:20,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 2926 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-25 07:41:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2023-12-25 07:41:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 5884. [2023-12-25 07:41:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5884 states, 5883 states have (on average 1.1706612272650008) internal successors, (6887), 5883 states have internal predecessors, (6887), 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-25 07:41:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5884 states to 5884 states and 6887 transitions. [2023-12-25 07:41:21,328 INFO L78 Accepts]: Start accepts. Automaton has 5884 states and 6887 transitions. Word has length 137 [2023-12-25 07:41:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:41:21,328 INFO L495 AbstractCegarLoop]: Abstraction has 5884 states and 6887 transitions. [2023-12-25 07:41:21,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.0) internal successors, (204), 34 states have internal predecessors, (204), 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-25 07:41:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 5884 states and 6887 transitions. [2023-12-25 07:41:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-25 07:41:21,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:41:21,331 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:41:21,334 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 (27)] Forceful destruction successful, exit code 0 [2023-12-25 07:41:21,534 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-25 07:41:21,534 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:41:21,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:41:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 941066869, now seen corresponding path program 1 times [2023-12-25 07:41:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:41:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743605857] [2023-12-25 07:41:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:41:21,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-25 07:41:21,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:41:21,536 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-25 07:41:21,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 (28)] Waiting until timeout for monitored process [2023-12-25 07:41:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:41:21,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 07:41:21,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:41:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 131 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:41:23,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:41:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 131 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-25 07:41:24,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:41:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743605857] [2023-12-25 07:41:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743605857] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:41:24,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:41:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:41:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848832738] [2023-12-25 07:41:24,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:41:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:41:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:41:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:41:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:41:24,039 INFO L87 Difference]: Start difference. First operand 5884 states and 6887 transitions. Second operand has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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-25 07:42:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:00,532 INFO L93 Difference]: Finished difference Result 11091 states and 12980 transitions. [2023-12-25 07:42:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2023-12-25 07:42:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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) Word has length 137 [2023-12-25 07:42:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:00,540 INFO L225 Difference]: With dead ends: 11091 [2023-12-25 07:42:00,541 INFO L226 Difference]: Without dead ends: 9414 [2023-12-25 07:42:00,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14328 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=5718, Invalid=30954, Unknown=0, NotChecked=0, Total=36672 [2023-12-25 07:42:00,544 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1797 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 3430 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:00,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 3430 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-25 07:42:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9414 states. [2023-12-25 07:42:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9414 to 7834. [2023-12-25 07:42:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7834 states, 7833 states have (on average 1.1694114643176305) internal successors, (9160), 7833 states have internal predecessors, (9160), 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-25 07:42:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 9160 transitions. [2023-12-25 07:42:01,111 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 9160 transitions. Word has length 137 [2023-12-25 07:42:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:01,111 INFO L495 AbstractCegarLoop]: Abstraction has 7834 states and 9160 transitions. [2023-12-25 07:42:01,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.264705882352941) internal successors, (213), 34 states have internal predecessors, (213), 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-25 07:42:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 9160 transitions. [2023-12-25 07:42:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-25 07:42:01,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:01,114 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:01,119 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-25 07:42:01,317 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-25 07:42:01,317 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:01,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 604722397, now seen corresponding path program 1 times [2023-12-25 07:42:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:01,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181275719] [2023-12-25 07:42:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:01,318 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-25 07:42:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:01,319 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-25 07:42:01,322 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-25 07:42:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:01,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:42:01,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 15 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:42:01,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 15 proven. 191 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 07:42:01,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181275719] [2023-12-25 07:42:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181275719] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:01,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 07:42:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932943807] [2023-12-25 07:42:01,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:01,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 07:42:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:01,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 07:42:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 07:42:01,687 INFO L87 Difference]: Start difference. First operand 7834 states and 9160 transitions. Second operand has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-25 07:42:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:03,131 INFO L93 Difference]: Finished difference Result 32491 states and 39422 transitions. [2023-12-25 07:42:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 07:42:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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) Word has length 139 [2023-12-25 07:42:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:03,156 INFO L225 Difference]: With dead ends: 32491 [2023-12-25 07:42:03,157 INFO L226 Difference]: Without dead ends: 25058 [2023-12-25 07:42:03,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-25 07:42:03,163 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 292 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:03,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 670 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 07:42:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25058 states. [2023-12-25 07:42:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25058 to 24962. [2023-12-25 07:42:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24962 states, 24961 states have (on average 1.1269981170626178) internal successors, (28131), 24961 states have internal predecessors, (28131), 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-25 07:42:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24962 states to 24962 states and 28131 transitions. [2023-12-25 07:42:04,675 INFO L78 Accepts]: Start accepts. Automaton has 24962 states and 28131 transitions. Word has length 139 [2023-12-25 07:42:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:04,675 INFO L495 AbstractCegarLoop]: Abstraction has 24962 states and 28131 transitions. [2023-12-25 07:42:04,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 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-25 07:42:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 24962 states and 28131 transitions. [2023-12-25 07:42:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 07:42:04,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:04,679 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:04,681 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-25 07:42:04,881 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-25 07:42:04,881 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:04,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 221108929, now seen corresponding path program 1 times [2023-12-25 07:42:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519858725] [2023-12-25 07:42:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:04,882 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-25 07:42:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:04,883 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-25 07:42:04,883 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-25 07:42:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:04,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:42:04,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:05,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 48 proven. 188 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:06,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519858725] [2023-12-25 07:42:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519858725] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:06,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:42:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448884589] [2023-12-25 07:42:06,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:06,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:42:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:42:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:42:06,559 INFO L87 Difference]: Start difference. First operand 24962 states and 28131 transitions. Second operand has 34 states, 34 states have (on average 7.823529411764706) internal successors, (266), 34 states have internal predecessors, (266), 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-25 07:42:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:10,626 INFO L93 Difference]: Finished difference Result 33680 states and 38143 transitions. [2023-12-25 07:42:10,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 07:42:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.823529411764706) internal successors, (266), 34 states have internal predecessors, (266), 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) Word has length 140 [2023-12-25 07:42:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:10,642 INFO L225 Difference]: With dead ends: 33680 [2023-12-25 07:42:10,642 INFO L226 Difference]: Without dead ends: 21681 [2023-12-25 07:42:10,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=918, Invalid=5402, Unknown=0, NotChecked=0, Total=6320 [2023-12-25 07:42:10,650 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 664 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:10,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 2175 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 07:42:10,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21681 states. [2023-12-25 07:42:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21681 to 17976. [2023-12-25 07:42:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17976 states, 17975 states have (on average 1.1166063977746872) internal successors, (20071), 17975 states have internal predecessors, (20071), 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-25 07:42:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17976 states to 17976 states and 20071 transitions. [2023-12-25 07:42:11,926 INFO L78 Accepts]: Start accepts. Automaton has 17976 states and 20071 transitions. Word has length 140 [2023-12-25 07:42:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:11,926 INFO L495 AbstractCegarLoop]: Abstraction has 17976 states and 20071 transitions. [2023-12-25 07:42:11,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.823529411764706) internal successors, (266), 34 states have internal predecessors, (266), 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-25 07:42:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17976 states and 20071 transitions. [2023-12-25 07:42:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 07:42:11,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:11,929 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:11,932 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 (30)] Forceful destruction successful, exit code 0 [2023-12-25 07:42:12,132 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-25 07:42:12,132 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:12,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1575838723, now seen corresponding path program 1 times [2023-12-25 07:42:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547952371] [2023-12-25 07:42:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:12,133 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-25 07:42:12,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:12,134 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-25 07:42:12,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 (31)] Waiting until timeout for monitored process [2023-12-25 07:42:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:12,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:42:12,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 150 proven. 42 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 07:42:12,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 145 proven. 47 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-25 07:42:13,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:13,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547952371] [2023-12-25 07:42:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547952371] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:13,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2023-12-25 07:42:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158040847] [2023-12-25 07:42:13,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:13,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 07:42:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:13,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 07:42:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:42:13,407 INFO L87 Difference]: Start difference. First operand 17976 states and 20071 transitions. Second operand has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 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-25 07:42:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:15,562 INFO L93 Difference]: Finished difference Result 27803 states and 31078 transitions. [2023-12-25 07:42:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 07:42:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 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) Word has length 140 [2023-12-25 07:42:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:15,573 INFO L225 Difference]: With dead ends: 27803 [2023-12-25 07:42:15,573 INFO L226 Difference]: Without dead ends: 12311 [2023-12-25 07:42:15,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=1584, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 07:42:15,582 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 804 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:15,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 813 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 07:42:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12311 states. [2023-12-25 07:42:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12311 to 10212. [2023-12-25 07:42:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10212 states, 10211 states have (on average 1.1056703554989717) internal successors, (11290), 10211 states have internal predecessors, (11290), 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-25 07:42:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 11290 transitions. [2023-12-25 07:42:16,396 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 11290 transitions. Word has length 140 [2023-12-25 07:42:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:16,396 INFO L495 AbstractCegarLoop]: Abstraction has 10212 states and 11290 transitions. [2023-12-25 07:42:16,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.84) internal successors, (196), 25 states have internal predecessors, (196), 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-25 07:42:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 11290 transitions. [2023-12-25 07:42:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-25 07:42:16,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:16,398 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:16,400 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 (31)] Ended with exit code 0 [2023-12-25 07:42:16,600 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-25 07:42:16,601 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:16,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2028708511, now seen corresponding path program 1 times [2023-12-25 07:42:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416032585] [2023-12-25 07:42:16,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:16,602 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-25 07:42:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:16,602 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-25 07:42:16,603 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-25 07:42:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:16,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 07:42:16,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 32 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:17,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 32 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:42:18,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416032585] [2023-12-25 07:42:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416032585] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:18,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-25 07:42:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624722581] [2023-12-25 07:42:18,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:18,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 07:42:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 07:42:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 07:42:18,187 INFO L87 Difference]: Start difference. First operand 10212 states and 11290 transitions. Second operand has 34 states, 34 states have (on average 7.970588235294118) internal successors, (271), 34 states have internal predecessors, (271), 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-25 07:42:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:21,035 INFO L93 Difference]: Finished difference Result 11613 states and 12831 transitions. [2023-12-25 07:42:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-25 07:42:21,036 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.970588235294118) internal successors, (271), 34 states have internal predecessors, (271), 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) Word has length 140 [2023-12-25 07:42:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:21,040 INFO L225 Difference]: With dead ends: 11613 [2023-12-25 07:42:21,040 INFO L226 Difference]: Without dead ends: 5904 [2023-12-25 07:42:21,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=749, Invalid=4081, Unknown=0, NotChecked=0, Total=4830 [2023-12-25 07:42:21,043 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 544 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:21,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2082 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:42:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5904 states. [2023-12-25 07:42:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5904 to 4295. [2023-12-25 07:42:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.0875640428504891) internal successors, (4670), 4294 states have internal predecessors, (4670), 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-25 07:42:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 4670 transitions. [2023-12-25 07:42:21,375 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 4670 transitions. Word has length 140 [2023-12-25 07:42:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:21,375 INFO L495 AbstractCegarLoop]: Abstraction has 4295 states and 4670 transitions. [2023-12-25 07:42:21,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.970588235294118) internal successors, (271), 34 states have internal predecessors, (271), 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-25 07:42:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 4670 transitions. [2023-12-25 07:42:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 07:42:21,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:21,377 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:21,380 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 (32)] Ended with exit code 0 [2023-12-25 07:42:21,579 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-25 07:42:21,580 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:21,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1864809779, now seen corresponding path program 1 times [2023-12-25 07:42:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:21,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821197003] [2023-12-25 07:42:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:21,580 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-25 07:42:21,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:21,582 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-25 07:42:21,582 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-25 07:42:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:21,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:42:21,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 142 proven. 67 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:42:22,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 139 proven. 70 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:42:22,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821197003] [2023-12-25 07:42:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821197003] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:22,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:22,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2023-12-25 07:42:22,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881897439] [2023-12-25 07:42:22,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:22,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 07:42:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 07:42:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-12-25 07:42:22,917 INFO L87 Difference]: Start difference. First operand 4295 states and 4670 transitions. Second operand has 24 states, 24 states have (on average 9.083333333333334) internal successors, (218), 24 states have internal predecessors, (218), 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-25 07:42:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:42:24,512 INFO L93 Difference]: Finished difference Result 8465 states and 9265 transitions. [2023-12-25 07:42:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 07:42:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.083333333333334) internal successors, (218), 24 states have internal predecessors, (218), 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) Word has length 141 [2023-12-25 07:42:24,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:42:24,517 INFO L225 Difference]: With dead ends: 8465 [2023-12-25 07:42:24,517 INFO L226 Difference]: Without dead ends: 5494 [2023-12-25 07:42:24,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=456, Invalid=1524, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 07:42:24,519 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 279 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:42:24,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 711 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:42:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2023-12-25 07:42:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 3683. [2023-12-25 07:42:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3683 states, 3682 states have (on average 1.0945138511678436) internal successors, (4030), 3682 states have internal predecessors, (4030), 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-25 07:42:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4030 transitions. [2023-12-25 07:42:24,857 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4030 transitions. Word has length 141 [2023-12-25 07:42:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:42:24,858 INFO L495 AbstractCegarLoop]: Abstraction has 3683 states and 4030 transitions. [2023-12-25 07:42:24,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.083333333333334) internal successors, (218), 24 states have internal predecessors, (218), 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-25 07:42:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4030 transitions. [2023-12-25 07:42:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 07:42:24,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:42:24,859 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:42:24,861 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 (33)] Forceful destruction successful, exit code 0 [2023-12-25 07:42:25,059 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-25 07:42:25,060 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:42:25,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:42:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash -634303605, now seen corresponding path program 1 times [2023-12-25 07:42:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:42:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400061136] [2023-12-25 07:42:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:42:25,060 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-25 07:42:25,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:42:25,061 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-25 07:42:25,062 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-25 07:42:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:42:25,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 07:42:25,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:42:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 138 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 07:42:28,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:42:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 138 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 07:42:29,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:42:29,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400061136] [2023-12-25 07:42:29,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400061136] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:42:29,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:42:29,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 41 [2023-12-25 07:42:29,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660975682] [2023-12-25 07:42:29,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:42:29,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 07:42:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:42:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 07:42:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2023-12-25 07:42:29,861 INFO L87 Difference]: Start difference. First operand 3683 states and 4030 transitions. Second operand has 41 states, 41 states have (on average 5.2682926829268295) internal successors, (216), 41 states have internal predecessors, (216), 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-25 07:43:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:14,325 INFO L93 Difference]: Finished difference Result 7432 states and 8107 transitions. [2023-12-25 07:43:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2023-12-25 07:43:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.2682926829268295) internal successors, (216), 41 states have internal predecessors, (216), 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) Word has length 141 [2023-12-25 07:43:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:14,329 INFO L225 Difference]: With dead ends: 7432 [2023-12-25 07:43:14,329 INFO L226 Difference]: Without dead ends: 4544 [2023-12-25 07:43:14,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10968 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=4308, Invalid=28272, Unknown=0, NotChecked=0, Total=32580 [2023-12-25 07:43:14,332 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 2266 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:14,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 2499 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-12-25 07:43:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2023-12-25 07:43:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 3817. [2023-12-25 07:43:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3817 states, 3816 states have (on average 1.0893605870020964) internal successors, (4157), 3816 states have internal predecessors, (4157), 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-25 07:43:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4157 transitions. [2023-12-25 07:43:14,703 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4157 transitions. Word has length 141 [2023-12-25 07:43:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:14,703 INFO L495 AbstractCegarLoop]: Abstraction has 3817 states and 4157 transitions. [2023-12-25 07:43:14,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.2682926829268295) internal successors, (216), 41 states have internal predecessors, (216), 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-25 07:43:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4157 transitions. [2023-12-25 07:43:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 07:43:14,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:14,705 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-25 07:43:14,707 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 (34)] Ended with exit code 0 [2023-12-25 07:43:14,905 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-25 07:43:14,906 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:14,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1513992085, now seen corresponding path program 1 times [2023-12-25 07:43:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494722431] [2023-12-25 07:43:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:14,907 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-25 07:43:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:14,907 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-25 07:43:14,908 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-25 07:43:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:14,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 07:43:14,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 68 proven. 142 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 07:43:15,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 95 proven. 115 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-25 07:43:16,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494722431] [2023-12-25 07:43:16,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494722431] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:16,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2023-12-25 07:43:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210913438] [2023-12-25 07:43:16,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:16,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 07:43:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 07:43:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-12-25 07:43:16,452 INFO L87 Difference]: Start difference. First operand 3817 states and 4157 transitions. Second operand has 24 states, 24 states have (on average 9.666666666666666) internal successors, (232), 24 states have internal predecessors, (232), 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-25 07:43:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:17,873 INFO L93 Difference]: Finished difference Result 4485 states and 4879 transitions. [2023-12-25 07:43:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 07:43:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.666666666666666) internal successors, (232), 24 states have internal predecessors, (232), 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) Word has length 141 [2023-12-25 07:43:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:17,876 INFO L225 Difference]: With dead ends: 4485 [2023-12-25 07:43:17,876 INFO L226 Difference]: Without dead ends: 1966 [2023-12-25 07:43:17,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=456, Invalid=1524, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 07:43:17,878 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 402 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:17,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 669 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 07:43:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2023-12-25 07:43:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1867. [2023-12-25 07:43:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1866 states have (on average 1.0718113612004287) internal successors, (2000), 1866 states have internal predecessors, (2000), 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-25 07:43:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2000 transitions. [2023-12-25 07:43:18,105 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2000 transitions. Word has length 141 [2023-12-25 07:43:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:18,106 INFO L495 AbstractCegarLoop]: Abstraction has 1867 states and 2000 transitions. [2023-12-25 07:43:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.666666666666666) internal successors, (232), 24 states have internal predecessors, (232), 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-25 07:43:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2000 transitions. [2023-12-25 07:43:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 07:43:18,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:18,107 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:18,109 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 (35)] Forceful destruction successful, exit code 0 [2023-12-25 07:43:18,307 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-25 07:43:18,307 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:18,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1440510635, now seen corresponding path program 1 times [2023-12-25 07:43:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:18,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031347381] [2023-12-25 07:43:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:18,308 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-25 07:43:18,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:18,309 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-25 07:43:18,310 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-25 07:43:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:18,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 07:43:18,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 138 proven. 71 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 07:43:20,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 32 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:22,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031347381] [2023-12-25 07:43:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031347381] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:22,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2023-12-25 07:43:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900989210] [2023-12-25 07:43:22,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:22,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-25 07:43:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-25 07:43:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 07:43:22,131 INFO L87 Difference]: Start difference. First operand 1867 states and 2000 transitions. Second operand has 44 states, 44 states have (on average 5.863636363636363) internal successors, (258), 44 states have internal predecessors, (258), 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-25 07:43:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:37,383 INFO L93 Difference]: Finished difference Result 2227 states and 2368 transitions. [2023-12-25 07:43:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-12-25 07:43:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 5.863636363636363) internal successors, (258), 44 states have internal predecessors, (258), 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) Word has length 141 [2023-12-25 07:43:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:37,386 INFO L225 Difference]: With dead ends: 2227 [2023-12-25 07:43:37,386 INFO L226 Difference]: Without dead ends: 1526 [2023-12-25 07:43:37,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6451 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=2328, Invalid=19134, Unknown=0, NotChecked=0, Total=21462 [2023-12-25 07:43:37,388 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1353 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:37,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2387 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-25 07:43:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2023-12-25 07:43:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1196. [2023-12-25 07:43:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.0627615062761506) internal successors, (1270), 1195 states have internal predecessors, (1270), 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-25 07:43:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1270 transitions. [2023-12-25 07:43:37,553 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1270 transitions. Word has length 141 [2023-12-25 07:43:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:37,553 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1270 transitions. [2023-12-25 07:43:37,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 5.863636363636363) internal successors, (258), 44 states have internal predecessors, (258), 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-25 07:43:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1270 transitions. [2023-12-25 07:43:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 07:43:37,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:37,554 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:37,558 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 (36)] Ended with exit code 0 [2023-12-25 07:43:37,754 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-25 07:43:37,754 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:37,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2018240991, now seen corresponding path program 2 times [2023-12-25 07:43:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952597904] [2023-12-25 07:43:37,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 07:43:37,755 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-25 07:43:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:37,756 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-25 07:43:37,756 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-25 07:43:37,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 07:43:37,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 07:43:37,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 07:43:37,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 56 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:39,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:43:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 32 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:43:42,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:43:42,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952597904] [2023-12-25 07:43:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952597904] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:43:42,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:43:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2023-12-25 07:43:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761991365] [2023-12-25 07:43:42,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:43:42,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-25 07:43:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:43:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-25 07:43:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 07:43:42,752 INFO L87 Difference]: Start difference. First operand 1196 states and 1270 transitions. Second operand has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 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-25 07:43:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:43:57,142 INFO L93 Difference]: Finished difference Result 1781 states and 1878 transitions. [2023-12-25 07:43:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-12-25 07:43:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 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) Word has length 142 [2023-12-25 07:43:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:43:57,145 INFO L225 Difference]: With dead ends: 1781 [2023-12-25 07:43:57,145 INFO L226 Difference]: Without dead ends: 1372 [2023-12-25 07:43:57,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4918 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=2979, Invalid=15111, Unknown=0, NotChecked=0, Total=18090 [2023-12-25 07:43:57,146 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1407 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 07:43:57,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 1639 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 07:43:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2023-12-25 07:43:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1005. [2023-12-25 07:43:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 1004 states have (on average 1.0637450199203187) internal successors, (1068), 1004 states have internal predecessors, (1068), 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-25 07:43:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1068 transitions. [2023-12-25 07:43:57,270 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1068 transitions. Word has length 142 [2023-12-25 07:43:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:43:57,271 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1068 transitions. [2023-12-25 07:43:57,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.729166666666667) internal successors, (275), 48 states have internal predecessors, (275), 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-25 07:43:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1068 transitions. [2023-12-25 07:43:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 07:43:57,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:43:57,271 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:43:57,274 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 (37)] Ended with exit code 0 [2023-12-25 07:43:57,472 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-25 07:43:57,472 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:43:57,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:43:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -947252993, now seen corresponding path program 1 times [2023-12-25 07:43:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:43:57,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039336724] [2023-12-25 07:43:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:43:57,473 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-25 07:43:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:43:57,474 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-25 07:43:57,475 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-25 07:43:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:43:57,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 07:43:57,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:43:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 143 proven. 52 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:43:59,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:44:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 66 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:44:00,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:44:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039336724] [2023-12-25 07:44:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039336724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:44:00,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:44:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2023-12-25 07:44:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822101840] [2023-12-25 07:44:00,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:44:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 07:44:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:44:00,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 07:44:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1607, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 07:44:00,968 INFO L87 Difference]: Start difference. First operand 1005 states and 1068 transitions. Second operand has 43 states, 43 states have (on average 5.534883720930233) internal successors, (238), 43 states have internal predecessors, (238), 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-25 07:44:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:44:08,193 INFO L93 Difference]: Finished difference Result 1050 states and 1110 transitions. [2023-12-25 07:44:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-25 07:44:08,194 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 5.534883720930233) internal successors, (238), 43 states have internal predecessors, (238), 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) Word has length 142 [2023-12-25 07:44:08,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:44:08,195 INFO L225 Difference]: With dead ends: 1050 [2023-12-25 07:44:08,195 INFO L226 Difference]: Without dead ends: 494 [2023-12-25 07:44:08,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1348, Invalid=8158, Unknown=0, NotChecked=0, Total=9506 [2023-12-25 07:44:08,196 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 886 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-25 07:44:08,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1065 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-25 07:44:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-12-25 07:44:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 480. [2023-12-25 07:44:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.0501043841336117) internal successors, (503), 479 states have internal predecessors, (503), 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-25 07:44:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 503 transitions. [2023-12-25 07:44:08,262 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 503 transitions. Word has length 142 [2023-12-25 07:44:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:44:08,262 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 503 transitions. [2023-12-25 07:44:08,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.534883720930233) internal successors, (238), 43 states have internal predecessors, (238), 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-25 07:44:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 503 transitions. [2023-12-25 07:44:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-25 07:44:08,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:44:08,263 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:44:08,268 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 (38)] Forceful destruction successful, exit code 0 [2023-12-25 07:44:08,465 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-25 07:44:08,467 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:44:08,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:44:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1959187755, now seen corresponding path program 1 times [2023-12-25 07:44:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:44:08,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015248550] [2023-12-25 07:44:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:44:08,467 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-25 07:44:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:44:08,468 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-25 07:44:08,472 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-25 07:44:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:44:08,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 07:44:08,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:44:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 153 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:44:09,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:44:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 148 proven. 47 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-25 07:44:09,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:44:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015248550] [2023-12-25 07:44:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015248550] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:44:09,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:44:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2023-12-25 07:44:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631065152] [2023-12-25 07:44:09,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:44:09,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 07:44:09,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:44:09,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 07:44:09,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2023-12-25 07:44:09,855 INFO L87 Difference]: Start difference. First operand 480 states and 503 transitions. Second operand has 25 states, 25 states have (on average 8.0) internal successors, (200), 25 states have internal predecessors, (200), 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-25 07:44:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:44:10,696 INFO L93 Difference]: Finished difference Result 484 states and 505 transitions. [2023-12-25 07:44:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 07:44:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.0) internal successors, (200), 25 states have internal predecessors, (200), 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) Word has length 143 [2023-12-25 07:44:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:44:10,697 INFO L225 Difference]: With dead ends: 484 [2023-12-25 07:44:10,697 INFO L226 Difference]: Without dead ends: 335 [2023-12-25 07:44:10,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 07:44:10,697 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 264 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 07:44:10,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 436 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 07:44:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-12-25 07:44:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2023-12-25 07:44:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.033132530120482) internal successors, (343), 332 states have internal predecessors, (343), 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-25 07:44:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 343 transitions. [2023-12-25 07:44:10,738 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 343 transitions. Word has length 143 [2023-12-25 07:44:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:44:10,739 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 343 transitions. [2023-12-25 07:44:10,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.0) internal successors, (200), 25 states have internal predecessors, (200), 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-25 07:44:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 343 transitions. [2023-12-25 07:44:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-25 07:44:10,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:44:10,739 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:44:10,744 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 (39)] Forceful destruction successful, exit code 0 [2023-12-25 07:44:10,940 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-25 07:44:10,940 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:44:10,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:44:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash 265874369, now seen corresponding path program 1 times [2023-12-25 07:44:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:44:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245777867] [2023-12-25 07:44:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:44:10,941 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-25 07:44:10,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:44:10,942 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-25 07:44:10,943 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-25 07:44:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:44:11,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 07:44:11,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:44:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-25 07:44:12,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 07:44:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-25 07:44:15,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:44:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245777867] [2023-12-25 07:44:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245777867] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 07:44:15,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 07:44:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2023-12-25 07:44:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321349947] [2023-12-25 07:44:15,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 07:44:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-25 07:44:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:44:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-25 07:44:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 07:44:15,171 INFO L87 Difference]: Start difference. First operand 333 states and 343 transitions. Second operand has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 38 states have internal predecessors, (140), 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-25 07:44:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:44:18,035 INFO L93 Difference]: Finished difference Result 333 states and 343 transitions. [2023-12-25 07:44:18,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 07:44:18,036 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 38 states have internal predecessors, (140), 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) Word has length 146 [2023-12-25 07:44:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:44:18,036 INFO L225 Difference]: With dead ends: 333 [2023-12-25 07:44:18,036 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 07:44:18,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=482, Invalid=1968, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 07:44:18,037 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 144 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:44:18,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 259 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 07:44:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 07:44:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 07:44:18,038 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-25 07:44:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 07:44:18,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2023-12-25 07:44:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:44:18,038 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 07:44:18,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 38 states have internal predecessors, (140), 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-25 07:44:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 07:44:18,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 07:44:18,040 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:44:18,045 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 (40)] Forceful destruction successful, exit code 0 [2023-12-25 07:44:18,241 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-25 07:44:18,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 07:47:34,896 WARN L293 SmtUtils]: Spent 3.28m on a formula simplification. DAG size of input: 3236 DAG size of output: 3114 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-25 07:48:38,016 WARN L293 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 3114 DAG size of output: 920 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 221) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 120) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 199) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 135 199) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 101) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 80 104) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 196) no Hoare annotation was computed. [2023-12-25 07:48:38,023 INFO L899 garLoopResultBuilder]: For program point L285(line 285) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 193) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 190) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L89(lines 89 96) no Hoare annotation was computed. [2023-12-25 07:48:38,024 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 89 96) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 187) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 95) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 76) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L57-2(lines 51 79) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 184) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 181) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 227) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 208 227) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 178) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 95) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 224) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 175) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 172) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-12-25 07:48:38,025 INFO L899 garLoopResultBuilder]: For program point L111-2(lines 105 129) no Hoare annotation was computed. [2023-12-25 07:48:38,027 INFO L895 garLoopResultBuilder]: At program point L260-2(lines 260 274) the Hoare annotation is: (let ((.cse143 ((_ sign_extend 24) ~send2~0))) (let ((.cse176 ((_ sign_extend 24) ~p1_old~0)) (.cse206 ((_ extract 7 0) .cse143)) (.cse76 ((_ sign_extend 24) ~send1~0))) (let ((.cse213 ((_ extract 7 0) .cse76)) (.cse27 ((_ sign_extend 24) ~p2_old~0)) (.cse179 ((_ sign_extend 24) ~p3_old~0)) (.cse145 ((_ sign_extend 24) ~send3~0)) (.cse41 ((_ sign_extend 24) ~id2~0)) (.cse190 ((_ sign_extend 24) .cse206)) (.cse177 ((_ sign_extend 24) ((_ extract 7 0) .cse176))) (.cse26 ((_ sign_extend 24) ~id3~0))) (let ((.cse175 ((_ zero_extend 24) ~r1~0)) (.cse132 (bvsgt .cse177 .cse26)) (.cse178 (bvsgt .cse190 .cse26)) (.cse17 (= ((_ sign_extend 24) ~st1~0) (_ bv0 32))) (.cse3 (= (bvadd ~p1_new~0 (_ bv1 8)) (_ bv0 8))) (.cse6 (= ((_ sign_extend 24) ~st3~0) (_ bv0 32))) (.cse10 (= ((_ sign_extend 24) ~st2~0) (_ bv0 32))) (.cse11 (= (bvadd (_ bv1 8) ~p3_new~0) (_ bv0 8))) (.cse44 (= (_ bv1 8) ~mode3~0)) (.cse12 (= (bvadd (_ bv1 8) ~p2_new~0) (_ bv0 8))) (.cse46 (= (_ bv1 8) ~mode1~0)) (.cse49 (= (_ bv1 8) ~mode2~0)) (.cse129 (exists ((v_subst_33 (_ BitVec 8)) (v_subst_34 (_ BitVec 8))) (let ((.cse237 ((_ sign_extend 24) v_subst_33)) (.cse238 ((_ sign_extend 24) v_subst_34))) (and (bvsge .cse237 (_ bv0 32)) (not (= .cse41 .cse237)) (= .cse237 .cse238) (= ~p1_old~0 ((_ extract 7 0) .cse238)))))) (.cse116 (= (_ bv1 8) ~st1~0)) (.cse105 ((_ extract 7 0) .cse145)) (.cse189 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse179)) .cse41))) (.cse36 (not (bvsgt .cse27 .cse26))) (.cse33 ((_ sign_extend 24) ~id1~0)) (.cse37 (bvsgt ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) .cse213))) .cse26))) (let ((.cse45 (or (forall ((~send3~0 (_ BitVec 8))) (let ((.cse236 ((_ sign_extend 24) ~send3~0))) (or (not (= .cse26 .cse236)) (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse236)) .cse33))))) (not .cse37))) (.cse77 (exists ((v_subst_1959 (_ BitVec 8))) (let ((.cse235 ((_ sign_extend 24) v_subst_1959))) (and (= ~send1~0 ((_ extract 7 0) .cse235)) (= .cse26 .cse235))))) (.cse79 (exists ((v_subst_1960 (_ BitVec 8))) (let ((.cse234 ((_ sign_extend 24) v_subst_1960))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse234))) ~send2~0) (= .cse26 .cse234))))) (.cse29 (exists ((v_subst_29 (_ BitVec 8))) (let ((.cse233 ((_ sign_extend 24) v_subst_29))) (and (= .cse233 .cse76) (not (= .cse41 .cse233)))))) (.cse86 (exists ((v_subst_912 (_ BitVec 8))) (let ((.cse232 ((_ sign_extend 24) v_subst_912))) (and (= ((_ extract 7 0) .cse232) ~send2~0) (= .cse232 .cse33))))) (.cse87 (exists ((v_subst_913 (_ BitVec 8))) (let ((.cse231 ((_ sign_extend 24) v_subst_913))) (and (= .cse231 .cse33) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse231))) ~send3~0))))) (.cse78 (exists ((v_subst_2 (_ BitVec 8))) (let ((.cse230 ((_ sign_extend 24) v_subst_2))) (and (not (= .cse33 .cse230)) (= .cse145 .cse230))))) (.cse89 (exists ((v_subst_246 (_ BitVec 8))) (let ((.cse229 ((_ sign_extend 24) v_subst_246))) (and (bvsge .cse229 (_ bv0 32)) (= .cse229 .cse145))))) (.cse92 (exists ((v_subst_312 (_ BitVec 8))) (let ((.cse228 ((_ sign_extend 24) v_subst_312))) (and (= .cse145 .cse228) (not (= .cse41 .cse228)))))) (.cse109 (exists ((v_subst_1938 (_ BitVec 8))) (let ((.cse227 ((_ sign_extend 24) v_subst_1938))) (and (= .cse26 .cse227) (= ~send1~0 ((_ extract 7 0) .cse227)))))) (.cse81 (exists ((v_subst_310 (_ BitVec 8)) (v_subst_311 (_ BitVec 8))) (let ((.cse225 ((_ sign_extend 24) v_subst_310)) (.cse226 ((_ sign_extend 24) v_subst_311))) (and (bvsge .cse225 (_ bv0 32)) (not (= .cse41 .cse225)) (= ((_ extract 7 0) .cse226) ~send1~0) (= .cse225 .cse226))))) (.cse93 (exists ((v_subst_1974 (_ BitVec 8))) (let ((.cse224 ((_ sign_extend 24) v_subst_1974))) (and (= ~p3_old~0 ((_ extract 7 0) .cse224)) (= .cse26 .cse224))))) (.cse94 (exists ((v_subst_1976 (_ BitVec 8))) (let ((.cse223 ((_ sign_extend 24) v_subst_1976))) (and (= ((_ extract 7 0) .cse223) ~send1~0) (= .cse26 .cse223))))) (.cse95 (exists ((v_subst_1973 (_ BitVec 8))) (let ((.cse222 ((_ sign_extend 24) v_subst_1973))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse222))) ~send2~0) (= .cse26 .cse222))))) (.cse96 (exists ((v_subst_1975 (_ BitVec 8))) (let ((.cse221 ((_ sign_extend 24) v_subst_1975))) (and (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse221)))) (= .cse26 .cse221))))) (.cse97 (exists ((v_subst_1977 (_ BitVec 8))) (let ((.cse220 ((_ sign_extend 24) v_subst_1977))) (and (= .cse26 .cse220) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse220))))) ~p2_old~0))))) (.cse83 (= (_ bv1 8) ~st3~0)) (.cse4 (exists ((v_subst_1864 (_ BitVec 8))) (let ((.cse219 ((_ sign_extend 24) v_subst_1864))) (and (= .cse41 .cse219) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse219))) ~send1~0))))) (.cse7 (exists ((v_subst_94 (_ BitVec 8)) (v_subst_93 (_ BitVec 8))) (let ((.cse218 ((_ sign_extend 24) v_subst_94)) (.cse217 ((_ sign_extend 24) v_subst_93))) (and (= .cse217 .cse218) (bvsge .cse217 (_ bv0 32)) (= ~send3~0 ((_ extract 7 0) .cse218)) (not (= .cse217 .cse33)))))) (.cse9 (or .cse189 .cse36)) (.cse13 (exists ((v_subst_1863 (_ BitVec 8))) (let ((.cse216 ((_ sign_extend 24) v_subst_1863))) (and (= .cse216 .cse41) (= ~send3~0 ((_ extract 7 0) .cse216)))))) (.cse15 (exists ((v_subst_95 (_ BitVec 8))) (let ((.cse215 ((_ sign_extend 24) v_subst_95))) (and (not (= .cse215 .cse33)) (= .cse143 .cse215))))) (.cse68 (exists ((v_subst_887 (_ BitVec 8))) (let ((.cse214 ((_ sign_extend 24) v_subst_887))) (and (= .cse214 .cse33) (= ~p1_old~0 ((_ extract 7 0) .cse214)))))) (.cse69 (= ~p1_old~0 .cse213)) (.cse35 (= .cse213 ~send2~0)) (.cse63 (exists ((v_subst_329 (_ BitVec 8)) (v_subst_330 (_ BitVec 8))) (let ((.cse211 ((_ sign_extend 24) v_subst_330)) (.cse212 ((_ sign_extend 24) v_subst_329))) (and (= .cse211 .cse212) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse211)))) (bvsge .cse212 (_ bv0 32)) (not (= .cse41 .cse212)))))) (.cse66 (exists ((v_subst_334 (_ BitVec 8)) (v_subst_333 (_ BitVec 8))) (let ((.cse209 ((_ sign_extend 24) v_subst_333)) (.cse210 ((_ sign_extend 24) v_subst_334))) (and (= .cse209 .cse210) (bvsge .cse209 (_ bv0 32)) (not (= .cse41 .cse209)) (= ((_ extract 7 0) .cse210) ~send1~0))))) (.cse34 (= (_ bv1 8) ~r1~0)) (.cse102 (exists ((v_subst_1944 (_ BitVec 8))) (let ((.cse208 ((_ sign_extend 24) v_subst_1944))) (and (= .cse26 .cse208) (= ~p3_old~0 ((_ extract 7 0) .cse208)))))) (.cse73 (exists ((v_subst_335 (_ BitVec 8))) (let ((.cse207 ((_ sign_extend 24) v_subst_335))) (and (= .cse145 .cse207) (not (= .cse41 .cse207)))))) (.cse103 (= .cse206 ~p2_old~0)) (.cse58 (bvsgt ((_ sign_extend 24) .cse105) .cse33)) (.cse67 (bvsge .cse41 (_ bv0 32))) (.cse124 (let ((.cse191 (exists ((v_subst_936 (_ BitVec 8))) (let ((.cse205 ((_ sign_extend 24) v_subst_936))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse205))))) ~p3_old~0) (= .cse205 .cse33))))) (.cse192 (exists ((v_subst_937 (_ BitVec 8))) (let ((.cse204 ((_ sign_extend 24) v_subst_937))) (and (= ~send2~0 ((_ extract 7 0) .cse204)) (= .cse204 .cse33))))) (.cse193 (exists ((v_subst_229 (_ BitVec 8)) (v_subst_230 (_ BitVec 8))) (let ((.cse203 ((_ sign_extend 24) v_subst_229)) (.cse202 ((_ sign_extend 24) v_subst_230))) (and (= .cse202 .cse203) (bvsge .cse203 (_ bv0 32)) (= ((_ extract 7 0) .cse202) ~p3_old~0))))) (.cse194 (exists ((v_subst_938 (_ BitVec 8))) (let ((.cse201 ((_ sign_extend 24) v_subst_938))) (and (= .cse201 .cse33) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse201))) ~send3~0))))) (.cse195 (exists ((v_subst_935 (_ BitVec 8))) (let ((.cse200 ((_ sign_extend 24) v_subst_935))) (and (= .cse33 .cse200) (= ~p1_old~0 ((_ extract 7 0) .cse200)))))) (.cse196 (exists ((v_subst_939 (_ BitVec 8))) (let ((.cse199 ((_ sign_extend 24) v_subst_939))) (and (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse199))) ~p2_old~0) (= .cse199 .cse33))))) (.cse197 (exists ((v_subst_466 (_ BitVec 8))) (let ((.cse198 ((_ sign_extend 24) v_subst_466))) (and (not (= .cse26 .cse198)) (= .cse198 .cse76)))))) (or (and .cse191 .cse3 .cse6 .cse192 .cse10 .cse193 .cse11 .cse44 .cse12 .cse194 .cse46 .cse49 .cse195 .cse17 .cse129 .cse196 .cse197) (and .cse191 .cse3 .cse6 .cse192 .cse10 .cse193 .cse11 .cse44 .cse12 .cse194 .cse46 .cse49 .cse195 .cse129 .cse196 .cse197 .cse116)))) (.cse18 (= ~r1~0 (_ bv2 8))) (.cse104 (or .cse178 .cse189 (= .cse26 .cse190) (= .cse176 .cse41))) (.cse24 (= .cse33 .cse76)) (.cse80 (= .cse26 .cse145)) (.cse28 (not .cse132)) (.cse125 (= .cse175 (_ bv0 32))) (.cse20 (exists ((v_subst_50 (_ BitVec 8))) (let ((.cse188 ((_ sign_extend 24) v_subst_50))) (and (= .cse143 .cse188) (not (= .cse26 .cse188)))))) (.cse64 (exists ((v_subst_111 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse186 ((_ sign_extend 24) ~send2~0)) (.cse187 ((_ sign_extend 24) v_subst_111))) (and (= .cse186 .cse187) (bvsge .cse187 (_ bv0 32)) (= ((_ extract 7 0) .cse186) ~send3~0) (not (= .cse33 .cse187)))))) (.cse65 (exists ((v_subst_110 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse185 ((_ sign_extend 24) ~send2~0)) (.cse184 ((_ sign_extend 24) v_subst_110))) (and (not (= .cse184 .cse33)) (= ~p3_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse185)))) (bvsge .cse184 (_ bv0 32)) (= .cse185 .cse184))))) (.cse133 (exists ((~send2~0 (_ BitVec 8))) (let ((.cse183 ((_ sign_extend 24) ~send2~0))) (and (= .cse183 .cse41) (= ~p3_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse183)))))))) (.cse47 (= ~p3_old~0 .cse105)) (.cse0 (= ((_ zero_extend 24) ~mode3~0) (_ bv0 32))) (.cse1 (= (_ bv0 32) ((_ zero_extend 24) ~mode1~0))) (.cse5 (= ((_ zero_extend 24) ~mode2~0) (_ bv0 32))) (.cse8 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse27)) .cse33))) (.cse119 (= (_ bv1 8) ~st2~0)) (.cse148 (exists ((~send2~0 (_ BitVec 8))) (let ((.cse182 ((_ sign_extend 24) ~send2~0))) (and (= .cse182 .cse41) (= ~send1~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse182)))))))) (.cse120 (exists ((~send1~0 (_ BitVec 8))) (let ((.cse181 ((_ sign_extend 24) ~send1~0))) (and (= .cse33 .cse181) (= ((_ extract 7 0) .cse181) ~send2~0))))) (.cse25 (exists ((~send2~0 (_ BitVec 8))) (let ((.cse180 ((_ sign_extend 24) ~send2~0))) (and (= .cse180 .cse41) (= ((_ extract 7 0) .cse180) ~send3~0))))) (.cse14 (not (bvsgt .cse179 .cse33))) (.cse155 (not .cse178)) (.cse19 (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse177)) .cse33))) (.cse23 (not (bvsgt .cse176 .cse41))) (.cse2 (= .cse143 .cse41)) (.cse82 (bvsge .cse175 (_ bv3 32))) (.cse38 (exists ((v_subst_117 (_ BitVec 8)) (v_subst_116 (_ BitVec 8))) (let ((.cse173 ((_ sign_extend 24) v_subst_117)) (.cse174 ((_ sign_extend 24) v_subst_116))) (and (= ~p3_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse173)))) (not (= .cse33 .cse174)) (= .cse173 .cse174) (bvsge .cse174 (_ bv0 32)))))) (.cse110 (exists ((v_subst_1878 (_ BitVec 8))) (let ((.cse172 ((_ sign_extend 24) v_subst_1878))) (and (= ~p2_old~0 ((_ extract 7 0) .cse172)) (= .cse41 .cse172))))) (.cse111 (exists ((v_subst_1879 (_ BitVec 8))) (let ((.cse171 ((_ sign_extend 24) v_subst_1879))) (and (= .cse41 .cse171) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse171)))))))))) (.cse43 (exists ((v_subst_115 (_ BitVec 8)) (v_subst_114 (_ BitVec 8))) (let ((.cse170 ((_ sign_extend 24) v_subst_115)) (.cse169 ((_ sign_extend 24) v_subst_114))) (and (not (= .cse169 .cse33)) (= ~send3~0 ((_ extract 7 0) .cse170)) (= .cse170 .cse169) (bvsge .cse169 (_ bv0 32)))))) (.cse112 (exists ((v_subst_1877 (_ BitVec 8))) (let ((.cse168 ((_ sign_extend 24) v_subst_1877))) (and (= .cse41 .cse168) (= ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse168))) ~p3_old~0))))) (.cse48 (exists ((v_subst_112 (_ BitVec 8)) (v_subst_113 (_ BitVec 8))) (let ((.cse166 ((_ sign_extend 24) v_subst_112)) (.cse167 ((_ sign_extend 24) v_subst_113))) (and (bvsge .cse166 (_ bv0 32)) (= .cse166 .cse167) (not (= .cse166 .cse33)) (= ((_ extract 7 0) .cse167) ~p2_old~0))))) (.cse50 (exists ((v_subst_56 (_ BitVec 8))) (let ((.cse165 ((_ sign_extend 24) v_subst_56))) (and (= .cse143 .cse165) (not (= .cse26 .cse165)))))) (.cse51 (exists ((v_subst_118 (_ BitVec 8))) (let ((.cse164 ((_ sign_extend 24) v_subst_118))) (and (not (= .cse33 .cse164)) (= .cse143 .cse164))))) (.cse16 (bvsge .cse26 (_ bv0 32))) (.cse113 (exists ((v_subst_1881 (_ BitVec 8))) (let ((.cse163 ((_ sign_extend 24) v_subst_1881))) (and (= ((_ extract 7 0) .cse163) ~send3~0) (= .cse41 .cse163))))) (.cse55 (exists ((v_subst_55 (_ BitVec 8)) (v_subst_54 (_ BitVec 8))) (let ((.cse162 ((_ sign_extend 24) v_subst_55)) (.cse161 ((_ sign_extend 24) v_subst_54))) (and (not (= .cse26 .cse161)) (= ~p2_old~0 ((_ extract 7 0) .cse162)) (= .cse161 .cse162) (bvsge .cse161 (_ bv0 32)))))) (.cse21 (bvsge .cse33 (_ bv0 32))) (.cse22 (= (bvadd (_ bv1 8) ~nomsg~0) (_ bv0 8))) (.cse114 (exists ((v_subst_1880 (_ BitVec 8))) (let ((.cse160 ((_ sign_extend 24) v_subst_1880))) (and (= ~send1~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse160)))) (= .cse41 .cse160)))))) (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) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse24 .cse10 .cse25 .cse11 (or (= .cse26 .cse27) .cse28) .cse12 .cse29 (exists ((v_subst_1029 (_ BitVec 8)) (v_subst_1030 (_ BitVec 8)) (v_subst_1031 (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 24) v_subst_1029)) (.cse32 ((_ sign_extend 24) v_subst_1031)) (.cse30 ((_ sign_extend 24) v_subst_1030))) (and (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse30)) .cse31) (= .cse32 .cse31) (bvsge .cse31 (_ bv0 32)) (= ((_ extract 7 0) .cse32) ~send3~0) (= .cse30 .cse33)))) .cse34 .cse14 .cse35 .cse16 .cse17 .cse36 .cse37 .cse22 .cse23) (and .cse2 .cse3 .cse6 .cse38 (exists ((v_subst_1321 (_ BitVec 8)) (v_subst_1322 (_ BitVec 8)) (v_subst_1320 (_ BitVec 8))) (let ((.cse39 ((_ sign_extend 24) v_subst_1322)) (.cse42 ((_ sign_extend 24) v_subst_1321)) (.cse40 ((_ sign_extend 24) v_subst_1320))) (and (= .cse39 .cse40) (= .cse41 .cse42) (= ((_ extract 7 0) .cse39) ~send1~0) (bvsge .cse40 (_ bv0 32)) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse42)) .cse40)))) .cse10 .cse43 .cse11 .cse44 .cse12 .cse45 .cse34 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse16 (exists ((v_subst_1323 (_ BitVec 8)) (v_subst_1324 (_ BitVec 8)) (v_subst_1325 (_ BitVec 8))) (let ((.cse54 ((_ sign_extend 24) v_subst_1325)) (.cse53 ((_ sign_extend 24) v_subst_1324)) (.cse52 ((_ sign_extend 24) v_subst_1323))) (and (bvsge .cse52 (_ bv0 32)) (= .cse41 .cse53) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse54)))) (= .cse52 .cse54) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse53)) .cse52)))) .cse17 .cse55 (exists ((v_subst_1845 (_ BitVec 8))) (let ((.cse56 ((_ sign_extend 24) v_subst_1845))) (and (= .cse56 .cse41) (= ~p2_old~0 ((_ extract 7 0) .cse56))))) .cse21 .cse22 (exists ((v_subst_1843 (_ BitVec 8))) (let ((.cse57 ((_ sign_extend 24) v_subst_1843))) (and (= ((_ extract 7 0) .cse57) ~send3~0) (= .cse41 .cse57)))) .cse58) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (exists ((v_subst_1266 (_ BitVec 8)) (v_subst_1264 (_ BitVec 8)) (v_subst_1265 (_ BitVec 8))) (let ((.cse59 ((_ sign_extend 24) v_subst_1266)) (.cse61 ((_ sign_extend 24) v_subst_1265)) (.cse60 ((_ sign_extend 24) v_subst_1264))) (and (= .cse59 .cse60) (= .cse41 .cse61) (= ((_ extract 7 0) .cse59) ~send1~0) (bvsge .cse60 (_ bv0 32)) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse61)) .cse60)))) .cse10 .cse11 .cse12 .cse45 .cse34 .cse14 (exists ((v_subst_1837 (_ BitVec 8))) (let ((.cse62 ((_ sign_extend 24) v_subst_1837))) (and (= .cse41 .cse62) (= ~send3~0 ((_ extract 7 0) .cse62))))) .cse15 .cse16 .cse17 .cse36 .cse19 .cse20 .cse21 .cse22 .cse58) (and .cse3 .cse63 .cse6 .cse64 .cse65 .cse66 .cse10 .cse67 .cse11 .cse44 .cse68 .cse12 .cse69 (exists ((v_subst_2119 (_ BitVec 8))) (let ((.cse70 ((_ sign_extend 24) v_subst_2119))) (and (= .cse26 .cse70) (= ((_ extract 7 0) .cse70) ~p3_old~0)))) .cse34 .cse46 .cse47 (exists ((v_subst_2303 (_ BitVec 8)) (v_subst_2302 (_ BitVec 8)) (v_subst_2304 (_ BitVec 8))) (let ((.cse72 ((_ sign_extend 24) v_subst_2303))) (let ((.cse71 ((_ extract 7 0) .cse72))) (and (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) .cse71))) (= .cse26 ((_ sign_extend 24) v_subst_2304)) (= .cse72 ((_ sign_extend 24) v_subst_2302)) (= ~p1_old~0 .cse71))))) .cse49 .cse35 .cse73 .cse17 (exists ((v_subst_2301 (_ BitVec 8)) (v_subst_2300 (_ BitVec 8))) (let ((.cse74 ((_ sign_extend 24) v_subst_2301)) (.cse75 ((_ sign_extend 24) v_subst_2300))) (and (= .cse26 .cse74) (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse74)) .cse75)) (= .cse75 .cse76)))) .cse22) (and .cse0 .cse1 .cse3 .cse5 .cse77 .cse78 .cse6 .cse8 .cse79 .cse80 .cse10 .cse67 .cse11 .cse12 .cse14 .cse17 .cse18 .cse19 .cse21 .cse81 .cse22 .cse23 .cse58) (and .cse0 .cse1 .cse3 .cse5 .cse77 .cse78 .cse8 .cse79 .cse82 .cse80 .cse10 .cse67 .cse11 .cse12 .cse14 .cse17 .cse19 .cse83 .cse21 .cse81 .cse22 .cse23 .cse58) (and (exists ((v_subst_444 (_ BitVec 8)) (v_subst_443 (_ BitVec 8))) (let ((.cse84 ((_ sign_extend 24) v_subst_444)) (.cse85 ((_ sign_extend 24) v_subst_443))) (and (= .cse84 .cse85) (= ((_ extract 7 0) .cse84) ~send2~0) (not (= .cse26 .cse85)) (bvsge .cse85 (_ bv0 32))))) .cse0 .cse1 .cse3 .cse5 .cse6 .cse8 .cse24 .cse10 .cse86 .cse67 .cse11 .cse12 .cse29 .cse14 .cse16 .cse17 .cse36 .cse18 .cse19 .cse22 .cse23 .cse87) (and .cse0 .cse1 .cse3 .cse5 .cse78 .cse6 (exists ((v_subst_872 (_ BitVec 8))) (let ((.cse88 ((_ sign_extend 24) v_subst_872))) (and (= ~send2~0 ((_ extract 7 0) .cse88)) (= .cse88 .cse33)))) .cse80 .cse10 .cse67 .cse11 .cse12 .cse28 .cse89 .cse34 (exists ((v_subst_2254 (_ BitVec 8)) (v_subst_2253 (_ BitVec 8))) (let ((.cse90 ((_ sign_extend 24) v_subst_2254)) (.cse91 ((_ sign_extend 24) v_subst_2253))) (and (= .cse26 .cse90) (not (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse90)) .cse91)) (= .cse91 .cse76)))) .cse92 .cse14 .cse35 .cse17 .cse36 .cse81 .cse22 .cse23) (and .cse3 .cse63 .cse6 .cse64 .cse65 .cse66 .cse10 .cse93 .cse67 .cse11 .cse44 .cse12 .cse94 .cse46 .cse47 .cse95 .cse96 .cse49 .cse73 .cse97 .cse17 .cse18 .cse21 .cse22 .cse58) (and .cse3 .cse63 .cse6 .cse64 .cse82 .cse65 .cse66 .cse10 .cse93 .cse67 .cse11 .cse44 .cse12 .cse94 .cse46 .cse47 .cse95 .cse96 .cse49 .cse73 .cse97 .cse17 .cse21 .cse22 .cse58) (and .cse2 .cse3 .cse63 .cse6 .cse64 .cse65 (exists ((v_subst_1946 (_ BitVec 8))) (let ((.cse98 ((_ sign_extend 24) v_subst_1946))) (and (= .cse26 .cse98) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse98))))))) .cse66 .cse10 .cse11 .cse44 .cse12 (exists ((v_subst_1653 (_ BitVec 8)) (v_subst_1654 (_ BitVec 8)) (v_subst_1652 (_ BitVec 8))) (let ((.cse101 ((_ sign_extend 24) v_subst_1654)) (.cse100 ((_ sign_extend 24) v_subst_1652)) (.cse99 ((_ sign_extend 24) v_subst_1653))) (and (= .cse99 .cse100) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse101)) .cse100) (= .cse26 .cse101) (bvsge .cse100 (_ bv0 32)) (= ((_ extract 7 0) .cse99) ~send2~0)))) .cse69 .cse34 .cse46 .cse47 .cse102 .cse49 .cse73 .cse103 .cse17 .cse21 .cse22 .cse58) (and .cse0 .cse1 .cse2 .cse3 .cse104 .cse5 .cse78 .cse6 .cse8 .cse10 .cse11 (= ~send1~0 .cse105) .cse12 .cse89 .cse34 .cse92 .cse14 (exists ((v_subst_1598 (_ BitVec 8)) (v_subst_1596 (_ BitVec 8)) (v_subst_1597 (_ BitVec 8))) (let ((.cse107 ((_ sign_extend 24) v_subst_1596)) (.cse108 ((_ sign_extend 24) v_subst_1597)) (.cse106 ((_ sign_extend 24) v_subst_1598))) (and (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse106)) .cse107) (bvsge .cse107 (_ bv0 32)) (= .cse108 .cse107) (= ((_ extract 7 0) .cse108) ~send2~0) (= .cse26 .cse106)))) .cse17 .cse109 .cse19 .cse21 .cse81 .cse22 .cse23 .cse58) (and .cse2 .cse3 .cse6 .cse38 .cse110 .cse10 .cse111 .cse43 .cse11 .cse44 .cse12 .cse112 .cse46 .cse48 .cse49 .cse50 .cse51 .cse16 .cse17 .cse18 .cse113 .cse55 .cse21 .cse22 .cse114) (and .cse0 .cse1 .cse3 .cse5 .cse6 (exists ((v_subst_445 (_ BitVec 8))) (let ((.cse115 ((_ sign_extend 24) v_subst_445))) (and (not (= .cse26 .cse115)) (= .cse115 .cse76)))) .cse8 .cse82 .cse24 .cse10 .cse86 .cse67 .cse11 .cse12 .cse14 .cse16 .cse36 .cse19 .cse22 .cse116 .cse23 (exists ((v_subst_309 (_ BitVec 8)) (~send3~0 (_ BitVec 8))) (let ((.cse117 ((_ sign_extend 24) ~send3~0)) (.cse118 ((_ sign_extend 24) v_subst_309))) (and (= ~send1~0 ((_ extract 7 0) .cse117)) (bvsge .cse118 (_ bv0 32)) (= .cse117 .cse118) (not (= .cse41 .cse118))))) .cse87) (and .cse2 .cse3 .cse6 .cse82 .cse38 .cse119 .cse110 .cse111 .cse43 .cse11 .cse44 .cse12 .cse112 .cse46 .cse48 .cse49 .cse50 .cse51 .cse16 .cse17 .cse113 .cse55 .cse21 .cse22 .cse114) (and .cse0 .cse1 .cse3 .cse5 .cse78 .cse6 .cse8 .cse80 .cse120 .cse10 .cse67 .cse11 .cse12 .cse89 .cse34 .cse92 .cse14 (exists ((v_subst_2083 (_ BitVec 8)) (v_~send1~0_47 (_ BitVec 8))) (let ((.cse122 ((_ sign_extend 24) v_~send1~0_47))) (let ((.cse121 ((_ extract 7 0) .cse122)) (.cse123 ((_ sign_extend 24) v_subst_2083))) (and (bvsgt ((_ sign_extend 24) .cse121) .cse41) (= .cse122 .cse123) (= ~send2~0 .cse121) (not (= .cse26 .cse123)))))) .cse17 .cse109 .cse81 .cse22 .cse23 .cse58) (and .cse3 .cse63 .cse64 .cse82 .cse65 .cse66 .cse10 .cse93 .cse67 .cse11 .cse44 .cse12 .cse94 .cse46 .cse47 .cse95 .cse96 .cse49 .cse73 .cse97 .cse17 .cse83 .cse21 .cse22 .cse58) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse82 .cse9 .cse119 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse82 .cse24 .cse67 .cse124 .cse16 .cse22) (and .cse3 .cse6 .cse10 .cse11 .cse44 .cse12 .cse69 .cse125 .cse46 (exists ((v_subst_862 (_ BitVec 8))) (let ((.cse126 ((_ sign_extend 24) v_subst_862))) (and (= .cse126 .cse33) (= ~p1_old~0 ((_ extract 7 0) .cse126))))) .cse47 (exists ((v_subst_2510 (_ BitVec 8))) (let ((.cse127 ((_ sign_extend 24) v_subst_2510))) (and (= ((_ extract 7 0) .cse127) ~p2_old~0) (= .cse41 .cse127)))) .cse49 .cse103 .cse16 .cse17 (exists ((v_subst_2047 (_ BitVec 8))) (let ((.cse128 ((_ sign_extend 24) v_subst_2047))) (and (= .cse26 .cse128) (= ~p3_old~0 ((_ extract 7 0) .cse128))))) .cse55 .cse129 (exists ((v_subst_419 (_ BitVec 8)) (v_subst_418 (_ BitVec 8))) (let ((.cse131 ((_ sign_extend 24) v_subst_419)) (.cse130 ((_ sign_extend 24) v_subst_418))) (and (bvsge .cse130 (_ bv0 32)) (= .cse130 .cse131) (= ~p1_old~0 ((_ extract 7 0) .cse131)) (not (= .cse26 .cse130))))) .cse22) (and .cse3 .cse6 .cse64 .cse65 .cse10 .cse25 .cse11 .cse44 .cse68 .cse12 .cse69 .cse132 .cse34 .cse46 .cse133 .cse49 .cse35 .cse103 .cse16 .cse17 (exists ((v_subst_1084 (_ BitVec 8)) (v_subst_1085 (_ BitVec 8)) (v_subst_1083 (_ BitVec 8))) (let ((.cse135 ((_ sign_extend 24) v_subst_1085)) (.cse136 ((_ sign_extend 24) v_subst_1084)) (.cse134 ((_ sign_extend 24) v_subst_1083))) (and (bvsge .cse134 (_ bv0 32)) (= .cse134 .cse135) (= ((_ extract 7 0) .cse135) ~send3~0) (= .cse33 .cse136) (bvsgt ((_ sign_extend 24) ((_ extract 7 0) .cse136)) .cse134)))) .cse22) (and (exists ((v_subst_1945 (_ BitVec 8))) (let ((.cse137 ((_ sign_extend 24) v_subst_1945))) (and (= .cse26 .cse137) (= ((_ extract 7 0) .cse137) ~send1~0)))) .cse3 .cse63 .cse6 .cse64 .cse65 .cse120 .cse66 .cse10 .cse67 .cse11 .cse44 .cse12 .cse34 .cse46 .cse47 .cse102 (exists ((v_subst_2113 (_ BitVec 8))) (let ((.cse138 ((_ sign_extend 24) v_subst_2113))) (and (= .cse138 .cse26) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse138))))))) .cse49 .cse73 (exists ((v_~send1~0_47 (_ BitVec 8)) (v_subst_2110 (_ BitVec 8))) (let ((.cse141 ((_ sign_extend 24) v_~send1~0_47))) (let ((.cse140 ((_ sign_extend 24) v_subst_2110)) (.cse139 ((_ extract 7 0) .cse141))) (and (bvsgt ((_ sign_extend 24) .cse139) .cse41) (not (= .cse26 .cse140)) (= .cse140 .cse141) (= ~send2~0 .cse139))))) .cse103 .cse17 .cse22 .cse58) (and .cse24 .cse67 .cse124 .cse16 .cse18 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse104 .cse5 .cse6 .cse8 .cse24 .cse80 .cse10 .cse11 .cse12 .cse28 .cse125 .cse14 (exists ((v_subst_1999 (_ BitVec 8))) (let ((.cse142 ((_ sign_extend 24) v_subst_1999))) (and (bvsge .cse142 (_ bv0 32)) (= .cse143 .cse142)))) .cse17 .cse36 (not (= .cse41 .cse33)) .cse19 .cse20 .cse21 (exists ((v_subst_556 (_ BitVec 8))) (let ((.cse144 ((_ sign_extend 24) v_subst_556))) (and (= .cse144 .cse145) (bvsge .cse144 (_ bv0 32))))) .cse22 .cse23 (exists ((v_subst_2483 (_ BitVec 8))) (let ((.cse146 ((_ sign_extend 24) v_subst_2483))) (and (= .cse146 .cse145) (not (= .cse146 .cse33)))))) (and (let ((.cse147 (exists ((~send1~0 (_ BitVec 8))) (let ((.cse154 ((_ sign_extend 24) ~send1~0))) (and (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse154)))) (= .cse33 .cse154))))) (.cse149 (exists ((~send2~0 (_ BitVec 8))) (let ((.cse153 ((_ sign_extend 24) ~send2~0))) (and (= .cse153 .cse41) (= ~p1_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse153)))))))))) (.cse150 (exists ((~send1~0 (_ BitVec 8)) (v_subst_461 (_ BitVec 8))) (let ((.cse151 ((_ sign_extend 24) ~send1~0)) (.cse152 ((_ sign_extend 24) v_subst_461))) (and (= ~p2_old~0 ((_ extract 7 0) ((_ sign_extend 24) ((_ extract 7 0) .cse151)))) (bvsge .cse152 (_ bv0 32)) (= .cse152 .cse151) (not (= .cse26 .cse152))))))) (or (and .cse147 .cse3 .cse6 .cse64 .cse82 .cse65 .cse148 .cse120 .cse10 .cse149 .cse44 .cse46 .cse133 .cse49 .cse17 .cse150) (and .cse147 .cse3 .cse6 .cse64 .cse82 .cse65 .cse119 .cse148 .cse120 .cse149 .cse44 .cse46 .cse133 .cse49 .cse17 .cse150))) .cse11 .cse12 .cse47 .cse155 .cse22) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse8 .cse82 .cse119 .cse148 .cse120 .cse25 .cse11 .cse12 .cse14 (exists ((v_subst_503 (_ BitVec 8)) (~send1~0 (_ BitVec 8))) (let ((.cse157 ((_ sign_extend 24) ~send1~0)) (.cse156 ((_ sign_extend 24) v_subst_503))) (and (not (= .cse26 .cse156)) (= .cse156 .cse157) (= ((_ extract 7 0) .cse157) ~send2~0) (bvsge .cse156 (_ bv0 32))))) .cse155 (exists ((v_subst_92 (_ BitVec 8)) (~send2~0 (_ BitVec 8))) (let ((.cse159 ((_ sign_extend 24) ~send2~0)) (.cse158 ((_ sign_extend 24) v_subst_92))) (and (not (= .cse158 .cse33)) (= .cse159 .cse158) (= ((_ extract 7 0) .cse159) ~send3~0) (bvsge .cse158 (_ bv0 32))))) .cse17 .cse19 .cse22 .cse23) (and .cse2 .cse3 .cse6 .cse82 .cse38 .cse110 .cse10 .cse111 .cse43 .cse11 .cse44 .cse12 .cse112 .cse46 .cse48 .cse49 .cse50 .cse51 .cse16 .cse17 .cse113 .cse55 .cse21 .cse22 .cse114))))))) [2023-12-25 07:48:38,027 INFO L899 garLoopResultBuilder]: For program point L260-3(lines 260 274) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 169) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 289) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 224) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 166) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 71) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 64 71) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 163) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 121) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 114 121) no Hoare annotation was computed. [2023-12-25 07:48:38,028 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 70) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 285) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 160) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 120) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point $Ultimate##103(lines 214 221) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 154) no Hoare annotation was computed. [2023-12-25 07:48:38,029 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2023-12-25 07:48:38,033 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:48:38,034 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:48:38,078 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1864 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1864) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1864)[7:0])[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1863 : bv8 :: ~sign_extend~32~8(v_subst_1863) == ~sign_extend~32~8(~id2~0) && ~send3~0 == ~sign_extend~32~8(v_subst_1863)[7:0]) could not be translated [2023-12-25 07:48:38,079 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated [2023-12-25 07:48:38,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:48:38,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,080 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:48:38,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1029 : bv8, v_subst_1030 : bv8, v_subst_1031 : bv8 :: (((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1030)[7:0]), ~sign_extend~32~8(v_subst_1029)) && ~sign_extend~32~8(v_subst_1031) == ~sign_extend~32~8(v_subst_1029)) && ~bvsge~32(~sign_extend~32~8(v_subst_1029), 0bv32)) && ~sign_extend~32~8(v_subst_1031)[7:0] == ~send3~0) && ~sign_extend~32~8(v_subst_1030) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated [2023-12-25 07:48:38,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1321 : bv8, v_subst_1322 : bv8, v_subst_1320 : bv8 :: (((~sign_extend~32~8(v_subst_1322) == ~sign_extend~32~8(v_subst_1320) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1321)) && ~sign_extend~32~8(v_subst_1322)[7:0] == ~send1~0) && ~bvsge~32(~sign_extend~32~8(v_subst_1320), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1321)[7:0]), ~sign_extend~32~8(v_subst_1320))) could not be translated [2023-12-25 07:48:38,081 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ~send3~0 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) || !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1323 : bv8, v_subst_1324 : bv8, v_subst_1325 : bv8 :: (((~bvsge~32(~sign_extend~32~8(v_subst_1323), 0bv32) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1324)) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1325)[7:0])[7:0]) && ~sign_extend~32~8(v_subst_1323) == ~sign_extend~32~8(v_subst_1325)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1324)[7:0]), ~sign_extend~32~8(v_subst_1323))) could not be translated [2023-12-25 07:48:38,082 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:48:38,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1845 : bv8 :: ~sign_extend~32~8(v_subst_1845) == ~sign_extend~32~8(~id2~0) && ~p2_old~0 == ~sign_extend~32~8(v_subst_1845)[7:0]) could not be translated [2023-12-25 07:48:38,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1843 : bv8 :: ~sign_extend~32~8(v_subst_1843)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1843)) could not be translated [2023-12-25 07:48:38,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1266 : bv8, v_subst_1264 : bv8, v_subst_1265 : bv8 :: (((~sign_extend~32~8(v_subst_1266) == ~sign_extend~32~8(v_subst_1264) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1265)) && ~sign_extend~32~8(v_subst_1266)[7:0] == ~send1~0) && ~bvsge~32(~sign_extend~32~8(v_subst_1264), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1265)[7:0]), ~sign_extend~32~8(v_subst_1264))) could not be translated [2023-12-25 07:48:38,083 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall ~send3~0 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) || !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1837 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1837) && ~send3~0 == ~sign_extend~32~8(v_subst_1837)[7:0]) could not be translated [2023-12-25 07:48:38,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated [2023-12-25 07:48:38,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:48:38,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,084 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_887 : bv8 :: ~sign_extend~32~8(v_subst_887) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_887)[7:0]) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2119 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2119) && ~sign_extend~32~8(v_subst_2119)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2303 : bv8, v_subst_2302 : bv8, v_subst_2304 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2303)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2304)) && ~sign_extend~32~8(v_subst_2303) == ~sign_extend~32~8(v_subst_2302)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2303)[7:0]) could not be translated [2023-12-25 07:48:38,085 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2301 : bv8, v_subst_2300 : bv8 :: (~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2301) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2301)[7:0]), ~sign_extend~32~8(v_subst_2300))) && ~sign_extend~32~8(v_subst_2300) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1959 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_1959)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1959)) could not be translated [2023-12-25 07:48:38,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:48:38,086 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1960 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1960)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1960)) could not be translated [2023-12-25 07:48:38,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated [2023-12-25 07:48:38,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1959 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_1959)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1959)) could not be translated [2023-12-25 07:48:38,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:48:38,087 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1960 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1960)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1960)) could not be translated [2023-12-25 07:48:38,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated [2023-12-25 07:48:38,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_444 : bv8, v_subst_443 : bv8 :: ((~sign_extend~32~8(v_subst_444) == ~sign_extend~32~8(v_subst_443) && ~sign_extend~32~8(v_subst_444)[7:0] == ~send2~0) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_443))) && ~bvsge~32(~sign_extend~32~8(v_subst_443), 0bv32)) could not be translated [2023-12-25 07:48:38,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_912 : bv8 :: ~sign_extend~32~8(v_subst_912)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_912) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,088 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated [2023-12-25 07:48:38,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_913 : bv8 :: ~sign_extend~32~8(v_subst_913) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_913)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:48:38,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_872 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_872)[7:0] && ~sign_extend~32~8(v_subst_872) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,089 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2254 : bv8, v_subst_2253 : bv8 :: (~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2254) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2254)[7:0]), ~sign_extend~32~8(v_subst_2253))) && ~sign_extend~32~8(v_subst_2253) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,090 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,091 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated [2023-12-25 07:48:38,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1946 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1946) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1946)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,093 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1653 : bv8, v_subst_1654 : bv8, v_subst_1652 : bv8 :: (((~sign_extend~32~8(v_subst_1653) == ~sign_extend~32~8(v_subst_1652) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1654)[7:0]), ~sign_extend~32~8(v_subst_1652))) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654)) && ~bvsge~32(~sign_extend~32~8(v_subst_1652), 0bv32)) && ~sign_extend~32~8(v_subst_1653)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1944 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1944) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1944)[7:0]) could not be translated [2023-12-25 07:48:38,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1598 : bv8, v_subst_1596 : bv8, v_subst_1597 : bv8 :: (((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1598)[7:0]), ~sign_extend~32~8(v_subst_1596)) && ~bvsge~32(~sign_extend~32~8(v_subst_1596), 0bv32)) && ~sign_extend~32~8(v_subst_1597) == ~sign_extend~32~8(v_subst_1596)) && ~sign_extend~32~8(v_subst_1597)[7:0] == ~send2~0) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1598)) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1938 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1938) && ~send1~0 == ~sign_extend~32~8(v_subst_1938)[7:0]) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated [2023-12-25 07:48:38,095 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated [2023-12-25 07:48:38,096 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:48:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated [2023-12-25 07:48:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_445 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_445)) && ~sign_extend~32~8(v_subst_445) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_912 : bv8 :: ~sign_extend~32~8(v_subst_912)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_912) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_309 : bv8, ~send3~0 : bv8 :: ((~send1~0 == ~sign_extend~32~8(~send3~0)[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_309), 0bv32)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_309)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_309))) could not be translated [2023-12-25 07:48:38,097 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_913 : bv8 :: ~sign_extend~32~8(v_subst_913) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_913)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated [2023-12-25 07:48:38,098 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated [2023-12-25 07:48:38,099 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2083 : bv8, v_~send1~0_47 : bv8 :: ((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_47)[7:0]), ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_~send1~0_47) == ~sign_extend~32~8(v_subst_2083)) && ~send2~0 == ~sign_extend~32~8(v_~send1~0_47)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2083))) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1938 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1938) && ~send1~0 == ~sign_extend~32~8(v_subst_1938)[7:0]) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,100 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1864 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1864) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1864)[7:0])[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,101 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1863 : bv8 :: ~sign_extend~32~8(v_subst_1863) == ~sign_extend~32~8(~id2~0) && ~send3~0 == ~sign_extend~32~8(v_subst_1863)[7:0]) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,102 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,103 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,104 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated [2023-12-25 07:48:38,104 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:48:38,104 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,111 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_862 : bv8 :: ~sign_extend~32~8(v_subst_862) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_862)[7:0]) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2510 : bv8 :: ~sign_extend~32~8(v_subst_2510)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_2510)) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2047 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2047) && ~p3_old~0 == ~sign_extend~32~8(v_subst_2047)[7:0]) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_419 : bv8, v_subst_418 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_418), 0bv32) && ~sign_extend~32~8(v_subst_418) == ~sign_extend~32~8(v_subst_419)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_419)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_418))) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,112 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_887 : bv8 :: ~sign_extend~32~8(v_subst_887) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_887)[7:0]) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1084 : bv8, v_subst_1085 : bv8, v_subst_1083 : bv8 :: (((~bvsge~32(~sign_extend~32~8(v_subst_1083), 0bv32) && ~sign_extend~32~8(v_subst_1083) == ~sign_extend~32~8(v_subst_1085)) && ~sign_extend~32~8(v_subst_1085)[7:0] == ~send3~0) && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1084)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1084)[7:0]), ~sign_extend~32~8(v_subst_1083))) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1945 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1945) && ~sign_extend~32~8(v_subst_1945)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,113 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1944 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1944) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1944)[7:0]) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2113 : bv8 :: ~sign_extend~32~8(v_subst_2113) == ~sign_extend~32~8(~id3~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2113)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_~send1~0_47 : bv8, v_subst_2110 : bv8 :: ((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_47)[7:0]), ~sign_extend~32~8(~id2~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2110))) && ~sign_extend~32~8(v_subst_2110) == ~sign_extend~32~8(v_~send1~0_47)) && ~send2~0 == ~sign_extend~32~8(v_~send1~0_47)[7:0]) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,114 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated [2023-12-25 07:48:38,115 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1999 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_1999), 0bv32) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_1999)) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_556 : bv8 :: ~sign_extend~32~8(v_subst_556) == ~sign_extend~32~8(~send3~0) && ~bvsge~32(~sign_extend~32~8(v_subst_556), 0bv32)) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2483 : bv8 :: ~sign_extend~32~8(v_subst_2483) == ~sign_extend~32~8(~send3~0) && !(~sign_extend~32~8(v_subst_2483) == ~sign_extend~32~8(~id1~0))) could not be translated [2023-12-25 07:48:38,116 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8, v_subst_461 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_461), 0bv32)) && ~sign_extend~32~8(v_subst_461) == ~sign_extend~32~8(~send1~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_461))) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0)) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated [2023-12-25 07:48:38,117 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8, v_subst_461 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_461), 0bv32)) && ~sign_extend~32~8(v_subst_461) == ~sign_extend~32~8(~send1~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_461))) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated [2023-12-25 07:48:38,118 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_503 : bv8, ~send1~0 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_503)) && ~sign_extend~32~8(v_subst_503) == ~sign_extend~32~8(~send1~0)) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) && ~bvsge~32(~sign_extend~32~8(v_subst_503), 0bv32)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_92 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_92) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_92)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~bvsge~32(~sign_extend~32~8(v_subst_92), 0bv32)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated [2023-12-25 07:48:38,119 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated [2023-12-25 07:48:38,120 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated [2023-12-25 07:48:38,120 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated [2023-12-25 07:48:38,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:48:38 BoogieIcfgContainer [2023-12-25 07:48:38,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:48:38,121 INFO L158 Benchmark]: Toolchain (without parser) took 562591.60ms. Allocated memory was 362.8MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 317.7MB in the beginning and 818.5MB in the end (delta: -500.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 217.1MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.66ms. Allocated memory is still 362.8MB. Free memory was 317.7MB in the beginning and 303.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.35ms. Allocated memory is still 362.8MB. Free memory was 303.6MB in the beginning and 301.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: Boogie Preprocessor took 30.14ms. Allocated memory is still 362.8MB. Free memory was 301.5MB in the beginning and 298.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: RCFGBuilder took 361.53ms. Allocated memory is still 362.8MB. Free memory was 298.8MB in the beginning and 275.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-25 07:48:38,128 INFO L158 Benchmark]: TraceAbstraction took 561969.67ms. Allocated memory was 362.8MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 274.7MB in the beginning and 818.5MB in the end (delta: -543.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-25 07:48:38,129 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.42ms. Allocated memory is still 217.1MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.66ms. Allocated memory is still 362.8MB. Free memory was 317.7MB in the beginning and 303.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.35ms. Allocated memory is still 362.8MB. Free memory was 303.6MB in the beginning and 301.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.14ms. Allocated memory is still 362.8MB. Free memory was 301.5MB in the beginning and 298.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 361.53ms. Allocated memory is still 362.8MB. Free memory was 298.8MB in the beginning and 275.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 561969.67ms. Allocated memory was 362.8MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 274.7MB in the beginning and 818.5MB in the end (delta: -543.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1864 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1864) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1864)[7:0])[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1863 : bv8 :: ~sign_extend~32~8(v_subst_1863) == ~sign_extend~32~8(~id2~0) && ~send3~0 == ~sign_extend~32~8(v_subst_1863)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1029 : bv8, v_subst_1030 : bv8, v_subst_1031 : bv8 :: (((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1030)[7:0]), ~sign_extend~32~8(v_subst_1029)) && ~sign_extend~32~8(v_subst_1031) == ~sign_extend~32~8(v_subst_1029)) && ~bvsge~32(~sign_extend~32~8(v_subst_1029), 0bv32)) && ~sign_extend~32~8(v_subst_1031)[7:0] == ~send3~0) && ~sign_extend~32~8(v_subst_1030) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1321 : bv8, v_subst_1322 : bv8, v_subst_1320 : bv8 :: (((~sign_extend~32~8(v_subst_1322) == ~sign_extend~32~8(v_subst_1320) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1321)) && ~sign_extend~32~8(v_subst_1322)[7:0] == ~send1~0) && ~bvsge~32(~sign_extend~32~8(v_subst_1320), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1321)[7:0]), ~sign_extend~32~8(v_subst_1320))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ~send3~0 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) || !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1323 : bv8, v_subst_1324 : bv8, v_subst_1325 : bv8 :: (((~bvsge~32(~sign_extend~32~8(v_subst_1323), 0bv32) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1324)) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1325)[7:0])[7:0]) && ~sign_extend~32~8(v_subst_1323) == ~sign_extend~32~8(v_subst_1325)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1324)[7:0]), ~sign_extend~32~8(v_subst_1323))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1845 : bv8 :: ~sign_extend~32~8(v_subst_1845) == ~sign_extend~32~8(~id2~0) && ~p2_old~0 == ~sign_extend~32~8(v_subst_1845)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1843 : bv8 :: ~sign_extend~32~8(v_subst_1843)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1843)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1266 : bv8, v_subst_1264 : bv8, v_subst_1265 : bv8 :: (((~sign_extend~32~8(v_subst_1266) == ~sign_extend~32~8(v_subst_1264) && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1265)) && ~sign_extend~32~8(v_subst_1266)[7:0] == ~send1~0) && ~bvsge~32(~sign_extend~32~8(v_subst_1264), 0bv32)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1265)[7:0]), ~sign_extend~32~8(v_subst_1264))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall ~send3~0 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(~send3~0)) || !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(~send3~0)[7:0]), ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1837 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1837) && ~send3~0 == ~sign_extend~32~8(v_subst_1837)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_887 : bv8 :: ~sign_extend~32~8(v_subst_887) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_887)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2119 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2119) && ~sign_extend~32~8(v_subst_2119)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2303 : bv8, v_subst_2302 : bv8, v_subst_2304 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2303)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2304)) && ~sign_extend~32~8(v_subst_2303) == ~sign_extend~32~8(v_subst_2302)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_2303)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2301 : bv8, v_subst_2300 : bv8 :: (~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2301) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2301)[7:0]), ~sign_extend~32~8(v_subst_2300))) && ~sign_extend~32~8(v_subst_2300) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1959 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_1959)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1959)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1960 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1960)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1960)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1959 : bv8 :: ~send1~0 == ~sign_extend~32~8(v_subst_1959)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1959)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1960 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1960)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1960)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_444 : bv8, v_subst_443 : bv8 :: ((~sign_extend~32~8(v_subst_444) == ~sign_extend~32~8(v_subst_443) && ~sign_extend~32~8(v_subst_444)[7:0] == ~send2~0) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_443))) && ~bvsge~32(~sign_extend~32~8(v_subst_443), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_912 : bv8 :: ~sign_extend~32~8(v_subst_912)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_912) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_29 : bv8 :: ~sign_extend~32~8(v_subst_29) == ~sign_extend~32~8(~send1~0) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_29))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_913 : bv8 :: ~sign_extend~32~8(v_subst_913) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_913)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_872 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_872)[7:0] && ~sign_extend~32~8(v_subst_872) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2254 : bv8, v_subst_2253 : bv8 :: (~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2254) && !~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_2254)[7:0]), ~sign_extend~32~8(v_subst_2253))) && ~sign_extend~32~8(v_subst_2253) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1946 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1946) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1946)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1653 : bv8, v_subst_1654 : bv8, v_subst_1652 : bv8 :: (((~sign_extend~32~8(v_subst_1653) == ~sign_extend~32~8(v_subst_1652) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1654)[7:0]), ~sign_extend~32~8(v_subst_1652))) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1654)) && ~bvsge~32(~sign_extend~32~8(v_subst_1652), 0bv32)) && ~sign_extend~32~8(v_subst_1653)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1944 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1944) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1944)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1598 : bv8, v_subst_1596 : bv8, v_subst_1597 : bv8 :: (((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1598)[7:0]), ~sign_extend~32~8(v_subst_1596)) && ~bvsge~32(~sign_extend~32~8(v_subst_1596), 0bv32)) && ~sign_extend~32~8(v_subst_1597) == ~sign_extend~32~8(v_subst_1596)) && ~sign_extend~32~8(v_subst_1597)[7:0] == ~send2~0) && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1598)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1938 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1938) && ~send1~0 == ~sign_extend~32~8(v_subst_1938)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_445 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_445)) && ~sign_extend~32~8(v_subst_445) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_912 : bv8 :: ~sign_extend~32~8(v_subst_912)[7:0] == ~send2~0 && ~sign_extend~32~8(v_subst_912) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_309 : bv8, ~send3~0 : bv8 :: ((~send1~0 == ~sign_extend~32~8(~send3~0)[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_309), 0bv32)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_309)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_309))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_913 : bv8 :: ~sign_extend~32~8(v_subst_913) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_913)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_2)) && ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_2)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_246 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_246), 0bv32) && ~sign_extend~32~8(v_subst_246) == ~sign_extend~32~8(~send3~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_312 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_312) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_312))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2083 : bv8, v_~send1~0_47 : bv8 :: ((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_47)[7:0]), ~sign_extend~32~8(~id2~0)) && ~sign_extend~32~8(v_~send1~0_47) == ~sign_extend~32~8(v_subst_2083)) && ~send2~0 == ~sign_extend~32~8(v_~send1~0_47)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2083))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1938 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1938) && ~send1~0 == ~sign_extend~32~8(v_subst_1938)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_310 : bv8, v_subst_311 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_310), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_310))) && ~sign_extend~32~8(v_subst_311)[7:0] == ~send1~0) && ~sign_extend~32~8(v_subst_310) == ~sign_extend~32~8(v_subst_311)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1974 : bv8 :: ~p3_old~0 == ~sign_extend~32~8(v_subst_1974)[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1974)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1976 : bv8 :: ~sign_extend~32~8(v_subst_1976)[7:0] == ~send1~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1976)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1973 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_1973)[7:0])[7:0] == ~send2~0 && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1973)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1975 : bv8 :: ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1975)[7:0])[7:0] && ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1975)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1977 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1977) && ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1977)[7:0])[7:0])[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1864 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1864) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1864)[7:0])[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_94 : bv8, v_subst_93 : bv8 :: ((~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(v_subst_94) && ~bvsge~32(~sign_extend~32~8(v_subst_93), 0bv32)) && ~send3~0 == ~sign_extend~32~8(v_subst_94)[7:0]) && !(~sign_extend~32~8(v_subst_93) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1863 : bv8 :: ~sign_extend~32~8(v_subst_1863) == ~sign_extend~32~8(~id2~0) && ~send3~0 == ~sign_extend~32~8(v_subst_1863)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_95 : bv8 :: !(~sign_extend~32~8(v_subst_95) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_95)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_862 : bv8 :: ~sign_extend~32~8(v_subst_862) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_862)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2510 : bv8 :: ~sign_extend~32~8(v_subst_2510)[7:0] == ~p2_old~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_2510)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2047 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2047) && ~p3_old~0 == ~sign_extend~32~8(v_subst_2047)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_419 : bv8, v_subst_418 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_418), 0bv32) && ~sign_extend~32~8(v_subst_418) == ~sign_extend~32~8(v_subst_419)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_419)[7:0]) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_418))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_887 : bv8 :: ~sign_extend~32~8(v_subst_887) == ~sign_extend~32~8(~id1~0) && ~p1_old~0 == ~sign_extend~32~8(v_subst_887)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1084 : bv8, v_subst_1085 : bv8, v_subst_1083 : bv8 :: (((~bvsge~32(~sign_extend~32~8(v_subst_1083), 0bv32) && ~sign_extend~32~8(v_subst_1083) == ~sign_extend~32~8(v_subst_1085)) && ~sign_extend~32~8(v_subst_1085)[7:0] == ~send3~0) && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_1084)) && ~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_subst_1084)[7:0]), ~sign_extend~32~8(v_subst_1083))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1945 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1945) && ~sign_extend~32~8(v_subst_1945)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_329 : bv8, v_subst_330 : bv8 :: ((~sign_extend~32~8(v_subst_330) == ~sign_extend~32~8(v_subst_329) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_330)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_329), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_329))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_334 : bv8, v_subst_333 : bv8 :: ((~sign_extend~32~8(v_subst_333) == ~sign_extend~32~8(v_subst_334) && ~bvsge~32(~sign_extend~32~8(v_subst_333), 0bv32)) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_333))) && ~sign_extend~32~8(v_subst_334)[7:0] == ~send1~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1944 : bv8 :: ~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_1944) && ~p3_old~0 == ~sign_extend~32~8(v_subst_1944)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2113 : bv8 :: ~sign_extend~32~8(v_subst_2113) == ~sign_extend~32~8(~id3~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_2113)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_335 : bv8 :: ~sign_extend~32~8(~send3~0) == ~sign_extend~32~8(v_subst_335) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_335))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_~send1~0_47 : bv8, v_subst_2110 : bv8 :: ((~bvsgt~32(~sign_extend~32~8(~sign_extend~32~8(v_~send1~0_47)[7:0]), ~sign_extend~32~8(~id2~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_2110))) && ~sign_extend~32~8(v_subst_2110) == ~sign_extend~32~8(v_~send1~0_47)) && ~send2~0 == ~sign_extend~32~8(v_~send1~0_47)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_936 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_936)[7:0])[7:0])[7:0] == ~p3_old~0 && ~sign_extend~32~8(v_subst_936) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_937 : bv8 :: ~send2~0 == ~sign_extend~32~8(v_subst_937)[7:0] && ~sign_extend~32~8(v_subst_937) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_229 : bv8, v_subst_230 : bv8 :: (~sign_extend~32~8(v_subst_230) == ~sign_extend~32~8(v_subst_229) && ~bvsge~32(~sign_extend~32~8(v_subst_229), 0bv32)) && ~sign_extend~32~8(v_subst_230)[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_938 : bv8 :: ~sign_extend~32~8(v_subst_938) == ~sign_extend~32~8(~id1~0) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_938)[7:0])[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_935 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_935) && ~p1_old~0 == ~sign_extend~32~8(v_subst_935)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_33 : bv8, v_subst_34 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_33), 0bv32) && !(~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_33))) && ~sign_extend~32~8(v_subst_33) == ~sign_extend~32~8(v_subst_34)) && ~p1_old~0 == ~sign_extend~32~8(v_subst_34)[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_939 : bv8 :: ~sign_extend~32~8(~sign_extend~32~8(v_subst_939)[7:0])[7:0] == ~p2_old~0 && ~sign_extend~32~8(v_subst_939) == ~sign_extend~32~8(~id1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_466 : bv8 :: !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_466)) && ~sign_extend~32~8(v_subst_466) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1999 : bv8 :: ~bvsge~32(~sign_extend~32~8(v_subst_1999), 0bv32) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_1999)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_50 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_50) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_50))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_556 : bv8 :: ~sign_extend~32~8(v_subst_556) == ~sign_extend~32~8(~send3~0) && ~bvsge~32(~sign_extend~32~8(v_subst_556), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2483 : bv8 :: ~sign_extend~32~8(v_subst_2483) == ~sign_extend~32~8(~send3~0) && !(~sign_extend~32~8(v_subst_2483) == ~sign_extend~32~8(~id1~0))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8, v_subst_461 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_461), 0bv32)) && ~sign_extend~32~8(v_subst_461) == ~sign_extend~32~8(~send1~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_461))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_111 : bv8, ~send2~0 : bv8 :: ((~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_111) && ~bvsge~32(~sign_extend~32~8(v_subst_111), 0bv32)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_111))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_110 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_110) == ~sign_extend~32~8(~id1~0)) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) && ~bvsge~32(~sign_extend~32~8(v_subst_110), 0bv32)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_110)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8, v_subst_461 : bv8 :: ((~p2_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~send1~0)[7:0])[7:0] && ~bvsge~32(~sign_extend~32~8(v_subst_461), 0bv32)) && ~sign_extend~32~8(v_subst_461) == ~sign_extend~32~8(~send1~0)) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_461))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(~send2~0)[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send1~0 : bv8 :: ~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(~send1~0) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ~send2~0 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(~id2~0) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_503 : bv8, ~send1~0 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_503)) && ~sign_extend~32~8(v_subst_503) == ~sign_extend~32~8(~send1~0)) && ~sign_extend~32~8(~send1~0)[7:0] == ~send2~0) && ~bvsge~32(~sign_extend~32~8(v_subst_503), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_92 : bv8, ~send2~0 : bv8 :: ((!(~sign_extend~32~8(v_subst_92) == ~sign_extend~32~8(~id1~0)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_92)) && ~sign_extend~32~8(~send2~0)[7:0] == ~send3~0) && ~bvsge~32(~sign_extend~32~8(v_subst_92), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_117 : bv8, v_subst_116 : bv8 :: ((~p3_old~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_117)[7:0])[7:0] && !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_116))) && ~sign_extend~32~8(v_subst_117) == ~sign_extend~32~8(v_subst_116)) && ~bvsge~32(~sign_extend~32~8(v_subst_116), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1878 : bv8 :: ~p2_old~0 == ~sign_extend~32~8(v_subst_1878)[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1878)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1879 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1879) && ~p1_old~0 == ~sign_extend~32~8(~sign_extend~32~8(~sign_extend~32~8(v_subst_1879)[7:0])[7:0])[7:0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_115 : bv8, v_subst_114 : bv8 :: ((!(~sign_extend~32~8(v_subst_114) == ~sign_extend~32~8(~id1~0)) && ~send3~0 == ~sign_extend~32~8(v_subst_115)[7:0]) && ~sign_extend~32~8(v_subst_115) == ~sign_extend~32~8(v_subst_114)) && ~bvsge~32(~sign_extend~32~8(v_subst_114), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1877 : bv8 :: ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1877) && ~sign_extend~32~8(~sign_extend~32~8(v_subst_1877)[7:0])[7:0] == ~p3_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_112 : bv8, v_subst_113 : bv8 :: ((~bvsge~32(~sign_extend~32~8(v_subst_112), 0bv32) && ~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(v_subst_113)) && !(~sign_extend~32~8(v_subst_112) == ~sign_extend~32~8(~id1~0))) && ~sign_extend~32~8(v_subst_113)[7:0] == ~p2_old~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_56 : bv8 :: ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_56) && !(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_56))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_118 : bv8 :: !(~sign_extend~32~8(~id1~0) == ~sign_extend~32~8(v_subst_118)) && ~sign_extend~32~8(~send2~0) == ~sign_extend~32~8(v_subst_118)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1881 : bv8 :: ~sign_extend~32~8(v_subst_1881)[7:0] == ~send3~0 && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1881)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_55 : bv8, v_subst_54 : bv8 :: ((!(~sign_extend~32~8(~id3~0) == ~sign_extend~32~8(v_subst_54)) && ~p2_old~0 == ~sign_extend~32~8(v_subst_55)[7:0]) && ~sign_extend~32~8(v_subst_54) == ~sign_extend~32~8(v_subst_55)) && ~bvsge~32(~sign_extend~32~8(v_subst_54), 0bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1880 : bv8 :: ~send1~0 == ~sign_extend~32~8(~sign_extend~32~8(v_subst_1880)[7:0])[7:0] && ~sign_extend~32~8(~id2~0) == ~sign_extend~32~8(v_subst_1880)) could not be translated * 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: 285]: 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 1 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 561.8s, OverallIterations: 39, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 235.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 259.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23156 SdHoareTripleChecker+Valid, 40.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23156 mSDsluCounter, 38324 SdHoareTripleChecker+Invalid, 37.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34504 mSDsCounter, 1117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32183 IncrementalHoareTripleChecker+Invalid, 33300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1117 mSolverCounterUnsat, 3820 mSDtfsCounter, 32183 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8164 GetRequests, 5996 SyntacticMatches, 0 SemanticMatches, 2168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94864 ImplicationChecksByTransitivity, 204.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24962occurred in iteration=28, InterpolantAutomatonStates: 1660, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 22438 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 170 NumberOfFragments, 6168 HoareAnnotationTreeSize, 1 FormulaSimplifications, 651050 FormulaSimplificationTreeSizeReduction, 196.7s HoareSimplificationTime, 1 FormulaSimplificationsInter, 741558 FormulaSimplificationTreeSizeReductionInter, 63.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 48.2s InterpolantComputationTime, 3776 NumberOfCodeBlocks, 3592 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6689 ConstructedInterpolants, 1687 QuantifiedInterpolants, 95927 SizeOfPredicates, 224 NumberOfNonLiveVariables, 7208 ConjunctsInSsa, 470 ConjunctsInUnsatCore, 64 InterpolantComputations, 14 PerfectInterpolantSequences, 4945/9345 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (!(((p3_old & 127) > id2)) || !((p2_old > id3)))) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (id3 >= 0)) && (st1 == 0)) && (r1 == 2)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (id1 == send1)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && ((id3 == p2_old) || !(((p1_old & 127) > id3)))) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && !((p3_old > id1))) && ((send1 & 127) == send2)) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && (((send1 & 127) & 127) > id3)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((((send2 == id2) && (((p1_new + 1) % 256) == 0)) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && !((p3_old > id1))) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (p1_old == (send1 & 127))) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send1 & 127) == send2)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (st1 == 0)) && (r1 == 2)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && !(((p2_old & 127) > id1))) && (r1 >= 3)) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (1 == st3)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id1 == send1)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (id3 >= 0)) && (st1 == 0)) && !((p2_old > id3))) && (r1 == 2)) && !((((p1_old & 127) & 127) > id1))) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && (1 == r1)) && !((p3_old > id1))) && ((send1 & 127) == send2)) && (st1 == 0)) && !((p2_old > id3))) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && (st1 == 0)) && (r1 == 2)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (r1 >= 3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((send2 == id2) && (((p1_new + 1) % 256) == 0)) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (p1_old == (send1 & 127))) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send2 & 127) == p2_old)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || ((((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (((((send2 & 127) > id3) || !(((p3_old & 127) > id2))) || (id3 == (send2 & 127))) || (p1_old == id2))) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (send1 == (send3 & 127))) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && !((p3_old > id1))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || ((((((((((((((send2 == id2) && (((p1_new + 1) % 256) == 0)) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (id3 >= 0)) && (st1 == 0)) && (r1 == 2)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (r1 >= 3)) && (id1 == send1)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (id3 >= 0)) && !((p2_old > id3))) && !((((p1_old & 127) & 127) > id1))) && (((1 + nomsg) % 256) == 0)) && (1 == st1)) && !((p1_old > id2)))) || ((((((((((((((send2 == id2) && (((p1_new + 1) % 256) == 0)) && (st3 == 0)) && (r1 >= 3)) && (1 == st2)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id3 == send3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && !((p3_old > id1))) && (st1 == 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2))) && ((send3 & 127) > id1))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (r1 >= 3)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && (st1 == 0)) && (1 == st3)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || (((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (r1 >= 3)) && (!(((p3_old & 127) > id2)) || !((p2_old > id3)))) && (1 == st2)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && (id3 >= 0)) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((r1 >= 3) && (id1 == send1)) && (id2 >= 0)) && ((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (st1 == 0)) || (((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (1 == st1)))) && (id3 >= 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (p1_old == (send1 & 127))) && (r1 == 0)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || ((((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (p1_old == (send1 & 127))) && ((p1_old & 127) > id3)) && (1 == r1)) && (1 == mode1)) && (1 == mode2)) && ((send1 & 127) == send2)) && ((send2 & 127) == p2_old)) && (id3 >= 0)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (id2 >= 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == r1)) && (1 == mode1)) && (p3_old == (send3 & 127))) && (1 == mode2)) && ((send2 & 127) == p2_old)) && (st1 == 0)) && (((1 + nomsg) % 256) == 0)) && ((send3 & 127) > id1))) || ((((((id1 == send1) && (id2 >= 0)) && ((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (st1 == 0)) || (((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (1 == st1)))) && (id3 >= 0)) && (r1 == 2)) && (((1 + nomsg) % 256) == 0))) || (((((((((((((((((((((((mode3 == 0) && (0 == mode1)) && (send2 == id2)) && (((p1_new + 1) % 256) == 0)) && (((((send2 & 127) > id3) || !(((p3_old & 127) > id2))) || (id3 == (send2 & 127))) || (p1_old == id2))) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (id1 == send1)) && (id3 == send3)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !(((p1_old & 127) > id3))) && (r1 == 0)) && !((p3_old > id1))) && (st1 == 0)) && !((p2_old > id3))) && !((id2 == id1))) && !((((p1_old & 127) & 127) > id1))) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (r1 >= 3)) && (st2 == 0)) && (1 == mode3)) && (1 == mode1)) && (1 == mode2)) && (st1 == 0)) || ((((((((((p1_new + 1) % 256) == 0) && (st3 == 0)) && (r1 >= 3)) && (1 == st2)) && (1 == mode3)) && (1 == mode1)) && (1 == mode2)) && (st1 == 0))) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && (p3_old == (send3 & 127))) && !(((send2 & 127) > id3))) && (((1 + nomsg) % 256) == 0))) || ((((((((((((((((mode3 == 0) && (0 == mode1)) && (((p1_new + 1) % 256) == 0)) && (mode2 == 0)) && (st3 == 0)) && !(((p2_old & 127) > id1))) && (r1 >= 3)) && (1 == st2)) && (((1 + p3_new) % 256) == 0)) && (((1 + p2_new) % 256) == 0)) && !((p3_old > id1))) && !(((send2 & 127) > id3))) && (st1 == 0)) && !((((p1_old & 127) & 127) > id1))) && (((1 + nomsg) % 256) == 0)) && !((p1_old > id2)))) || ((((((((((((((send2 == id2) && (((p1_new + 1) % 256) == 0)) && (st3 == 0)) && (r1 >= 3)) && (st2 == 0)) && (((1 + p3_new) % 256) == 0)) && (1 == mode3)) && (((1 + p2_new) % 256) == 0)) && (1 == mode1)) && (1 == mode2)) && (id3 >= 0)) && (st1 == 0)) && (id1 >= 0)) && (((1 + nomsg) % 256) == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-25 07:48:38,338 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 07:48:38,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...