/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/hardness-nfm22/hardness_operatoramount_amount25_file-89.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 09:04:12,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 09:04:12,072 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-24 09:04:12,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 09:04:12,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 09:04:12,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 09:04:12,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 09:04:12,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 09:04:12,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 09:04:12,090 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 09:04:12,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 09:04:12,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 09:04:12,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 09:04:12,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 09:04:12,091 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 09:04:12,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 09:04:12,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 09:04:12,092 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 09:04:12,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 09:04:12,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 09:04:12,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 09:04:12,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 09:04:12,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 09:04:12,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 09:04:12,094 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 09:04:12,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 09:04:12,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 09:04:12,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 09:04:12,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 09:04:12,095 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 09:04:12,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 09:04:12,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 09:04:12,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 09:04:12,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 09:04:12,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:04:12,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 09:04:12,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 09:04:12,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 09:04:12,096 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 09:04:12,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 09:04:12,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 09:04:12,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 09:04:12,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 09:04:12,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 09:04:12,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 09:04:12,106 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 09:04:12,106 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-24 09:04:12,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 09:04:12,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 09:04:12,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 09:04:12,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 09:04:12,327 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 09:04:12,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-12-24 09:04:13,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 09:04:13,492 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 09:04:13,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-89.i [2023-12-24 09:04:13,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c917dd7f3/64f809fa8959410da39f73a224248391/FLAGe42091d61 [2023-12-24 09:04:13,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c917dd7f3/64f809fa8959410da39f73a224248391 [2023-12-24 09:04:13,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 09:04:13,512 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 09:04:13,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 09:04:13,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 09:04:13,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 09:04:13,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597d1ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13, skipping insertion in model container [2023-12-24 09:04:13,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 09:04:13,671 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-12-24 09:04:13,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:04:13,741 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 09:04:13,749 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-89.i[915,928] [2023-12-24 09:04:13,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 09:04:13,772 INFO L206 MainTranslator]: Completed translation [2023-12-24 09:04:13,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13 WrapperNode [2023-12-24 09:04:13,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 09:04:13,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 09:04:13,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 09:04:13,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 09:04:13,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,801 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-12-24 09:04:13,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 09:04:13,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 09:04:13,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 09:04:13,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 09:04:13,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,830 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-24 09:04:13,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 09:04:13,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 09:04:13,844 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 09:04:13,844 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 09:04:13,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (1/1) ... [2023-12-24 09:04:13,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 09:04:13,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 09:04:13,876 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-24 09:04:13,882 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-24 09:04:13,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 09:04:13,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 09:04:13,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 09:04:13,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 09:04:13,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 09:04:13,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 09:04:13,980 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 09:04:13,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 09:04:14,493 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 09:04:14,524 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 09:04:14,524 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 09:04:14,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:04:14 BoogieIcfgContainer [2023-12-24 09:04:14,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 09:04:14,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 09:04:14,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 09:04:14,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 09:04:14,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:04:13" (1/3) ... [2023-12-24 09:04:14,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:04:14, skipping insertion in model container [2023-12-24 09:04:14,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:04:13" (2/3) ... [2023-12-24 09:04:14,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:04:14, skipping insertion in model container [2023-12-24 09:04:14,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:04:14" (3/3) ... [2023-12-24 09:04:14,530 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-89.i [2023-12-24 09:04:14,545 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 09:04:14,545 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 09:04:14,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 09:04:14,588 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;@33545915, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 09:04:14,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 09:04:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 09:04:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 09:04:14,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:14,601 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:14,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:14,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -307185012, now seen corresponding path program 1 times [2023-12-24 09:04:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57557266] [2023-12-24 09:04:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:14,616 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-24 09:04:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:14,617 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-24 09:04:14,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 (2)] Waiting until timeout for monitored process [2023-12-24 09:04:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:14,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 09:04:14,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2023-12-24 09:04:14,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 09:04:14,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:04:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57557266] [2023-12-24 09:04:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57557266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 09:04:14,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 09:04:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 09:04:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536209945] [2023-12-24 09:04:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:04:14,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 09:04:14,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:04:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 09:04:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 09:04:14,939 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 09:04:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:04:15,216 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-12-24 09:04:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 09:04:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2023-12-24 09:04:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:04:15,236 INFO L225 Difference]: With dead ends: 93 [2023-12-24 09:04:15,236 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 09:04:15,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-24 09:04:15,241 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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.2s IncrementalHoareTripleChecker+Time [2023-12-24 09:04:15,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 09:04:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 09:04:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-24 09:04:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 09:04:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-24 09:04:15,281 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2023-12-24 09:04:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:04:15,282 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-24 09:04:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-24 09:04:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-24 09:04:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 09:04:15,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:15,285 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:15,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 09:04:15,493 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-24 09:04:15,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:15,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1475096890, now seen corresponding path program 1 times [2023-12-24 09:04:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113642735] [2023-12-24 09:04:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:15,496 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-24 09:04:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:15,497 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-24 09:04:15,498 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-24 09:04:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:15,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 09:04:15,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:04:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-24 09:04:16,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 09:04:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-24 09:04:16,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:04:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113642735] [2023-12-24 09:04:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113642735] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 09:04:16,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 09:04:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-24 09:04:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457643237] [2023-12-24 09:04:16,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 09:04:16,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 09:04:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:04:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 09:04:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 09:04:16,241 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-24 09:04:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:04:17,115 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2023-12-24 09:04:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 09:04:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 116 [2023-12-24 09:04:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:04:17,130 INFO L225 Difference]: With dead ends: 101 [2023-12-24 09:04:17,130 INFO L226 Difference]: Without dead ends: 56 [2023-12-24 09:04:17,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-12-24 09:04:17,132 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 09:04:17,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 169 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 09:04:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-24 09:04:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-24 09:04:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 09:04:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2023-12-24 09:04:17,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2023-12-24 09:04:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:04:17,144 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2023-12-24 09:04:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-12-24 09:04:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2023-12-24 09:04:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 09:04:17,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:04:17,146 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:04:17,156 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 (3)] Ended with exit code 0 [2023-12-24 09:04:17,356 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-24 09:04:17,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:04:17,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:04:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1475156472, now seen corresponding path program 1 times [2023-12-24 09:04:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:04:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822997516] [2023-12-24 09:04:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:04:17,359 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-24 09:04:17,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:04:17,360 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-24 09:04:17,361 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-24 09:04:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:04:17,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 09:04:17,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:05:17,306 WARN L293 SmtUtils]: Spent 19.23s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 09:06:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 09:06:25,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 09:06:25,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:06:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822997516] [2023-12-24 09:06:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822997516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 09:06:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 09:06:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-24 09:06:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921102043] [2023-12-24 09:06:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:06:25,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 09:06:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:06:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 09:06:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-24 09:06:25,401 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 09:06:32,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:06:55,466 WARN L293 SmtUtils]: Spent 20.52s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 09:06:57,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:06:59,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:07:02,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:07:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:07:02,780 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2023-12-24 09:07:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 09:07:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-24 09:07:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:07:02,826 INFO L225 Difference]: With dead ends: 83 [2023-12-24 09:07:02,826 INFO L226 Difference]: Without dead ends: 81 [2023-12-24 09:07:02,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-24 09:07:02,827 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-12-24 09:07:02,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-12-24 09:07:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-24 09:07:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2023-12-24 09:07:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-24 09:07:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2023-12-24 09:07:02,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 116 [2023-12-24 09:07:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:07:02,841 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2023-12-24 09:07:02,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 09:07:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2023-12-24 09:07:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-24 09:07:02,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 09:07:02,843 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:07:02,852 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-24 09:07:03,043 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-24 09:07:03,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 09:07:03,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 09:07:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2010464198, now seen corresponding path program 1 times [2023-12-24 09:07:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 09:07:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869015664] [2023-12-24 09:07:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 09:07:03,045 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-24 09:07:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 09:07:03,046 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-24 09:07:03,049 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-24 09:07:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 09:07:03,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 09:07:03,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 09:08:05,452 WARN L293 SmtUtils]: Spent 18.98s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 09:08:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 09:08:59,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 09:08:59,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 09:08:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869015664] [2023-12-24 09:08:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869015664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 09:08:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 09:08:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-24 09:08:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334983557] [2023-12-24 09:08:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 09:08:59,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 09:08:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 09:08:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 09:08:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-24 09:08:59,895 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 09:09:14,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:09:38,570 WARN L293 SmtUtils]: Spent 22.95s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 09:09:40,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:09:42,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:09:43,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 09:09:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 09:09:44,236 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2023-12-24 09:09:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 09:09:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2023-12-24 09:09:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 09:09:44,256 INFO L225 Difference]: With dead ends: 80 [2023-12-24 09:09:44,256 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 09:09:44,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2023-12-24 09:09:44,257 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-12-24 09:09:44,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 175 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2023-12-24 09:09:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 09:09:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 09:09:44,258 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-24 09:09:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 09:09:44,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2023-12-24 09:09:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 09:09:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 09:09:44,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 4 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-12-24 09:09:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 09:09:44,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 09:09:44,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 09:09:44,267 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-24 09:09:44,467 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-24 09:09:44,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 09:09:51,776 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 110 DAG size of output: 56 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 09:09:56,161 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,162 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,162 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,162 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,163 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse4 ((_ zero_extend 24) ~var_1_6~0))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 55 86) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse2))) (and (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1))) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse2)))))) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 09:09:56,163 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,163 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,164 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 09:09:56,164 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,164 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,164 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 45 49) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,165 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge ((_ zero_extend 24) ~var_1_6~0) (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-12-24 09:09:56,165 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ zero_extend 24) ~var_1_6~0))) (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_12~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_12~0 .cse2)))) (bvsle .cse3 (_ bv1 32)) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse2) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))))) (bvsge .cse3 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,165 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 09:09:56,166 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_6~0))) (and (bvsle .cse0 (_ bv1 32)) (bvsge .cse0 (_ bv1 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 09:09:56,166 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-12-24 09:09:56,166 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 09:09:56,166 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 09:09:56,166 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 54) no Hoare annotation was computed. [2023-12-24 09:09:56,166 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,166 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,166 INFO L895 garLoopResultBuilder]: At program point L96-2(lines 96 102) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,166 INFO L899 garLoopResultBuilder]: For program point L96-3(lines 96 102) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,167 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse4 ((_ zero_extend 24) ~var_1_6~0)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6)))) (and (or (and (fp.leq ~var_1_13~0 .cse0) (fp.geq ~var_1_13~0 .cse1)) (and (fp.leq ~var_1_13~0 .cse2) (fp.geq ~var_1_13~0 .cse3))) (or (and (fp.leq ~var_1_12~0 .cse0) (fp.geq ~var_1_12~0 .cse1)) (and (fp.leq ~var_1_12~0 .cse2) (fp.geq ~var_1_12~0 .cse3))) (bvsle .cse4 (_ bv1 32)) (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_10~0 .cse3) (fp.leq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5)))))) (bvsge .cse4 (_ bv1 32)) (or (and (fp.geq ~var_1_14~0 .cse3) (fp.leq ~var_1_14~0 .cse2)) (and (fp.leq ~var_1_14~0 .cse0) (fp.geq ~var_1_14~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 09:09:56,167 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 09:09:56,170 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-24 09:09:56,171 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 09:09:56,187 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 09:09:56,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:09:56 BoogieIcfgContainer [2023-12-24 09:09:56,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 09:09:56,190 INFO L158 Benchmark]: Toolchain (without parser) took 342677.12ms. Allocated memory was 291.5MB in the beginning and 700.4MB in the end (delta: 408.9MB). Free memory was 245.8MB in the beginning and 360.8MB in the end (delta: -115.0MB). Peak memory consumption was 294.9MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,190 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 179.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 09:09:56,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 291.5MB. Free memory was 245.4MB in the beginning and 232.1MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.19ms. Allocated memory is still 291.5MB. Free memory was 232.1MB in the beginning and 230.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,190 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 291.5MB. Free memory was 230.1MB in the beginning and 227.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,191 INFO L158 Benchmark]: RCFGBuilder took 680.94ms. Allocated memory is still 291.5MB. Free memory was 227.5MB in the beginning and 210.2MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,191 INFO L158 Benchmark]: TraceAbstraction took 341663.10ms. Allocated memory was 291.5MB in the beginning and 700.4MB in the end (delta: 408.9MB). Free memory was 209.7MB in the beginning and 360.8MB in the end (delta: -151.1MB). Peak memory consumption was 259.3MB. Max. memory is 8.0GB. [2023-12-24 09:09:56,192 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.44ms. Allocated memory is still 179.3MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.78ms. Allocated memory is still 291.5MB. Free memory was 245.4MB in the beginning and 232.1MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.19ms. Allocated memory is still 291.5MB. Free memory was 232.1MB in the beginning and 230.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 291.5MB. Free memory was 230.1MB in the beginning and 227.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 680.94ms. Allocated memory is still 291.5MB. Free memory was 227.5MB in the beginning and 210.2MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 341663.10ms. Allocated memory was 291.5MB in the beginning and 700.4MB in the end (delta: 408.9MB). Free memory was 209.7MB in the beginning and 360.8MB in the end (delta: -151.1MB). Peak memory consumption was 259.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven 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: 19]: 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 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 341.6s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 83.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 33.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 31.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 104.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 77 PreInvPairs, 98 NumberOfFragments, 2539 HoareAnnotationTreeSize, 77 FormulaSimplifications, 4937 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FormulaSimplificationsInter, 2901 FormulaSimplificationTreeSizeReductionInter, 11.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 245.1s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 6384 SizeOfPredicates, 47 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3345/3420 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: 96]: Loop Invariant Derived loop invariant: ((var_1_6 <= 1) && (var_1_6 >= 1)) RESULT: Ultimate proved your program to be correct! [2023-12-24 09:09:56,409 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-24 09:09:56,442 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...