/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-72.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:19:20,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:19:20,701 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:19:20,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:19:20,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:19:20,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:19:20,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:19:20,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:19:20,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:19:20,721 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:19:20,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:19:20,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:19:20,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:19:20,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:19:20,722 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:19:20,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:19:20,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:19:20,723 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:19:20,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:19:20,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:19:20,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:19:20,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:19:20,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:19:20,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:19:20,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:19:20,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:19:20,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:19:20,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:19:20,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:19:20,726 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:19:20,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:19:20,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:19:20,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:19:20,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:19:20,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:19:20,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:19:20,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:19:20,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:19:20,729 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:19:20,729 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:19:20,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:19:20,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:19:20,730 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:19:20,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:19:20,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:19:20,730 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:19:20,730 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:19:20,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:19:20,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:19:20,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:19:20,974 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:19:20,978 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:19:20,979 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-72.i [2023-12-24 06:19:22,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:19:22,754 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:19:22,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2023-12-24 06:19:22,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8e4cef5/f7950526918745a99806404aa11e549c/FLAG2a1ca881a [2023-12-24 06:19:22,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8e4cef5/f7950526918745a99806404aa11e549c [2023-12-24 06:19:22,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:19:22,816 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:19:22,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:19:22,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:19:22,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:19:22,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:19:22" (1/1) ... [2023-12-24 06:19:22,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181a4b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:22, skipping insertion in model container [2023-12-24 06:19:22,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:19:22" (1/1) ... [2023-12-24 06:19:22,868 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:19:23,116 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-72.i[915,928] [2023-12-24 06:19:23,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:19:23,190 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:19:23,211 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-72.i[915,928] [2023-12-24 06:19:23,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:19:23,256 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:19:23,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23 WrapperNode [2023-12-24 06:19:23,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:19:23,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:19:23,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:19:23,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:19:23,279 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:19:23" (1/1) ... [2023-12-24 06:19:23,293 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:19:23" (1/1) ... [2023-12-24 06:19:23,315 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2023-12-24 06:19:23,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:19:23,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:19:23,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:19:23,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:19:23,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,365 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:19:23,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:19:23,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:19:23,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:19:23,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:19:23,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (1/1) ... [2023-12-24 06:19:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:19:23,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:19:23,470 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:19:23,524 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:19:23,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:19:23,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:19:23,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:19:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:19:23,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:19:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:19:23,622 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:19:23,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:19:23,883 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:19:23,906 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:19:23,906 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:19:23,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:19:23 BoogieIcfgContainer [2023-12-24 06:19:23,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:19:23,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:19:23,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:19:23,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:19:23,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:19:22" (1/3) ... [2023-12-24 06:19:23,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46039726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:19:23, skipping insertion in model container [2023-12-24 06:19:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:19:23" (2/3) ... [2023-12-24 06:19:23,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46039726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:19:23, skipping insertion in model container [2023-12-24 06:19:23,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:19:23" (3/3) ... [2023-12-24 06:19:23,934 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2023-12-24 06:19:23,948 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:19:23,949 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:19:23,994 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:19:24,001 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;@2b98fd04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:19:24,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:19:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 06:19:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 06:19:24,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:19:24,018 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:19:24,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:19:24,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1733438896, now seen corresponding path program 1 times [2023-12-24 06:19:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:19:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203723071] [2023-12-24 06:19:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:19:24,036 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:19:24,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:19:24,038 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:19:24,068 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:19:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:19:24,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:19:24,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:19:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-12-24 06:19:24,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:19:24,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:19:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203723071] [2023-12-24 06:19:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203723071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:19:24,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:19:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:19:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412989529] [2023-12-24 06:19:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:19:24,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:19:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:19:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:19:24,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:19:24,349 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 06:19:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:19:24,414 INFO L93 Difference]: Finished difference Result 65 states and 111 transitions. [2023-12-24 06:19:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:19:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 78 [2023-12-24 06:19:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:19:24,421 INFO L225 Difference]: With dead ends: 65 [2023-12-24 06:19:24,421 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 06:19:24,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:19:24,426 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 06:19:24,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 06:19:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 06:19:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-24 06:19:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 06:19:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-12-24 06:19:24,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 78 [2023-12-24 06:19:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:19:24,496 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-12-24 06:19:24,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-24 06:19:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-12-24 06:19:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 06:19:24,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:19:24,503 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:24,520 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:19:24,722 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:19:24,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:19:24,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:19:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash 12672878, now seen corresponding path program 1 times [2023-12-24 06:19:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:19:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494474289] [2023-12-24 06:19:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:19:24,724 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:19:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:19:24,727 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:19:24,784 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:19:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:19:24,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 06:19:24,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:19:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 06:19:25,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:19:25,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:19:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494474289] [2023-12-24 06:19:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494474289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:19:25,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:19:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 06:19:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823073100] [2023-12-24 06:19:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:19:25,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 06:19:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:19:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 06:19:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 06:19:25,911 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 06:19:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:19:27,425 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2023-12-24 06:19:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 06:19:27,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 78 [2023-12-24 06:19:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:19:27,428 INFO L225 Difference]: With dead ends: 72 [2023-12-24 06:19:27,428 INFO L226 Difference]: Without dead ends: 70 [2023-12-24 06:19:27,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2023-12-24 06:19:27,429 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 06:19:27,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 118 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 06:19:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-24 06:19:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2023-12-24 06:19:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 06:19:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2023-12-24 06:19:27,463 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 78 [2023-12-24 06:19:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:19:27,465 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2023-12-24 06:19:27,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 06:19:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2023-12-24 06:19:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 06:19:27,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:19:27,467 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 06:19:27,671 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:19:27,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:19:27,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:19:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 12732460, now seen corresponding path program 1 times [2023-12-24 06:19:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:19:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672843335] [2023-12-24 06:19:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:19:27,673 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:19:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:19:27,681 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:19:27,727 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:19:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:19:27,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 06:19:27,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:19:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-24 06:19:28,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:19:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 06:19:32,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:19:32,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672843335] [2023-12-24 06:19:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672843335] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 06:19:32,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 06:19:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2023-12-24 06:19:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999444858] [2023-12-24 06:19:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:19:32,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 06:19:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:19:32,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 06:19:32,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-24 06:19:32,135 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 06:19:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:19:34,890 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-12-24 06:19:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 06:19:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 78 [2023-12-24 06:19:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:19:34,893 INFO L225 Difference]: With dead ends: 68 [2023-12-24 06:19:34,893 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:19:34,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-12-24 06:19:34,895 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 06:19:34,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 06:19:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:19:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:19:34,896 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:19:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:19:34,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2023-12-24 06:19:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:19:34,896 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:19:34,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-24 06:19:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:19:34,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:19:34,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:19:34,907 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:19:35,105 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:19:35,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:19:41,481 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-24 06:19:41,481 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,481 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:19:41,482 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,482 INFO L895 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,482 INFO L895 garLoopResultBuilder]: At program point L73-2(lines 73 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L73-3(lines 73 79) no Hoare annotation was computed. [2023-12-24 06:19:41,482 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,483 INFO L895 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,483 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 06:19:41,483 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 42 63) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-12-24 06:19:41,483 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,484 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:19:41,484 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-24 06:19:41,484 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 41) no Hoare annotation was computed. [2023-12-24 06:19:41,484 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,484 INFO L895 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,484 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-12-24 06:19:41,484 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,484 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) (fp.geq ~var_1_11~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:19:41,485 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:19:41,485 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:19:41,485 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:19:41,485 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:19:41,487 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 06:19:41,491 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:19:41,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:19:41,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:19:41,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:19:41,524 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:19:41,524 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:19:41,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:19:41 BoogieIcfgContainer [2023-12-24 06:19:41,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:19:41,525 INFO L158 Benchmark]: Toolchain (without parser) took 18708.97ms. Allocated memory was 289.4MB in the beginning and 361.8MB in the end (delta: 72.4MB). Free memory was 234.7MB in the beginning and 158.0MB in the end (delta: 76.8MB). Peak memory consumption was 149.7MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,525 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 205.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:19:41,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.94ms. Allocated memory is still 289.4MB. Free memory was 234.3MB in the beginning and 222.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.12ms. Allocated memory is still 289.4MB. Free memory was 222.1MB in the beginning and 220.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,526 INFO L158 Benchmark]: Boogie Preprocessor took 76.87ms. Allocated memory is still 289.4MB. Free memory was 220.1MB in the beginning and 218.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,526 INFO L158 Benchmark]: RCFGBuilder took 513.04ms. Allocated memory is still 289.4MB. Free memory was 218.0MB in the beginning and 203.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,526 INFO L158 Benchmark]: TraceAbstraction took 17595.60ms. Allocated memory was 289.4MB in the beginning and 361.8MB in the end (delta: 72.4MB). Free memory was 202.8MB in the beginning and 158.0MB in the end (delta: 44.8MB). Peak memory consumption was 118.2MB. Max. memory is 8.0GB. [2023-12-24 06:19:41,528 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.16ms. Allocated memory is still 205.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 439.94ms. Allocated memory is still 289.4MB. Free memory was 234.3MB in the beginning and 222.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.12ms. Allocated memory is still 289.4MB. Free memory was 222.1MB in the beginning and 220.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.87ms. Allocated memory is still 289.4MB. Free memory was 220.1MB in the beginning and 218.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.04ms. Allocated memory is still 289.4MB. Free memory was 218.0MB in the beginning and 203.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17595.60ms. Allocated memory was 289.4MB in the beginning and 361.8MB in the end (delta: 72.4MB). Free memory was 202.8MB in the beginning and 158.0MB in the end (delta: 44.8MB). Peak memory consumption was 118.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 114 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 30, 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 50 PreInvPairs, 76 NumberOfFragments, 485 HoareAnnotationTreeSize, 50 FormulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FormulaSimplificationsInter, 2858 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 308 ConstructedInterpolants, 5 QuantifiedInterpolants, 1370 SizeOfPredicates, 39 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1242/1248 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: 73]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 06:19:41,568 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...