/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 00:36:20,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 00:36:20,763 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 00:36:20,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 00:36:20,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 00:36:20,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 00:36:20,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 00:36:20,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 00:36:20,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 00:36:20,785 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 00:36:20,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 00:36:20,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 00:36:20,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 00:36:20,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 00:36:20,787 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 00:36:20,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 00:36:20,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 00:36:20,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 00:36:20,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 00:36:20,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 00:36:20,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 00:36:20,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 00:36:20,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 00:36:20,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 00:36:20,790 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 00:36:20,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 00:36:20,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 00:36:20,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 00:36:20,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 00:36:20,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 00:36:20,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 00:36:20,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 00:36:20,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 00:36:20,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 00:36:20,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:36:20,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 00:36:20,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 00:36:20,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 00:36:20,793 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 00:36:20,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 00:36:20,795 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 00:36:20,795 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 00:36:20,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 00:36:21,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 00:36:21,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 00:36:21,009 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 00:36:21,010 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 00:36:21,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2023-12-24 00:36:22,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 00:36:22,403 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 00:36:22,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i [2023-12-24 00:36:22,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9da7adc4/6cee42fc90d94d528b18a7e70b126e2c/FLAG21d2b6f5f [2023-12-24 00:36:22,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9da7adc4/6cee42fc90d94d528b18a7e70b126e2c [2023-12-24 00:36:22,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 00:36:22,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 00:36:22,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 00:36:22,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 00:36:22,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 00:36:22,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e611cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22, skipping insertion in model container [2023-12-24 00:36:22,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,456 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 00:36:22,583 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2023-12-24 00:36:22,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:36:22,639 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 00:36:22,650 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-56.i[915,928] [2023-12-24 00:36:22,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:36:22,694 INFO L206 MainTranslator]: Completed translation [2023-12-24 00:36:22,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22 WrapperNode [2023-12-24 00:36:22,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 00:36:22,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 00:36:22,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 00:36:22,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 00:36:22,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,734 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2023-12-24 00:36:22,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 00:36:22,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 00:36:22,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 00:36:22,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 00:36:22,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,766 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 00:36:22,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 00:36:22,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 00:36:22,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 00:36:22,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 00:36:22,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (1/1) ... [2023-12-24 00:36:22,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:36:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 00:36:22,825 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 00:36:22,849 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 00:36:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 00:36:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 00:36:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 00:36:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 00:36:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 00:36:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 00:36:22,953 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 00:36:22,957 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 00:36:23,257 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 00:36:23,298 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 00:36:23,299 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 00:36:23,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:36:23 BoogieIcfgContainer [2023-12-24 00:36:23,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 00:36:23,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 00:36:23,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 00:36:23,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 00:36:23,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:36:22" (1/3) ... [2023-12-24 00:36:23,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:36:23, skipping insertion in model container [2023-12-24 00:36:23,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:36:22" (2/3) ... [2023-12-24 00:36:23,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5d62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:36:23, skipping insertion in model container [2023-12-24 00:36:23,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:36:23" (3/3) ... [2023-12-24 00:36:23,307 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-56.i [2023-12-24 00:36:23,322 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 00:36:23,322 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 00:36:23,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 00:36:23,378 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;@4ffff8ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 00:36:23,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 00:36:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 00:36:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 00:36:23,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:36:23,397 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, 1, 1, 1] [2023-12-24 00:36:23,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:36:23,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:36:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1980098485, now seen corresponding path program 1 times [2023-12-24 00:36:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:36:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97684427] [2023-12-24 00:36:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:36:23,413 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 00:36:23,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:36:23,414 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 00:36:23,416 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 00:36:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:36:23,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 00:36:23,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:36:23,578 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 00:36:23,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:36:23,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:36:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97684427] [2023-12-24 00:36:23,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97684427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:36:23,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:36:23,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 00:36:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456759485] [2023-12-24 00:36:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:36:23,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 00:36:23,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:36:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 00:36:23,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 00:36:23,628 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 00:36:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:36:23,693 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2023-12-24 00:36:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 00:36:23,695 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, (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 65 [2023-12-24 00:36:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:36:23,700 INFO L225 Difference]: With dead ends: 69 [2023-12-24 00:36:23,700 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 00:36:23,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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 00:36:23,706 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 00:36:23,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 00:36:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 00:36:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 00:36:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 00:36:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2023-12-24 00:36:23,739 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2023-12-24 00:36:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:36:23,740 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2023-12-24 00:36:23,740 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, (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 00:36:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2023-12-24 00:36:23,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 00:36:23,742 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:36:23,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, 1, 1, 1] [2023-12-24 00:36:23,748 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 00:36:23,947 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 00:36:23,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:36:23,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:36:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash 955276917, now seen corresponding path program 1 times [2023-12-24 00:36:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:36:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099887843] [2023-12-24 00:36:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:36:23,950 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 00:36:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:36:23,951 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 00:36:23,952 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 00:36:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:36:24,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 00:36:24,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:36:24,458 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 00:36:24,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:36:24,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:36:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099887843] [2023-12-24 00:36:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099887843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:36:24,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:36:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 00:36:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455116041] [2023-12-24 00:36:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:36:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 00:36:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:36:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 00:36:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 00:36:24,462 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 00:36:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:36:24,703 INFO L93 Difference]: Finished difference Result 98 states and 140 transitions. [2023-12-24 00:36:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 00:36:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 65 [2023-12-24 00:36:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:36:24,705 INFO L225 Difference]: With dead ends: 98 [2023-12-24 00:36:24,705 INFO L226 Difference]: Without dead ends: 66 [2023-12-24 00:36:24,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 00:36:24,706 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 00:36:24,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 116 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 00:36:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-24 00:36:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-24 00:36:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 00:36:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2023-12-24 00:36:24,725 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 65 [2023-12-24 00:36:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:36:24,726 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2023-12-24 00:36:24,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 00:36:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2023-12-24 00:36:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-24 00:36:24,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:36:24,728 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, 1, 1, 1] [2023-12-24 00:36:24,738 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 00:36:24,945 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 00:36:24,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:36:24,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:36:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 145930291, now seen corresponding path program 1 times [2023-12-24 00:36:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:36:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796469034] [2023-12-24 00:36:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:36:24,947 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 00:36:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:36:24,949 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 00:36:24,951 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 00:36:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:36:25,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 00:36:25,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:38:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-24 00:38:13,971 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:39:43,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:39:43,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796469034] [2023-12-24 00:39:43,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796469034] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:39:43,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1932086130] [2023-12-24 00:39:43,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:39:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 00:39:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 00:39:43,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 00:39:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 00:39:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:39:43,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 00:39:43,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:40:12,096 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 00:40:12,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:40:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1932086130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:40:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 00:40:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2023-12-24 00:40:12,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066564350] [2023-12-24 00:40:12,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:40:12,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 00:40:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:40:12,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 00:40:12,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2023-12-24 00:40:12,100 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 00:40:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:40:13,987 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2023-12-24 00:40:13,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 00:40:13,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 65 [2023-12-24 00:40:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:40:13,989 INFO L225 Difference]: With dead ends: 107 [2023-12-24 00:40:13,990 INFO L226 Difference]: Without dead ends: 105 [2023-12-24 00:40:13,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2023-12-24 00:40:13,991 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 00:40:13,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 139 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 00:40:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-24 00:40:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2023-12-24 00:40:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-24 00:40:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2023-12-24 00:40:14,010 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 65 [2023-12-24 00:40:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:40:14,011 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2023-12-24 00:40:14,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 00:40:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2023-12-24 00:40:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-24 00:40:14,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:40:14,012 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, 1, 1, 1, 1] [2023-12-24 00:40:14,017 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 00:40:14,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-24 00:40:14,414 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 00:40:14,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:40:14,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:40:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1506564052, now seen corresponding path program 1 times [2023-12-24 00:40:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:40:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488061596] [2023-12-24 00:40:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:40:14,416 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 00:40:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:40:14,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 00:40:14,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 00:40:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:40:14,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 00:40:14,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:43:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 33 proven. 63 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 00:43:37,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:44:37,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:44:37,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488061596] [2023-12-24 00:44:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488061596] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:44:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1216108044] [2023-12-24 00:44:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:44:37,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 00:44:37,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 00:44:37,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 00:44:37,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 00:44:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:44:37,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 00:44:37,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:44:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 00:44:37,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:44:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1216108044] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:44:40,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 00:44:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 21 [2023-12-24 00:44:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848189736] [2023-12-24 00:44:40,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 00:44:40,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-24 00:44:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:44:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-24 00:44:40,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2023-12-24 00:44:40,233 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 00:44:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:44:42,720 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2023-12-24 00:44:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-24 00:44:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 66 [2023-12-24 00:44:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:44:42,722 INFO L225 Difference]: With dead ends: 162 [2023-12-24 00:44:42,722 INFO L226 Difference]: Without dead ends: 93 [2023-12-24 00:44:42,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=486, Invalid=2270, Unknown=0, NotChecked=0, Total=2756 [2023-12-24 00:44:42,724 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 00:44:42,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 203 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 00:44:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-24 00:44:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2023-12-24 00:44:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 00:44:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2023-12-24 00:44:42,736 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 66 [2023-12-24 00:44:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:44:42,736 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2023-12-24 00:44:42,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 6 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-12-24 00:44:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2023-12-24 00:44:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-24 00:44:42,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:44:42,739 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 00:44:42,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 00:44:42,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 00:44:43,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 00:44:43,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:44:43,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:44:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1244456667, now seen corresponding path program 1 times [2023-12-24 00:44:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:44:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870572926] [2023-12-24 00:44:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:44:43,142 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 00:44:43,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:44:43,143 INFO L229 MonitoredProcess]: Starting monitored process 8 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 00:44:43,144 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 (8)] Waiting until timeout for monitored process [2023-12-24 00:44:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:44:43,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 00:44:43,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:44:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 422 proven. 1 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-24 00:44:43,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:44:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-24 00:44:43,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:44:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870572926] [2023-12-24 00:44:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870572926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 00:44:43,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 00:44:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 00:44:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683008231] [2023-12-24 00:44:43,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 00:44:43,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:44:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:44:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:44:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:44:43,422 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2023-12-24 00:44:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:44:43,489 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-12-24 00:44:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 00:44:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 129 [2023-12-24 00:44:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:44:43,490 INFO L225 Difference]: With dead ends: 89 [2023-12-24 00:44:43,491 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 00:44:43,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:44:43,492 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:44:43,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 00:44:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 00:44:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 00:44:43,493 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 00:44:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 00:44:43,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2023-12-24 00:44:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:44:43,494 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 00:44:43,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2023-12-24 00:44:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 00:44:43,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 00:44:43,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 00:44:43,504 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 (8)] Forceful destruction successful, exit code 0 [2023-12-24 00:44:43,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 00:44:43,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 00:44:44,000 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-12-24 00:44:44,000 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 54) no Hoare annotation was computed. [2023-12-24 00:44:44,000 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 00:44:44,000 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 00:44:44,000 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L899 garLoopResultBuilder]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 40) no Hoare annotation was computed. [2023-12-24 00:44:44,001 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,001 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L895 garLoopResultBuilder]: At program point L86-3(lines 86 92) the Hoare annotation is: (let ((.cse0 (= (_ bv0 16) ~var_1_11~0)) (.cse1 (bvuge ~var_1_10~0 (_ bv1073741823 32)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv1 32))) (let ((.cse2 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse2 (_ bv16 32)) .cse0 (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) .cse1 (bvsge .cse2 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))))) [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point L86-4(lines 86 92) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,002 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,002 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 00:44:44,002 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,003 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,003 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-24 00:44:44,003 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= ~last_1_var_1_11~0 (_ bv0 16)) (= (_ bv0 16) ~var_1_11~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (= (_ bv1 8) ~var_1_1~0)) [2023-12-24 00:44:44,003 INFO L895 garLoopResultBuilder]: At program point L59-1(line 59) the Hoare annotation is: (and (= ~last_1_var_1_11~0 (_ bv0 16)) (= (_ bv0 16) ~var_1_11~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge ((_ sign_extend 24) ~var_1_3~0) (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0)) [2023-12-24 00:44:44,003 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2023-12-24 00:44:44,003 INFO L899 garLoopResultBuilder]: For program point L72(lines 57 73) no Hoare annotation was computed. [2023-12-24 00:44:44,003 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,003 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 24) ~var_1_3~0))) (and (= ~last_1_var_1_11~0 (_ bv0 16)) (bvsle .cse0 (_ bv16 32)) (= (_ bv0 16) ~var_1_11~0) (bvsge ((_ zero_extend 24) ~var_1_5~0) (_ bv127 32)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= (_ bv1 8) ~last_1_var_1_1~0) (bvuge ~var_1_10~0 (_ bv1073741823 32)) (bvsge .cse0 (_ bv0 32)) (= (_ bv1 8) ~var_1_1~0))) [2023-12-24 00:44:44,003 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 56) no Hoare annotation was computed. [2023-12-24 00:44:44,003 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 00:44:44,003 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 00:44:44,004 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 00:44:44,004 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 00:44:44,006 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 00:44:44,008 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 00:44:44,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:44:44 BoogieIcfgContainer [2023-12-24 00:44:44,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 00:44:44,023 INFO L158 Benchmark]: Toolchain (without parser) took 501598.92ms. Allocated memory was 353.4MB in the beginning and 1.0GB in the end (delta: 678.4MB). Free memory was 300.8MB in the beginning and 682.8MB in the end (delta: -382.0MB). Peak memory consumption was 297.0MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,023 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 211.8MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 00:44:44,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.14ms. Allocated memory is still 353.4MB. Free memory was 300.3MB in the beginning and 287.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.09ms. Allocated memory is still 353.4MB. Free memory was 287.7MB in the beginning and 285.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,025 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 353.4MB. Free memory was 285.6MB in the beginning and 283.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,025 INFO L158 Benchmark]: RCFGBuilder took 511.95ms. Allocated memory is still 353.4MB. Free memory was 283.0MB in the beginning and 264.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,025 INFO L158 Benchmark]: TraceAbstraction took 500721.05ms. Allocated memory was 353.4MB in the beginning and 1.0GB in the end (delta: 678.4MB). Free memory was 263.1MB in the beginning and 682.8MB in the end (delta: -419.7MB). Peak memory consumption was 259.2MB. Max. memory is 8.0GB. [2023-12-24 00:44:44,027 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 211.8MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.14ms. Allocated memory is still 353.4MB. Free memory was 300.3MB in the beginning and 287.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.09ms. Allocated memory is still 353.4MB. Free memory was 287.7MB in the beginning and 285.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 353.4MB. Free memory was 285.6MB in the beginning and 283.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 511.95ms. Allocated memory is still 353.4MB. Free memory was 283.0MB in the beginning and 264.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 500721.05ms. Allocated memory was 353.4MB in the beginning and 1.0GB in the end (delta: 678.4MB). Free memory was 263.1MB in the beginning and 682.8MB in the end (delta: -419.7MB). Peak memory consumption was 259.2MB. 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 500.7s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 590 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 186 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=3, InterpolantAutomatonStates: 47, 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, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 71 PreInvPairs, 83 NumberOfFragments, 326 HoareAnnotationTreeSize, 71 FormulaSimplifications, 90 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 366 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 493.2s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 3488 SizeOfPredicates, 65 NumberOfNonLiveVariables, 931 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 2560/2646 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: 86]: Loop Invariant Derived loop invariant: ((((0 == var_1_11) && (var_1_10 >= 1073741823)) && (k_loop == 1)) || (((((((((last_1_var_1_11 == 0) && (var_1_3 <= 16)) && (0 == var_1_11)) && (var_1_5 >= 127)) && (k_loop == 0)) && (1 == last_1_var_1_1)) && (var_1_10 >= 1073741823)) && (var_1_3 >= 0)) && (1 == var_1_1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 00:44:44,104 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...