/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-18.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:10:25,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:10:25,575 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:10:25,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:10:25,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:10:25,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:10:25,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:10:25,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:10:25,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:10:25,614 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:10:25,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:10:25,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:10:25,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:10:25,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:10:25,617 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:10:25,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:10:25,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:10:25,618 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:10:25,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:10:25,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:10:25,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:10:25,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:10:25,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:10:25,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:10:25,621 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:10:25,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:10:25,621 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:10:25,621 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:10:25,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:10:25,622 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:10:25,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:10:25,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:10:25,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:10:25,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:10:25,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:10:25,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:10:25,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:10:25,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:10:25,624 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:10:25,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:10:25,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:10:25,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:10:25,625 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:10:25,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:10:25,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:10:25,626 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:10:25,626 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:10:25,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:10:25,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:10:25,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:10:25,893 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:10:25,893 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:10:25,895 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-18.i [2023-12-24 06:10:27,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:10:27,240 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:10:27,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2023-12-24 06:10:27,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471cecbbb/0994d0e71ad64f25b63a20316d26e8c0/FLAG602b21133 [2023-12-24 06:10:27,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471cecbbb/0994d0e71ad64f25b63a20316d26e8c0 [2023-12-24 06:10:27,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:10:27,261 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:10:27,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:10:27,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:10:27,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:10:27,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ba87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27, skipping insertion in model container [2023-12-24 06:10:27,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:10:27,433 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-18.i[915,928] [2023-12-24 06:10:27,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:10:27,478 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:10:27,488 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-18.i[915,928] [2023-12-24 06:10:27,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:10:27,515 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:10:27,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27 WrapperNode [2023-12-24 06:10:27,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:10:27,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:10:27,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:10:27,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:10:27,522 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:10:27" (1/1) ... [2023-12-24 06:10:27,532 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:10:27" (1/1) ... [2023-12-24 06:10:27,549 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2023-12-24 06:10:27,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:10:27,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:10:27,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:10:27,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:10:27,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,575 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:10:27,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:10:27,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:10:27,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:10:27,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:10:27,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (1/1) ... [2023-12-24 06:10:27,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:10:27,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:10:27,637 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:10:27,654 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:10:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:10:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:10:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:10:27,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:10:27,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:10:27,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:10:27,728 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:10:27,730 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:10:40,682 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:10:40,726 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:10:40,726 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:10:40,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:10:40 BoogieIcfgContainer [2023-12-24 06:10:40,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:10:40,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:10:40,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:10:40,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:10:40,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:10:27" (1/3) ... [2023-12-24 06:10:40,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef67b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:10:40, skipping insertion in model container [2023-12-24 06:10:40,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:10:27" (2/3) ... [2023-12-24 06:10:40,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef67b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:10:40, skipping insertion in model container [2023-12-24 06:10:40,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:10:40" (3/3) ... [2023-12-24 06:10:40,735 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2023-12-24 06:10:40,751 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:10:40,751 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:10:40,794 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:10:40,801 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;@1ac79db2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:10:40,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:10:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 06:10:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 06:10:40,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:10:40,825 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:40,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:10:40,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:10:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1766491661, now seen corresponding path program 1 times [2023-12-24 06:10:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:10:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458653551] [2023-12-24 06:10:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:10:40,850 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:10:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:10:40,856 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:10:40,858 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:10:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:10:41,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:10:41,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:10:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-24 06:10:41,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:10:41,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:10:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458653551] [2023-12-24 06:10:41,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458653551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:10:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:10:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:10:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532549088] [2023-12-24 06:10:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:10:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:10:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:10:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:10:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:10:41,737 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 06:10:46,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:10:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:10:46,425 INFO L93 Difference]: Finished difference Result 57 states and 94 transitions. [2023-12-24 06:10:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:10:46,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-12-24 06:10:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:10:46,681 INFO L225 Difference]: With dead ends: 57 [2023-12-24 06:10:46,682 INFO L226 Difference]: Without dead ends: 28 [2023-12-24 06:10:46,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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:10:46,689 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 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.7s IncrementalHoareTripleChecker+Time [2023-12-24 06:10:46,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-24 06:10:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-24 06:10:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-24 06:10:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 06:10:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-24 06:10:46,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 62 [2023-12-24 06:10:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:10:46,737 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-24 06:10:46,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 06:10:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-24 06:10:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 06:10:46,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:10:46,743 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:46,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 06:10:46,956 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:10:46,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:10:46,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:10:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash -231364019, now seen corresponding path program 1 times [2023-12-24 06:10:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:10:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764093085] [2023-12-24 06:10:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:10:46,959 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:10:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:10:46,960 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:10:46,961 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:10:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:10:47,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 06:10:47,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:10:56,269 WARN L293 SmtUtils]: Spent 8.52s 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-24 06:11:05,228 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:09,516 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2023-12-24 06:11:13,787 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2023-12-24 06:11:27,465 WARN L293 SmtUtils]: Spent 8.52s 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-24 06:11:31,725 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0)))) is different from false [2023-12-24 06:11:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 06:11:31,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:11:31,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:11:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764093085] [2023-12-24 06:11:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764093085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:11:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:11:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 06:11:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102613265] [2023-12-24 06:11:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:11:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 06:11:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:11:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 06:11:31,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2023-12-24 06:11:31,746 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 06:11:36,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:11:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:11:36,498 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-12-24 06:11:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 06:11:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2023-12-24 06:11:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:11:36,760 INFO L225 Difference]: With dead ends: 32 [2023-12-24 06:11:36,760 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 06:11:36,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2023-12-24 06:11:36,761 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-24 06:11:36,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 48 Unchecked, 4.7s Time] [2023-12-24 06:11:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 06:11:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-24 06:11:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 06:11:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-12-24 06:11:36,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 62 [2023-12-24 06:11:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:11:36,769 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-12-24 06:11:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 06:11:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-12-24 06:11:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 06:11:36,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:11:36,771 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,792 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:11:36,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:11:36,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:11:36,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:11:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -231304437, now seen corresponding path program 1 times [2023-12-24 06:11:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:11:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042033595] [2023-12-24 06:11:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:11:36,984 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:11:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:11:36,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:11:36,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 06:11:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:11:37,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 06:11:37,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:11:46,932 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:11:56,041 WARN L293 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:05,018 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:13,990 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-24 06:12:22,549 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:26,821 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ sign_extend 16) c_~var_1_6~0)) (.cse2 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse0 (bvslt .cse1 .cse2))) (or (and .cse0 (= c_~var_1_1~0 ((_ extract 15 0) .cse1))) (and (not .cse0) (= c_~var_1_1~0 ((_ extract 15 0) .cse2)))))) (not (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0)))) is different from false [2023-12-24 06:12:31,090 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ sign_extend 16) c_~var_1_6~0)) (.cse2 ((_ sign_extend 16) c_~var_1_5~0))) (let ((.cse0 (bvslt .cse1 .cse2))) (or (and .cse0 (= c_~var_1_1~0 ((_ extract 15 0) .cse1))) (and (not .cse0) (= c_~var_1_1~0 ((_ extract 15 0) .cse2)))))) (not (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0)))) is different from true [2023-12-24 06:12:44,474 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 06:12:48,740 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (not (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0))))) is different from false [2023-12-24 06:12:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 06:12:48,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:48,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042033595] [2023-12-24 06:12:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042033595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 06:12:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642634519] [2023-12-24 06:12:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 06:12:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 06:12:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2023-12-24 06:12:48,756 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 06:12:53,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 06:12:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:53,498 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-12-24 06:12:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 06:12:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2023-12-24 06:12:53,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:53,756 INFO L225 Difference]: With dead ends: 30 [2023-12-24 06:12:53,756 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:12:53,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=5, Invalid=2, Unknown=3, NotChecked=2, Total=12 [2023-12-24 06:12:53,758 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:53,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 45 Unchecked, 4.7s Time] [2023-12-24 06:12:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:12:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:12:53,759 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:12:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:12:53,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-12-24 06:12:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:53,760 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:12:53,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 06:12:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:12:53,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:12:53,763 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:12:53,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:53,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:12:53,986 INFO L899 garLoopResultBuilder]: For program point L56(lines 40 57) no Hoare annotation was computed. [2023-12-24 06:12:53,987 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-12-24 06:12:53,987 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-12-24 06:12:53,987 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,987 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,987 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,987 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2023-12-24 06:12:53,987 INFO L902 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: true [2023-12-24 06:12:53,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,987 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-12-24 06:12:53,988 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 33 37) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L902 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: true [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:12:53,988 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-12-24 06:12:53,989 INFO L902 garLoopResultBuilder]: At program point L67-2(lines 67 73) the Hoare annotation is: true [2023-12-24 06:12:53,989 INFO L899 garLoopResultBuilder]: For program point L67-3(lines 67 73) no Hoare annotation was computed. [2023-12-24 06:12:53,989 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-12-24 06:12:53,989 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-12-24 06:12:53,989 INFO L902 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: true [2023-12-24 06:12:53,989 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-12-24 06:12:53,989 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:12:53,989 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,989 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,989 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,993 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 06:12:53,995 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:12:54,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:12:54 BoogieIcfgContainer [2023-12-24 06:12:54,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:12:54,007 INFO L158 Benchmark]: Toolchain (without parser) took 146746.66ms. Allocated memory is still 302.0MB. Free memory was 247.1MB in the beginning and 212.3MB in the end (delta: 34.8MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,008 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 195.0MB. Free memory was 142.4MB in the beginning and 142.3MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:12:54,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.48ms. Allocated memory is still 302.0MB. Free memory was 247.1MB in the beginning and 235.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.84ms. Allocated memory is still 302.0MB. Free memory was 235.0MB in the beginning and 232.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,009 INFO L158 Benchmark]: Boogie Preprocessor took 41.85ms. Allocated memory is still 302.0MB. Free memory was 232.9MB in the beginning and 230.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,009 INFO L158 Benchmark]: RCFGBuilder took 13134.18ms. Allocated memory is still 302.0MB. Free memory was 230.8MB in the beginning and 214.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,010 INFO L158 Benchmark]: TraceAbstraction took 133277.89ms. Allocated memory is still 302.0MB. Free memory was 213.0MB in the beginning and 212.3MB in the end (delta: 713.2kB). Peak memory consumption was 1.8MB. Max. memory is 8.0GB. [2023-12-24 06:12:54,013 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.53ms. Allocated memory is still 195.0MB. Free memory was 142.4MB in the beginning and 142.3MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.48ms. Allocated memory is still 302.0MB. Free memory was 247.1MB in the beginning and 235.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.84ms. Allocated memory is still 302.0MB. Free memory was 235.0MB in the beginning and 232.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.85ms. Allocated memory is still 302.0MB. Free memory was 232.9MB in the beginning and 230.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 13134.18ms. Allocated memory is still 302.0MB. Free memory was 230.8MB in the beginning and 214.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 133277.89ms. Allocated memory is still 302.0MB. Free memory was 213.0MB in the beginning and 212.3MB in the end (delta: 713.2kB). Peak memory consumption was 1.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 133.2s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 14.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 93 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 103 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 42 NumberOfFragments, 12 HoareAnnotationTreeSize, 31 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 115.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 183 ConstructedInterpolants, 2 QuantifiedInterpolants, 273 SizeOfPredicates, 24 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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: 67]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-24 06:12:54,215 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 0 Received shutdown request...