/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_amount10_file-46.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:15:32,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:15:32,487 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 06:15:32,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:15:32,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:15:32,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:15:32,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:15:32,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:15:32,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:15:32,516 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:15:32,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:15:32,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:15:32,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:15:32,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:15:32,518 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:15:32,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:15:32,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:15:32,518 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:15:32,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:15:32,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:15:32,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:15:32,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:15:32,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:15:32,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:15:32,523 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:15:32,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:15:32,523 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:15:32,523 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:15:32,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:15:32,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:15:32,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:15:32,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:15:32,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:15:32,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:15:32,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:15:32,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:15:32,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:15:32,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:15:32,525 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:15:32,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:15:32,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:15:32,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:15:32,527 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:15:32,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:15:32,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:15:32,527 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:15:32,527 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 06:15:32,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:15:32,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:15:32,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:15:32,714 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:15:32,723 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:15:32,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-12-24 06:15:33,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:15:33,888 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:15:33,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2023-12-24 06:15:33,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e147aa5c/257469d3d81846cb88ad4f9224744ecf/FLAGe45c377b1 [2023-12-24 06:15:33,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e147aa5c/257469d3d81846cb88ad4f9224744ecf [2023-12-24 06:15:33,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:15:33,916 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:15:33,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:15:33,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:15:33,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:15:33,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:15:33" (1/1) ... [2023-12-24 06:15:33,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764362c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:33, skipping insertion in model container [2023-12-24 06:15:33,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:15:33" (1/1) ... [2023-12-24 06:15:33,945 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:15:34,068 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_amount10_file-46.i[915,928] [2023-12-24 06:15:34,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:15:34,103 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:15:34,111 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_amount10_file-46.i[915,928] [2023-12-24 06:15:34,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:15:34,148 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:15:34,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34 WrapperNode [2023-12-24 06:15:34,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:15:34,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:15:34,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:15:34,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:15:34,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,180 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-12-24 06:15:34,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:15:34,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:15:34,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:15:34,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:15:34,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,213 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 06:15:34,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:15:34,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:15:34,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:15:34,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:15:34,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (1/1) ... [2023-12-24 06:15:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:15:34,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:15:34,273 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 06:15:34,290 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 06:15:34,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:15:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:15:34,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:15:34,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:15:34,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:15:34,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:15:34,380 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:15:34,382 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:15:34,758 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:15:34,843 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:15:34,844 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:15:34,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:15:34 BoogieIcfgContainer [2023-12-24 06:15:34,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:15:34,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:15:34,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:15:34,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:15:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:15:33" (1/3) ... [2023-12-24 06:15:34,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53418056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:15:34, skipping insertion in model container [2023-12-24 06:15:34,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:15:34" (2/3) ... [2023-12-24 06:15:34,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53418056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:15:34, skipping insertion in model container [2023-12-24 06:15:34,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:15:34" (3/3) ... [2023-12-24 06:15:34,849 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2023-12-24 06:15:34,864 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:15:34,864 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:15:34,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:15:34,901 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;@26c86153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:15:34,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:15:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 06:15:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 06:15:34,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:15:34,912 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:34,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:15:34,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:15:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1848409247, now seen corresponding path program 1 times [2023-12-24 06:15:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:15:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638959926] [2023-12-24 06:15:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:15:34,928 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 06:15:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:15:34,930 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 06:15:34,932 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 06:15:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:15:35,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:15:35,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:15:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2023-12-24 06:15:35,122 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:15:35,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:15:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638959926] [2023-12-24 06:15:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638959926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:15:35,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:15:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:15:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618987992] [2023-12-24 06:15:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:15:35,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:15:35,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:15:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:15:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:15:35,147 INFO L87 Difference]: Start difference. First operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 06:15:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:15:35,312 INFO L93 Difference]: Finished difference Result 73 states and 124 transitions. [2023-12-24 06:15:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:15:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-12-24 06:15:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:15:35,326 INFO L225 Difference]: With dead ends: 73 [2023-12-24 06:15:35,326 INFO L226 Difference]: Without dead ends: 36 [2023-12-24 06:15:35,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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 06:15:35,331 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 06:15:35,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 06:15:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-24 06:15:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-24 06:15:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 06:15:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2023-12-24 06:15:35,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 85 [2023-12-24 06:15:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:15:35,381 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2023-12-24 06:15:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 06:15:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2023-12-24 06:15:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 06:15:35,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:15:35,386 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:35,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 06:15:35,592 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 06:15:35,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:15:35,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:15:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -850343593, now seen corresponding path program 1 times [2023-12-24 06:15:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:15:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526793927] [2023-12-24 06:15:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:15:35,596 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 06:15:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:15:35,597 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 06:15:35,616 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 06:15:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:15:35,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 06:15:35,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:16:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-24 06:16:07,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:16:35,839 WARN L293 SmtUtils]: Spent 7.46s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 06:16:38,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:16:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526793927] [2023-12-24 06:16:38,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526793927] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:16:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946609966] [2023-12-24 06:16:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:16:38,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 06:16:38,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 06:16:38,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 06:16:38,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-24 06:16:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:16:39,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 06:16:39,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:17:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-24 06:17:36,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:18:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946609966] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:18:02,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:18:02,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-24 06:18:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728269182] [2023-12-24 06:18:02,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:18:02,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 06:18:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:18:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 06:18:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-12-24 06:18:02,418 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-12-24 06:18:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:18:08,521 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-12-24 06:18:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 06:18:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) Word has length 85 [2023-12-24 06:18:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:18:08,524 INFO L225 Difference]: With dead ends: 52 [2023-12-24 06:18:08,524 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 06:18:08,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2023-12-24 06:18:08,525 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 06:18:08,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 170 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 06:18:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 06:18:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-12-24 06:18:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 06:18:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2023-12-24 06:18:08,533 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 85 [2023-12-24 06:18:08,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:18:08,533 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2023-12-24 06:18:08,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28) [2023-12-24 06:18:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2023-12-24 06:18:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-24 06:18:08,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:18:08,536 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:18:08,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-24 06:18:08,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 06:18:08,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 06:18:08,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:18:08,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:18:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -590940826, now seen corresponding path program 1 times [2023-12-24 06:18:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:18:08,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081456329] [2023-12-24 06:18:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:18:08,951 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 06:18:08,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:18:08,954 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 06:18:08,958 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 06:18:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:18:09,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 06:18:09,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:21:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 105 proven. 33 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2023-12-24 06:21:10,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:22:17,422 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse21 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse9 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse8 (bvslt c_~var_1_7~0 c_~var_1_8~0)) (.cse34 (or .cse21 .cse9)) (.cse35 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse9)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0))) (let ((.cse7 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse17 (not .cse3)) (.cse20 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse25 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse24 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (and .cse35 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse15 (and .cse34 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (not .cse8))) (let ((.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse4 (or .cse5 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse14 (or .cse15 .cse8)) (.cse16 (or .cse12 .cse8)) (.cse23 (not .cse24)) (.cse22 (not .cse25)) (.cse19 (not .cse20)) (.cse0 (and .cse9 (or .cse21 .cse17 .cse13))) (.cse1 (not .cse18)) (.cse6 (not .cse7))) (and (or (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and .cse4 (or (and (or .cse5 .cse6) (or .cse5 .cse7)) .cse8) .cse9 (or (and (or .cse10 .cse7) (or .cse10 .cse6)) .cse8) .cse11)) (or (and (or (and (or .cse12 .cse6) (or .cse12 .cse7)) .cse13) .cse14 (or (and (or .cse15 .cse6) (or .cse15 .cse7)) .cse13) .cse16) .cse17)) .cse18)) .cse19) (or .cse20 (and (or (and .cse9 (or .cse21 .cse22 .cse13)) .cse1 .cse2) (or (and (or (and .cse4 .cse9 (or (and (or .cse5 .cse23) (or .cse5 .cse24)) .cse8) .cse11 (or (and (or .cse10 .cse23) (or .cse10 .cse24)) .cse8)) .cse25) (or .cse22 (and (or (and (or .cse15 .cse23) (or .cse15 .cse24)) .cse13) .cse14 (or (and (or .cse12 .cse23) (or .cse12 .cse24)) .cse13) .cse16))) .cse18))) (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse26 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse27 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))))) (let ((.cse31 (and .cse35 .cse27)) (.cse30 (and .cse26 .cse34))) (let ((.cse32 (or .cse30 .cse8)) (.cse33 (or .cse31 .cse8)) (.cse28 (or .cse26 .cse13)) (.cse29 (or .cse27 .cse13))) (and (or (and (or .cse1 (and (or .cse9 .cse25) (or .cse22 (and .cse9 (or .cse21 .cse13))))) (or .cse18 (and (or (and (or (and (or .cse26 .cse23) (or .cse24 .cse26)) .cse8) (or (and (or .cse27 .cse24) (or .cse27 .cse23)) .cse8) .cse28 .cse29) .cse25) (or (and (or (and (or .cse24 .cse30) (or .cse30 .cse23)) .cse13) (or (and (or .cse31 .cse24) (or .cse31 .cse23)) .cse13) .cse32 .cse33) .cse22)))) .cse20) (or .cse19 (and (or .cse0 .cse1) (or .cse18 (and (or .cse17 (and (or (and (or .cse31 .cse6) (or .cse31 .cse7)) .cse13) (or (and (or .cse30 .cse6) (or .cse7 .cse30)) .cse13) .cse32 .cse33)) (or .cse3 (and (or (and (or .cse7 .cse26) (or .cse26 .cse6)) .cse8) .cse28 .cse29 (or (and (or .cse27 .cse6) (or .cse27 .cse7)) .cse8))))))))))))))))) is different from true [2023-12-24 06:22:59,938 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse17 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse16 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse11 (= (_ bv0 8) c_~var_1_2~0)) (.cse3 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse10 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse21 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse0 (not .cse12)) (.cse1 (and (or .cse5 .cse22 .cse10) .cse21)) (.cse6 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse8 (not .cse3)) (.cse9 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse2 (not .cse11)) (.cse23 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse13 (and .cse21 (or .cse22 .cse10 .cse16))) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse20 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse14 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse24 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse26 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse19 (not .cse17)) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (and (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse7 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse2) (or (and (or .cse3 .cse4) (or .cse5 .cse6 .cse4) (or .cse7 .cse8) (or .cse9 .cse10 .cse4) (or .cse9 .cse10 .cse7) (or .cse5 .cse6 .cse7) (or .cse7 .cse3) (or .cse4 .cse8)) .cse11))) (or .cse12 (and (or .cse2 .cse13) (or .cse11 (let ((.cse15 (and .cse4 (or .cse22 .cse21))) (.cse18 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse21) .cse7))) (and (or .cse14 .cse15 .cse16) (or .cse7 .cse17) (or .cse14 .cse18 .cse16) (or (and (or .cse17 .cse15) (or .cse15 .cse19)) .cse10 .cse16) (or .cse4 .cse19) (or .cse17 .cse4) (or .cse10 .cse20 .cse7) (or .cse10 .cse20 .cse4) (or .cse10 .cse16 (and (or .cse18 .cse17) (or .cse18 .cse19))) (or .cse7 .cse19))))))))) (or .cse0 (and (or .cse1 .cse2 .cse23) (or (and (or .cse24 .cse3) .cse21 (or .cse9 .cse25 .cse10) (or .cse25 .cse8) (or .cse24 .cse8) (or .cse5 .cse6 .cse24) (or .cse25 .cse3) (or .cse5 .cse25 .cse6) (or .cse5 .cse10 (and (or .cse8 .cse26) (or .cse3 .cse26))) (or .cse5 .cse10 (and (or .cse27 .cse3) (or .cse27 .cse8))) (or .cse9 .cse10 .cse24)) .cse11))) (or (and (or .cse2 .cse23 .cse13) (or .cse11 (and (or .cse25 .cse19) (or .cse25 .cse10 .cse20) (or .cse14 .cse25 .cse16) (or .cse25 .cse17) (or .cse24 .cse19) .cse21 (or .cse10 .cse20 .cse24) (or .cse14 .cse24 .cse16) (or .cse24 .cse17) (or (and (or .cse17 .cse26) (or .cse19 .cse26)) .cse10 .cse16) (or .cse10 (and (or .cse27 .cse19) (or .cse27 .cse17)) .cse16)))) .cse12)))) is different from true [2023-12-24 06:23:10,278 WARN L293 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 34 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 06:23:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-24 06:23:14,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:23:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081456329] [2023-12-24 06:23:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081456329] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 06:23:14,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:23:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-12-24 06:23:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75602076] [2023-12-24 06:23:14,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:23:14,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 06:23:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:23:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 06:23:14,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=151, Unknown=2, NotChecked=54, Total=272 [2023-12-24 06:23:14,818 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 06:23:29,653 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse17 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse16 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse11 (= (_ bv0 8) c_~var_1_2~0)) (.cse5 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse10 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse21 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse1 (and (or .cse5 .cse22 .cse10) .cse21)) (.cse6 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse9 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse2 (not .cse11)) (.cse23 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse13 (and .cse21 (or .cse22 .cse10 .cse16))) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse20 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse14 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse24 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse26 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse0 (not .cse12)) (.cse19 (not .cse17)) (.cse8 (not .cse3))) (and (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse7 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse4 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse2) (or (and (or .cse3 .cse4) (or .cse5 .cse6 .cse4) (or .cse7 .cse8) (or .cse9 .cse10 .cse4) (or .cse9 .cse10 .cse7) (or .cse5 .cse6 .cse7) (or .cse7 .cse3) (or .cse4 .cse8)) .cse11))) (or .cse12 (and (or .cse2 .cse13) (or .cse11 (let ((.cse15 (and .cse4 (or .cse22 .cse21))) (.cse18 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse21) .cse7))) (and (or .cse14 .cse15 .cse16) (or .cse7 .cse17) (or .cse14 .cse18 .cse16) (or (and (or .cse17 .cse15) (or .cse15 .cse19)) .cse10 .cse16) (or .cse4 .cse19) (or .cse17 .cse4) (or .cse10 .cse20 .cse7) (or .cse10 .cse20 .cse4) (or .cse10 .cse16 (and (or .cse18 .cse17) (or .cse18 .cse19))) (or .cse7 .cse19))))))))) (or .cse0 (and (or .cse1 .cse2 .cse23) (or (and (or .cse24 .cse3) .cse21 (or .cse9 .cse25 .cse10) (or .cse25 .cse8) (or .cse24 .cse8) (or .cse5 .cse6 .cse24) (or .cse25 .cse3) (or .cse5 .cse25 .cse6) (or .cse5 .cse10 (and (or .cse8 .cse26) (or .cse3 .cse26))) (or .cse5 .cse10 (and (or .cse27 .cse3) (or .cse27 .cse8))) (or .cse9 .cse10 .cse24)) .cse11))) (or (and (or .cse2 .cse23 .cse13) (or .cse11 (and (or .cse25 .cse19) (or .cse25 .cse10 .cse20) (or .cse14 .cse25 .cse16) (or .cse25 .cse17) (or .cse24 .cse19) .cse21 (or .cse10 .cse20 .cse24) (or .cse14 .cse24 .cse16) (or .cse24 .cse17) (or (and (or .cse17 .cse26) (or .cse19 .cse26)) .cse10 .cse16) (or .cse10 (and (or .cse27 .cse19) (or .cse27 .cse17)) .cse16)))) .cse12) .cse11 (let ((.cse28 (= c_~var_1_7~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|))) (or (and .cse0 (or (and .cse28 .cse19) (and (= c_~var_1_6~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) .cse17))) (and (or (and .cse28 .cse8) (and (= c_~var_1_5~0 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) .cse3)) .cse12))) (let ((.cse30 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse29 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse29))) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse30)))) (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse30)) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse29))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-24 06:23:34,792 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse9 (fp.eq c_~var_1_3~0 c_~var_1_3~0))) (let ((.cse8 (bvslt c_~var_1_7~0 c_~var_1_8~0)) (.cse36 (or .cse22 .cse9)) (.cse37 (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse9)) (.cse3 (bvslt c_~var_1_5~0 c_~var_1_8~0))) (let ((.cse7 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse18 (= (_ bv0 8) c_~var_1_2~0)) (.cse17 (not .cse3)) (.cse20 (bvslt c_~var_1_5~0 c_~var_1_6~0)) (.cse25 (bvslt c_~var_1_6~0 c_~var_1_8~0)) (.cse24 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse12 (and .cse37 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse15 (and .cse36 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0))))) (.cse10 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse13 (not .cse8))) (let ((.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse4 (or .cse5 .cse13)) (.cse11 (or .cse10 .cse13)) (.cse14 (or .cse15 .cse8)) (.cse16 (or .cse12 .cse8)) (.cse23 (not .cse24)) (.cse21 (not .cse25)) (.cse19 (not .cse20)) (.cse0 (and .cse9 (or .cse22 .cse17 .cse13))) (.cse1 (not .cse18)) (.cse6 (not .cse7))) (and (or (and (or .cse0 .cse1 .cse2) (or (and (or .cse3 (and .cse4 (or (and (or .cse5 .cse6) (or .cse5 .cse7)) .cse8) .cse9 (or (and (or .cse10 .cse7) (or .cse10 .cse6)) .cse8) .cse11)) (or (and (or (and (or .cse12 .cse6) (or .cse12 .cse7)) .cse13) .cse14 (or (and (or .cse15 .cse6) (or .cse15 .cse7)) .cse13) .cse16) .cse17)) .cse18)) .cse19) (or (and (or .cse17 .cse13) .cse20) (and .cse19 (or .cse21 .cse13))) (or .cse20 (and (or (and .cse9 (or .cse22 .cse21 .cse13)) .cse1 .cse2) (or (and (or (and .cse4 .cse9 (or (and (or .cse5 .cse23) (or .cse5 .cse24)) .cse8) .cse11 (or (and (or .cse10 .cse23) (or .cse10 .cse24)) .cse8)) .cse25) (or .cse21 (and (or (and (or .cse15 .cse23) (or .cse15 .cse24)) .cse13) .cse14 (or (and (or .cse12 .cse23) (or .cse12 .cse24)) .cse13) .cse16))) .cse18))) .cse18 (let ((.cse27 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse26 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse26))) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse27)))) (and (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse27)) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode .cse26))))) (or (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0))) (let ((.cse28 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (.cse29 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))))) (let ((.cse33 (and .cse37 .cse29)) (.cse32 (and .cse28 .cse36))) (let ((.cse34 (or .cse32 .cse8)) (.cse35 (or .cse33 .cse8)) (.cse30 (or .cse28 .cse13)) (.cse31 (or .cse29 .cse13))) (and (or (and (or .cse1 (and (or .cse9 .cse25) (or .cse21 (and .cse9 (or .cse22 .cse13))))) (or .cse18 (and (or (and (or (and (or .cse28 .cse23) (or .cse24 .cse28)) .cse8) (or (and (or .cse29 .cse24) (or .cse29 .cse23)) .cse8) .cse30 .cse31) .cse25) (or (and (or (and (or .cse24 .cse32) (or .cse32 .cse23)) .cse13) (or (and (or .cse33 .cse24) (or .cse33 .cse23)) .cse13) .cse34 .cse35) .cse21)))) .cse20) (or .cse19 (and (or .cse0 .cse1) (or .cse18 (and (or .cse17 (and (or (and (or .cse33 .cse6) (or .cse33 .cse7)) .cse13) (or (and (or .cse32 .cse6) (or .cse7 .cse32)) .cse13) .cse34 .cse35)) (or .cse3 (and (or (and (or .cse7 .cse28) (or .cse28 .cse6)) .cse8) .cse30 .cse31 (or (and (or .cse29 .cse6) (or .cse29 .cse7)) .cse8)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2023-12-24 06:23:42,043 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_6~0)) (.cse20 (bvsgt c_~var_1_6~0 c_~var_1_7~0)) (.cse16 (= (_ bv0 8) c_~var_1_2~0)) (.cse10 (bvsgt c_~var_1_5~0 c_~var_1_7~0)) (.cse4 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_5~0)) (.cse5 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) (.cse6 (bvsle |c_ULTIMATE.start_step_~stepLocal_0~0#1| c_~var_1_7~0)) (.cse24 (fp.eq c_~var_1_3~0 c_~var_1_3~0)) (.cse7 (bvslt c_~var_1_5~0 c_~var_1_6~0))) (let ((.cse3 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (not (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse0 (not .cse7)) (.cse1 (and (or .cse4 .cse5 .cse6) .cse24)) (.cse12 (bvsle c_~var_1_7~0 c_~var_1_5~0)) (.cse14 (not .cse10)) (.cse15 (bvsle c_~var_1_5~0 c_~var_1_7~0)) (.cse9 (not .cse16)) (.cse26 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse23 (bvsle c_~var_1_6~0 c_~var_1_7~0)) (.cse18 (bvsle c_~var_1_7~0 c_~var_1_6~0)) (.cse25 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse27 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)) (fp.eq ~var_1_1~0 ~var_1_4~0))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse22 (not .cse20)) (.cse28 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 ~var_1_4~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0))))) (fp.gt c_~var_1_3~0 ~var_1_4~0)))) (.cse2 (forall ((~var_1_4~0 (_ FloatingPoint 11 53))) (fp.gt c_~var_1_3~0 ~var_1_4~0))) (.cse17 (and .cse24 (or .cse5 .cse6 .cse8)))) (and (or .cse0 .cse1 .cse2) (or .cse3 (and (or .cse4 .cse5 .cse0 .cse6) (or .cse5 .cse6 .cse7 .cse8))) (or .cse3 (let ((.cse13 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (.cse11 (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (or (fp.eq ~var_1_1~0 c_~var_1_3~0) (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))))) (and (or .cse0 (and (or .cse1 .cse9) (or (and (or .cse10 .cse11) (or .cse4 .cse12 .cse11) (or .cse13 .cse14) (or .cse15 .cse6 .cse11) (or .cse15 .cse6 .cse13) (or .cse4 .cse12 .cse13) (or .cse13 .cse10) (or .cse11 .cse14)) .cse16))) (or .cse7 (and (or .cse9 .cse17) (or .cse16 (let ((.cse19 (and .cse11 (or .cse5 .cse24))) (.cse21 (and (or (forall ((~var_1_10~0 (_ FloatingPoint 11 53)) (~var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_9~0 (_ FloatingPoint 11 53))) (not (fp.eq ~var_1_1~0 (fp.add c_currentRoundingMode ~var_1_9~0 ~var_1_10~0)))) .cse24) .cse13))) (and (or .cse18 .cse19 .cse8) (or .cse13 .cse20) (or .cse18 .cse21 .cse8) (or (and (or .cse20 .cse19) (or .cse19 .cse22)) .cse6 .cse8) (or .cse11 .cse22) (or .cse20 .cse11) (or .cse6 .cse23 .cse13) (or .cse6 .cse23 .cse11) (or .cse6 .cse8 (and (or .cse21 .cse20) (or .cse21 .cse22))) (or .cse13 .cse22))))))))) (or .cse0 (and (or .cse1 .cse9 .cse2) (or (and (or .cse25 .cse10) .cse24 (or .cse15 .cse26 .cse6) (or .cse26 .cse14) (or .cse25 .cse14) (or .cse4 .cse12 .cse25) (or .cse26 .cse10) (or .cse4 .cse26 .cse12) (or .cse4 .cse6 (and (or .cse14 .cse27) (or .cse10 .cse27))) (or .cse4 .cse6 (and (or .cse28 .cse10) (or .cse28 .cse14))) (or .cse15 .cse6 .cse25)) .cse16))) (or (and (or .cse9 .cse2 .cse17) (or .cse16 (and (or .cse26 .cse22) (or .cse26 .cse6 .cse23) (or .cse18 .cse26 .cse8) (or .cse26 .cse20) (or .cse25 .cse22) .cse24 (or .cse6 .cse23 .cse25) (or .cse18 .cse25 .cse8) (or .cse25 .cse20) (or (and (or .cse20 .cse27) (or .cse22 .cse27)) .cse6 .cse8) (or .cse6 (and (or .cse28 .cse22) (or .cse28 .cse20)) .cse8)))) .cse7) (or .cse2 .cse17 .cse7)))) is different from true [2023-12-24 06:23:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:23:42,773 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2023-12-24 06:23:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 06:23:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 86 [2023-12-24 06:23:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:23:42,775 INFO L225 Difference]: With dead ends: 108 [2023-12-24 06:23:42,775 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 06:23:42,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=121, Invalid=314, Unknown=5, NotChecked=210, Total=650 [2023-12-24 06:23:42,776 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-24 06:23:42,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 324 Unchecked, 11.6s Time] [2023-12-24 06:23:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 06:23:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 56. [2023-12-24 06:23:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 06:23:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2023-12-24 06:23:42,786 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 86 [2023-12-24 06:23:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:23:42,787 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2023-12-24 06:23:42,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 06:23:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2023-12-24 06:23:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-24 06:23:42,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:23:42,788 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:42,795 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 06:23:42,989 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 06:23:42,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:23:42,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:23:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash -591000408, now seen corresponding path program 1 times [2023-12-24 06:23:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:23:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480216538] [2023-12-24 06:23:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:23:42,991 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 06:23:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:23:42,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:23:43,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 06:23:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:23:43,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 06:23:43,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:24:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-24 06:24:22,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:26:32,562 WARN L293 SmtUtils]: Spent 15.85s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 06:26:32,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:26:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480216538] [2023-12-24 06:26:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480216538] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:26:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1379434071] [2023-12-24 06:26:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:26:32,563 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 06:26:32,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 06:26:32,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 06:26:32,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 06:26:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:26:33,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 06:26:33,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:27:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 178 proven. 27 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-24 06:27:05,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:27:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1379434071] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 06:27:44,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 06:27:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2023-12-24 06:27:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708212216] [2023-12-24 06:27:44,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 06:27:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 06:27:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:27:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 06:27:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=291, Unknown=9, NotChecked=0, Total=380 [2023-12-24 06:27:44,907 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-24 06:28:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:28:20,053 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2023-12-24 06:28:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 06:28:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2023-12-24 06:28:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:28:20,069 INFO L225 Difference]: With dead ends: 73 [2023-12-24 06:28:20,069 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:28:20,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 147.2s TimeCoverageRelationStatistics Valid=158, Invalid=530, Unknown=14, NotChecked=0, Total=702 [2023-12-24 06:28:20,070 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-24 06:28:20,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 112 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-24 06:28:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:28:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:28:20,071 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 06:28:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:28:20,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2023-12-24 06:28:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:28:20,071 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:28:20,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-24 06:28:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:28:20,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:28:20,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:28:20,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 06:28:20,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 06:28:20,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:28:20,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:28:31,460 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,461 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse8 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse8)) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse8))) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse5 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse4 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.leq ~var_1_10~0 .cse4) (fp.geq ~var_1_10~0 .cse2)) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 .cse5))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (or (and (fp.leq ~var_1_9~0 .cse0) (fp.geq ~var_1_9~0 .cse5)) (and (fp.leq ~var_1_9~0 .cse4) (fp.geq ~var_1_9~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse8 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse8)) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse8))) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse5 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse4 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.leq ~var_1_10~0 .cse4) (fp.geq ~var_1_10~0 .cse2)) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 .cse5))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (or (and (fp.leq ~var_1_9~0 .cse0) (fp.geq ~var_1_9~0 .cse5)) (and (fp.leq ~var_1_9~0 .cse4) (fp.geq ~var_1_9~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 37 43) no Hoare annotation was computed. [2023-12-24 06:28:31,461 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse6)) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0))) (or (and (fp.leq ~var_1_9~0 .cse0) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse4)) (fp.geq ~var_1_9~0 .cse2)))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,461 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 46 70) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,462 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_3~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_3~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.leq ~var_1_3~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_3~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 43) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 06:28:31,462 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-24 06:28:31,463 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse2 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse4)) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4)))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 06:28:31,463 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2023-12-24 06:28:31,463 INFO L895 garLoopResultBuilder]: At program point L80-2(lines 80 86) the Hoare annotation is: (let ((.cse7 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse6 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse8 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode .cse8)) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse8))) (.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse6))) (.cse5 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse4 ((_ to_fp 11 53) currentRoundingMode .cse7)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse6))) (and (or (and (fp.leq ~var_1_4~0 .cse0) (fp.geq ~var_1_4~0 .cse1)) (and (fp.geq ~var_1_4~0 .cse2) (fp.leq ~var_1_4~0 .cse3))) (or (and (fp.leq ~var_1_10~0 .cse4) (fp.geq ~var_1_10~0 .cse2)) (and (fp.leq ~var_1_10~0 .cse0) (fp.geq ~var_1_10~0 .cse5))) (or (and (fp.geq ~var_1_3~0 .cse2) (fp.leq ~var_1_3~0 .cse3)) (and (fp.leq ~var_1_3~0 .cse0) (fp.geq ~var_1_3~0 .cse1))) (or (and (fp.leq ~var_1_9~0 .cse0) (fp.geq ~var_1_9~0 .cse5)) (and (fp.leq ~var_1_9~0 .cse4) (fp.geq ~var_1_9~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 06:28:31,463 INFO L899 garLoopResultBuilder]: For program point L80-3(lines 80 86) no Hoare annotation was computed. [2023-12-24 06:28:31,464 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:28:31,464 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:28:31,464 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:28:31,464 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:28:31,466 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-24 06:28:31,467 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:28:31,479 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:28:31,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:28:31 BoogieIcfgContainer [2023-12-24 06:28:31,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:28:31,480 INFO L158 Benchmark]: Toolchain (without parser) took 777564.30ms. Allocated memory was 234.9MB in the beginning and 604.0MB in the end (delta: 369.1MB). Free memory was 188.5MB in the beginning and 311.2MB in the end (delta: -122.8MB). Peak memory consumption was 246.5MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,480 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 195.0MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:28:31,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.24ms. Allocated memory is still 234.9MB. Free memory was 188.5MB in the beginning and 175.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 234.9MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,481 INFO L158 Benchmark]: Boogie Preprocessor took 43.30ms. Allocated memory is still 234.9MB. Free memory was 174.0MB in the beginning and 171.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,481 INFO L158 Benchmark]: RCFGBuilder took 619.26ms. Allocated memory is still 234.9MB. Free memory was 171.4MB in the beginning and 155.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,481 INFO L158 Benchmark]: TraceAbstraction took 776634.32ms. Allocated memory was 234.9MB in the beginning and 604.0MB in the end (delta: 369.1MB). Free memory was 154.6MB in the beginning and 311.2MB in the end (delta: -156.6MB). Peak memory consumption was 213.0MB. Max. memory is 8.0GB. [2023-12-24 06:28:31,483 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.17ms. Allocated memory is still 195.0MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.24ms. Allocated memory is still 234.9MB. Free memory was 188.5MB in the beginning and 175.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 234.9MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.30ms. Allocated memory is still 234.9MB. Free memory was 174.0MB in the beginning and 171.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 619.26ms. Allocated memory is still 234.9MB. Free memory was 171.4MB in the beginning and 155.1MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 776634.32ms. Allocated memory was 234.9MB in the beginning and 604.0MB in the end (delta: 369.1MB). Free memory was 154.6MB in the beginning and 311.2MB in the end (delta: -156.6MB). Peak memory consumption was 213.0MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 776.6s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 69.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 489 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 324 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 138 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 676 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 218.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 45 PreInvPairs, 65 NumberOfFragments, 1182 HoareAnnotationTreeSize, 45 FormulaSimplifications, 7673 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FormulaSimplificationsInter, 7146 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 693.1s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 592 ConstructedInterpolants, 3 QuantifiedInterpolants, 20216 SizeOfPredicates, 99 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 2308/2548 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: 80]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 06:28:31,702 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 06:28:31,782 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...