/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_loopvsstraightlinecode_100-while_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 22:33:00,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 22:33:00,317 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-23 22:33:00,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 22:33:00,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 22:33:00,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 22:33:00,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 22:33:00,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 22:33:00,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 22:33:00,351 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 22:33:00,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 22:33:00,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 22:33:00,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 22:33:00,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 22:33:00,353 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 22:33:00,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 22:33:00,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 22:33:00,354 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 22:33:00,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 22:33:00,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 22:33:00,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 22:33:00,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 22:33:00,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 22:33:00,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 22:33:00,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 22:33:00,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 22:33:00,358 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 22:33:00,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 22:33:00,360 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 22:33:00,360 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-23 22:33:00,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 22:33:00,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 22:33:00,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 22:33:00,574 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 22:33:00,576 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 22:33:00,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-2.i [2023-12-23 22:33:01,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 22:33:01,764 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 22:33:01,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-2.i [2023-12-23 22:33:01,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec3746c6/05d6027eee904619acd18d618c318e10/FLAGc58bd71a9 [2023-12-23 22:33:01,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec3746c6/05d6027eee904619acd18d618c318e10 [2023-12-23 22:33:01,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 22:33:01,793 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 22:33:01,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 22:33:01,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 22:33:01,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 22:33:01,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:33:01" (1/1) ... [2023-12-23 22:33:01,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bcd4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:01, skipping insertion in model container [2023-12-23 22:33:01,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:33:01" (1/1) ... [2023-12-23 22:33:01,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 22:33:01,954 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_loopvsstraightlinecode_100-while_file-2.i[915,928] [2023-12-23 22:33:02,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 22:33:02,066 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 22:33:02,079 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_loopvsstraightlinecode_100-while_file-2.i[915,928] [2023-12-23 22:33:02,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 22:33:02,151 INFO L206 MainTranslator]: Completed translation [2023-12-23 22:33:02,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02 WrapperNode [2023-12-23 22:33:02,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 22:33:02,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 22:33:02,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 22:33:02,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 22:33:02,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,204 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2023-12-23 22:33:02,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 22:33:02,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 22:33:02,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 22:33:02,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 22:33:02,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,241 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-23 22:33:02,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 22:33:02,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 22:33:02,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 22:33:02,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 22:33:02,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (1/1) ... [2023-12-23 22:33:02,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 22:33:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 22:33:02,313 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-23 22:33:02,330 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-23 22:33:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 22:33:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 22:33:02,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 22:33:02,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 22:33:02,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 22:33:02,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 22:33:02,424 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 22:33:02,427 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 22:33:18,063 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 22:33:18,111 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 22:33:18,112 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 22:33:18,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:33:18 BoogieIcfgContainer [2023-12-23 22:33:18,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 22:33:18,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 22:33:18,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 22:33:18,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 22:33:18,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:33:01" (1/3) ... [2023-12-23 22:33:18,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0ddcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:33:18, skipping insertion in model container [2023-12-23 22:33:18,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:33:02" (2/3) ... [2023-12-23 22:33:18,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0ddcb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:33:18, skipping insertion in model container [2023-12-23 22:33:18,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:33:18" (3/3) ... [2023-12-23 22:33:18,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-2.i [2023-12-23 22:33:18,165 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 22:33:18,165 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 22:33:18,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 22:33:18,211 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;@3083a4ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 22:33:18,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 22:33:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-23 22:33:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-23 22:33:18,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 22:33:18,226 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:33:18,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 22:33:18,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 22:33:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1681136780, now seen corresponding path program 1 times [2023-12-23 22:33:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 22:33:18,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310174583] [2023-12-23 22:33:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 22:33:18,246 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-23 22:33:18,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 22:33:18,259 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-23 22:33:18,271 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-23 22:33:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 22:33:19,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 22:33:19,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 22:33:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 1514 trivial. 0 not checked. [2023-12-23 22:33:19,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 22:33:19,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 22:33:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310174583] [2023-12-23 22:33:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310174583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 22:33:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 22:33:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 22:33:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212851745] [2023-12-23 22:33:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 22:33:19,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 22:33:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 22:33:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 22:33:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 22:33:19,563 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-23 22:33:24,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 22:33:24,401 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2023-12-23 22:33:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 22:33:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 221 [2023-12-23 22:33:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 22:33:24,693 INFO L225 Difference]: With dead ends: 181 [2023-12-23 22:33:24,693 INFO L226 Difference]: Without dead ends: 90 [2023-12-23 22:33:24,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 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-23 22:33:24,701 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-23 22:33:24,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-23 22:33:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-23 22:33:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-23 22:33:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-23 22:33:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 142 transitions. [2023-12-23 22:33:24,757 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 142 transitions. Word has length 221 [2023-12-23 22:33:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 22:33:24,758 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 142 transitions. [2023-12-23 22:33:24,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2023-12-23 22:33:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 142 transitions. [2023-12-23 22:33:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-23 22:33:24,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 22:33:24,768 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:33:24,796 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-23 22:33:24,976 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-23 22:33:24,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 22:33:24,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 22:33:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1463761096, now seen corresponding path program 1 times [2023-12-23 22:33:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 22:33:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345827121] [2023-12-23 22:33:24,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 22:33:24,978 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-23 22:33:24,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 22:33:24,984 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-23 22:33:24,985 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-23 22:33:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 22:33:26,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 22:33:26,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 22:33:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-23 22:33:26,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 22:33:26,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 22:33:26,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345827121] [2023-12-23 22:33:26,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345827121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 22:33:26,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 22:33:26,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 22:33:26,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144973848] [2023-12-23 22:33:26,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 22:33:26,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 22:33:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 22:33:26,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 22:33:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 22:33:26,386 INFO L87 Difference]: Start difference. First operand 90 states and 142 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 22:33:31,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:35,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:39,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 22:33:39,274 INFO L93 Difference]: Finished difference Result 197 states and 309 transitions. [2023-12-23 22:33:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 22:33:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2023-12-23 22:33:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 22:33:39,575 INFO L225 Difference]: With dead ends: 197 [2023-12-23 22:33:39,575 INFO L226 Difference]: Without dead ends: 108 [2023-12-23 22:33:39,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 22:33:39,576 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 18 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-12-23 22:33:39,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 271 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2023-12-23 22:33:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-23 22:33:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2023-12-23 22:33:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-23 22:33:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2023-12-23 22:33:39,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 221 [2023-12-23 22:33:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 22:33:39,587 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2023-12-23 22:33:39,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 22:33:39,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2023-12-23 22:33:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-23 22:33:39,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 22:33:39,589 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:33:39,617 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-23 22:33:39,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 22:33:39,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 22:33:39,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 22:33:39,803 INFO L85 PathProgramCache]: Analyzing trace with hash -870043569, now seen corresponding path program 1 times [2023-12-23 22:33:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 22:33:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165289547] [2023-12-23 22:33:39,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 22:33:39,804 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-23 22:33:39,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 22:33:39,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 22:33:39,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 22:33:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 22:33:40,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 22:33:40,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 22:33:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-12-23 22:33:41,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 22:33:41,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 22:33:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165289547] [2023-12-23 22:33:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165289547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 22:33:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 22:33:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 22:33:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476140832] [2023-12-23 22:33:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 22:33:41,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 22:33:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 22:33:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 22:33:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 22:33:41,114 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 22:33:46,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:50,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:54,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 22:33:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 22:33:54,571 INFO L93 Difference]: Finished difference Result 232 states and 357 transitions. [2023-12-23 22:33:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 22:33:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2023-12-23 22:33:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 22:33:54,573 INFO L225 Difference]: With dead ends: 232 [2023-12-23 22:33:54,573 INFO L226 Difference]: Without dead ends: 136 [2023-12-23 22:33:54,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 22:33:54,575 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 38 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-23 22:33:54,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2023-12-23 22:33:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-23 22:33:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2023-12-23 22:33:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 88 states have internal predecessors, (117), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-23 22:33:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2023-12-23 22:33:54,587 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 222 [2023-12-23 22:33:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 22:33:54,587 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2023-12-23 22:33:54,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2023-12-23 22:33:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2023-12-23 22:33:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-23 22:33:54,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 22:33:54,589 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:33:54,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-23 22:33:54,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 22:33:54,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 22:33:54,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 22:33:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash 904963793, now seen corresponding path program 1 times [2023-12-23 22:33:54,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 22:33:54,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938389597] [2023-12-23 22:33:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 22:33:54,808 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-23 22:33:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 22:33:54,810 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-23 22:33:54,815 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-23 22:33:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 22:33:56,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-23 22:33:56,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 22:35:35,106 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:35:43,963 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:35:52,849 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:01,729 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:10,263 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:19,195 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:28,107 WARN L293 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:37,032 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:44,863 WARN L293 SmtUtils]: Spent 7.83s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:36:53,782 WARN L293 SmtUtils]: Spent 8.92s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:02,712 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:11,625 WARN L293 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:20,563 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:29,516 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:38,445 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:47,375 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:37:56,317 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:05,303 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:09,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-23 22:38:13,826 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-23 22:38:22,815 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:31,769 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:40,699 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:49,635 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:38:58,155 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:07,149 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:16,098 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:25,039 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:33,992 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:42,953 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:39:51,898 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:00,862 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:09,821 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:18,805 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:27,800 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:36,797 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:45,762 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:40:54,717 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:03,689 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:07,952 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= |c_ULTIMATE.start_step_~stepLocal_4~0#1| c_~var_1_11~0) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-23 22:41:12,218 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (= |c_ULTIMATE.start_step_~stepLocal_4~0#1| c_~var_1_11~0) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (bvsle .cse0 (_ bv63 32)) (fp.leq c_~var_1_4~0 .cse1) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv127 32)) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-23 22:41:21,207 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:30,165 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:39,132 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:48,099 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:41:56,672 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:05,645 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:14,612 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:23,554 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:32,520 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:41,537 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:50,476 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:42:59,404 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:08,368 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:17,359 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:26,314 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:38,718 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:47,671 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:43:56,622 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:00,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse3 ((_ zero_extend 24) c_~var_1_23~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse6)) (.cse4 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (bvsle .cse3 (_ bv127 32)) (not (bvsge .cse0 (bvadd .cse4 (bvneg .cse3)))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse4 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse6))))) (bvsle .cse4 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-23 22:44:05,161 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse3 ((_ zero_extend 24) c_~var_1_23~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse6)) (.cse4 ((_ sign_extend 24) c_~var_1_27~0))) (and (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (bvsle .cse3 (_ bv127 32)) (not (bvsge .cse0 (bvadd .cse4 (bvneg .cse3)))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse4 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse6))))) (bvsle .cse4 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-23 22:44:14,113 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:23,073 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:32,032 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:40,980 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:49,504 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:44:58,446 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:07,375 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:16,325 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:25,280 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:34,246 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:43,175 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:45:52,116 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:01,093 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:10,063 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:19,029 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:27,961 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:36,943 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:46,861 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:46:55,828 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:47:00,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (= c_~var_1_29~0 c_~var_1_20~0) (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (not (bvsle ((_ zero_extend 24) c_~var_1_24~0) .cse3)) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from false [2023-12-23 22:47:04,373 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ sign_extend 24) c_~var_1_11~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse5)) (.cse3 ((_ sign_extend 24) c_~var_1_27~0))) (and (= c_~var_1_29~0 c_~var_1_20~0) (bvsge .cse0 (_ bv4294967233 32)) (fp.leq c_~var_1_3~0 .cse1) (fp.geq c_~var_1_3~0 .cse2) (bvsle ((_ sign_extend 24) c_~var_1_20~0) (_ bv63 32)) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_14~0) (= c_~last_1_var_1_21~0 (_ bv5 8)) (fp.leq c_~var_1_4~0 .cse1) (not (bvsge .cse0 (bvadd .cse3 (bvneg ((_ zero_extend 24) c_~var_1_23~0))))) (fp.geq c_~var_1_4~0 .cse2) (bvsge .cse3 (_ bv0 32)) (or (and (fp.leq c_~var_1_5~0 .cse1) (fp.geq c_~var_1_5~0 .cse2)) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse5))))) (not (bvsle ((_ zero_extend 24) c_~var_1_24~0) .cse3)) (bvsle .cse3 (_ bv63 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq (fp.div c_currentRoundingMode c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_15~0)) (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_16~0))))) is different from true [2023-12-23 22:47:13,383 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:47:22,352 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:47:31,302 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:47:40,316 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-23 22:47:48,094 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 22:47:48,106 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 22:47:48,860 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-23 22:47:49,136 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-23 22:47:49,295 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-23 22:47:49,383 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 [2023-12-23 22:47:49,385 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 22:47:49,385 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 223 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-23 22:47:49,388 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-23 22:47:49,390 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 22:47:49,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 10:47:49 BoogieIcfgContainer [2023-12-23 22:47:49,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 22:47:49,398 INFO L158 Benchmark]: Toolchain (without parser) took 887599.07ms. Allocated memory is still 278.9MB. Free memory was 236.2MB in the beginning and 169.3MB in the end (delta: 66.9MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,399 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 170.9MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 22:47:49,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.25ms. Allocated memory is still 278.9MB. Free memory was 236.2MB in the beginning and 218.3MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.36ms. Allocated memory is still 278.9MB. Free memory was 218.3MB in the beginning and 215.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,399 INFO L158 Benchmark]: Boogie Preprocessor took 85.12ms. Allocated memory is still 278.9MB. Free memory was 215.2MB in the beginning and 210.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,400 INFO L158 Benchmark]: RCFGBuilder took 15821.68ms. Allocated memory is still 278.9MB. Free memory was 210.4MB in the beginning and 175.4MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,400 INFO L158 Benchmark]: TraceAbstraction took 871277.85ms. Allocated memory is still 278.9MB. Free memory was 174.9MB in the beginning and 169.3MB in the end (delta: 5.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2023-12-23 22:47:49,403 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.13ms. Allocated memory is still 170.9MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.25ms. Allocated memory is still 278.9MB. Free memory was 236.2MB in the beginning and 218.3MB in the end (delta: 17.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.36ms. Allocated memory is still 278.9MB. Free memory was 218.3MB in the beginning and 215.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.12ms. Allocated memory is still 278.9MB. Free memory was 215.2MB in the beginning and 210.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 15821.68ms. Allocated memory is still 278.9MB. Free memory was 210.4MB in the beginning and 175.4MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 871277.85ms. Allocated memory is still 278.9MB. Free memory was 174.9MB in the beginning and 169.3MB in the end (delta: 5.6MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 223 with TraceHistMax 36,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 871.2s, OverallIterations: 4, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 30.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 415 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 661 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 661 ConstructedInterpolants, 0 QuantifiedInterpolants, 696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1086 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 7560/7560 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown