/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/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:20:33,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:20:33,595 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-25 06:20:33,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:20:33,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:20:33,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:20:33,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:20:33,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:20:33,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:20:33,636 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:20:33,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:20:33,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:20:33,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:20:33,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:20:33,639 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:20:33,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:20:33,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:20:33,640 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:20:33,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:20:33,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:20:33,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:20:33,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:20:33,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:20:33,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:20:33,643 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:20:33,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:20:33,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:20:33,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:20:33,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:20:33,644 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:20:33,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:20:33,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:20:33,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:20:33,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:20:33,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:20:33,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:20:33,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:20:33,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:20:33,646 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:20:33,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:20:33,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:20:33,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:20:33,647 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:20:33,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:20:33,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:20:33,648 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:20:33,648 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-25 06:20:33,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:20:33,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:20:33,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:20:33,901 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:20:33,901 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:20:33,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2023-12-25 06:20:35,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:20:36,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:20:36,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2023-12-25 06:20:36,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d937c34b1/031b59bbf1294864829308c011869d88/FLAG2f435001f [2023-12-25 06:20:36,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d937c34b1/031b59bbf1294864829308c011869d88 [2023-12-25 06:20:36,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:20:36,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:20:36,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:20:36,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:20:36,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:20:36,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de48144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36, skipping insertion in model container [2023-12-25 06:20:36,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:20:36,420 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c[946,959] [2023-12-25 06:20:36,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:20:36,440 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:20:36,472 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c[946,959] [2023-12-25 06:20:36,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:20:36,502 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:20:36,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36 WrapperNode [2023-12-25 06:20:36,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:20:36,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:20:36,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:20:36,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:20:36,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,553 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-25 06:20:36,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:20:36,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:20:36,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:20:36,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:20:36,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,598 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-25 06:20:36,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:20:36,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:20:36,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:20:36,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:20:36,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (1/1) ... [2023-12-25 06:20:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:20:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:20:36,651 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-25 06:20:36,735 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-25 06:20:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:20:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:20:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-25 06:20:36,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-25 06:20:36,758 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-25 06:20:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-25 06:20:36,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:20:36,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:20:36,938 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:20:36,940 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:20:37,130 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:20:37,167 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:20:37,167 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:20:37,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:20:37 BoogieIcfgContainer [2023-12-25 06:20:37,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:20:37,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:20:37,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:20:37,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:20:37,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:20:36" (1/3) ... [2023-12-25 06:20:37,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22245dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:20:37, skipping insertion in model container [2023-12-25 06:20:37,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:20:36" (2/3) ... [2023-12-25 06:20:37,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22245dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:20:37, skipping insertion in model container [2023-12-25 06:20:37,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:20:37" (3/3) ... [2023-12-25 06:20:37,179 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2023-12-25 06:20:37,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:20:37,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:20:37,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:20:37,245 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;@300e81bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:20:37,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:20:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:20:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:20:37,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:37,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:37,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:37,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1178273046, now seen corresponding path program 1 times [2023-12-25 06:20:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:37,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205467816] [2023-12-25 06:20:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:37,323 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-25 06:20:37,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:37,331 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-25 06:20:37,386 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-25 06:20:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:37,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:20:37,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:20:37,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:20:37,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205467816] [2023-12-25 06:20:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205467816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:20:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:20:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:20:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748573364] [2023-12-25 06:20:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:20:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:20:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:37,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:20:37,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:20:37,690 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:20:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:37,834 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-12-25 06:20:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:20:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:20:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:37,845 INFO L225 Difference]: With dead ends: 32 [2023-12-25 06:20:37,845 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 06:20:37,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:20:37,868 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:37,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:20:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 06:20:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 06:20:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:20:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:20:37,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2023-12-25 06:20:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:37,914 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:20:37,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:20:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:20:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:20:37,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:37,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:37,922 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-25 06:20:38,118 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-25 06:20:38,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:38,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1422996679, now seen corresponding path program 1 times [2023-12-25 06:20:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977841446] [2023-12-25 06:20:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:38,121 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-25 06:20:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:38,137 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-25 06:20:38,187 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-25 06:20:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:38,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:20:38,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:20:38,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:20:38,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977841446] [2023-12-25 06:20:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977841446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:20:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:20:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:20:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009634149] [2023-12-25 06:20:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:20:38,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:20:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:20:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:20:38,286 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:20:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:38,394 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-12-25 06:20:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:20:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-25 06:20:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:38,395 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:20:38,395 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:20:38,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:20:38,398 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:38,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:20:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:20:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-25 06:20:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:20:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:20:38,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2023-12-25 06:20:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:38,427 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:20:38,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:20:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:20:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:20:38,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:38,431 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:38,444 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-25 06:20:38,633 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-25 06:20:38,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:38,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1917903498, now seen corresponding path program 1 times [2023-12-25 06:20:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948760283] [2023-12-25 06:20:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:38,635 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-25 06:20:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:38,644 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-25 06:20:38,694 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-25 06:20:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:38,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:20:38,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:20:38,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:20:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:20:39,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948760283] [2023-12-25 06:20:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948760283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:20:39,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:20:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:20:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741476641] [2023-12-25 06:20:39,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:20:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:20:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:20:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:20:39,197 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:20:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:39,450 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2023-12-25 06:20:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:20:39,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 21 [2023-12-25 06:20:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:39,452 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:20:39,452 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:20:39,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:20:39,454 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:39,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:20:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:20:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 06:20:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-12-25 06:20:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 06:20:39,461 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2023-12-25 06:20:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:39,462 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 06:20:39,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:20:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 06:20:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 06:20:39,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:39,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:39,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 06:20:39,665 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-25 06:20:39,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:39,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash -773369340, now seen corresponding path program 1 times [2023-12-25 06:20:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141897050] [2023-12-25 06:20:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:39,667 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-25 06:20:39,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:39,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:20:39,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 06:20:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:39,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:20:39,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:20:39,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:20:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:20:39,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141897050] [2023-12-25 06:20:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141897050] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:20:39,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:20:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2023-12-25 06:20:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904588354] [2023-12-25 06:20:40,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:20:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:20:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:20:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:20:40,004 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:20:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:40,138 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2023-12-25 06:20:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:20:40,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-12-25 06:20:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:40,145 INFO L225 Difference]: With dead ends: 41 [2023-12-25 06:20:40,145 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:20:40,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:20:40,150 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:40,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 283 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:20:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:20:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2023-12-25 06:20:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2023-12-25 06:20:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2023-12-25 06:20:40,186 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 22 [2023-12-25 06:20:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:40,186 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2023-12-25 06:20:40,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:20:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2023-12-25 06:20:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 06:20:40,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:40,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:40,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:20:40,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:20:40,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:40,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1759594614, now seen corresponding path program 1 times [2023-12-25 06:20:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896686682] [2023-12-25 06:20:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:40,394 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-25 06:20:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:40,408 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-25 06:20:40,452 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-25 06:20:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:40,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:20:40,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:20:40,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:20:40,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896686682] [2023-12-25 06:20:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896686682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:20:40,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:20:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 06:20:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101365706] [2023-12-25 06:20:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:20:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 06:20:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 06:20:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:20:40,588 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:20:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:40,789 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2023-12-25 06:20:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:20:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 06:20:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:40,792 INFO L225 Difference]: With dead ends: 41 [2023-12-25 06:20:40,793 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:20:40,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:20:40,793 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:40,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:20:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:20:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-12-25 06:20:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-25 06:20:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-12-25 06:20:40,803 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 23 [2023-12-25 06:20:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:40,805 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-12-25 06:20:40,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:20:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-12-25 06:20:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:20:40,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:20:40,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:20:40,815 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 (6)] Ended with exit code 0 [2023-12-25 06:20:41,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-25 06:20:41,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:20:41,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:20:41,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1000055446, now seen corresponding path program 1 times [2023-12-25 06:20:41,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:20:41,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851630073] [2023-12-25 06:20:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:20:41,014 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-25 06:20:41,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:20:41,020 INFO L229 MonitoredProcess]: Starting monitored process 7 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-25 06:20:41,071 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 (7)] Waiting until timeout for monitored process [2023-12-25 06:20:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:20:41,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:20:41,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:20:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 06:20:41,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:20:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 06:20:41,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:20:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851630073] [2023-12-25 06:20:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851630073] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:20:41,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:20:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-12-25 06:20:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882724423] [2023-12-25 06:20:41,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:20:41,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:20:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:20:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:20:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:20:41,461 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:20:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:20:41,596 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2023-12-25 06:20:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:20:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 33 [2023-12-25 06:20:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:20:41,598 INFO L225 Difference]: With dead ends: 34 [2023-12-25 06:20:41,598 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 06:20:41,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:20:41,599 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:20:41,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 41 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:20:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 06:20:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 06:20:41,601 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-25 06:20:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 06:20:41,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-25 06:20:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:20:41,601 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 06:20:41,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:20:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 06:20:41,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 06:20:41,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:20:41,611 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 (7)] Ended with exit code 0 [2023-12-25 06:20:41,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-25 06:20:41,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 06:20:41,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 06:20:41,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2023-12-25 06:20:41,929 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (= |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) [2023-12-25 06:20:41,930 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L899 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2023-12-25 06:20:41,930 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 19 27) the Hoare annotation is: true [2023-12-25 06:20:41,931 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= |fibo2_#in~n| fibo2_~n) (not (= |fibo2_#in~n| (_ bv1 32))) (not (bvslt |fibo2_#in~n| (_ bv1 32)))) [2023-12-25 06:20:41,931 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (= |fibo2_#in~n| fibo2_~n) (not (= |fibo2_#in~n| (_ bv1 32))) (not (bvslt |fibo2_#in~n| (_ bv1 32)))) [2023-12-25 06:20:41,931 INFO L899 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2023-12-25 06:20:41,931 INFO L899 garLoopResultBuilder]: For program point L25-2(line 25) no Hoare annotation was computed. [2023-12-25 06:20:41,931 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2023-12-25 06:20:41,931 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2023-12-25 06:20:41,932 INFO L895 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (= |fibo1_#in~n| fibo1_~n) [2023-12-25 06:20:41,932 INFO L895 garLoopResultBuilder]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse0 (= |fibo1_#in~n| fibo1_~n))) (or (and (not (= |fibo1_#in~n| (_ bv2 32))) .cse0) (and (= |fibo1_#t~ret4| (_ bv1 32)) .cse0))) [2023-12-25 06:20:41,932 INFO L899 garLoopResultBuilder]: For program point L15-2(line 15) no Hoare annotation was computed. [2023-12-25 06:20:41,932 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2023-12-25 06:20:41,932 INFO L899 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2023-12-25 06:20:41,932 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2023-12-25 06:20:41,932 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 17) the Hoare annotation is: true [2023-12-25 06:20:41,932 INFO L899 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2023-12-25 06:20:41,935 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 06:20:41,937 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:20:41,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:20:41 BoogieIcfgContainer [2023-12-25 06:20:41,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:20:41,940 INFO L158 Benchmark]: Toolchain (without parser) took 5816.89ms. Allocated memory is still 242.2MB. Free memory was 186.7MB in the beginning and 178.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2023-12-25 06:20:41,940 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 186.6MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:20:41,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.18ms. Allocated memory is still 242.2MB. Free memory was 186.5MB in the beginning and 175.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:20:41,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.17ms. Allocated memory is still 242.2MB. Free memory was 175.2MB in the beginning and 173.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:20:41,941 INFO L158 Benchmark]: Boogie Preprocessor took 69.65ms. Allocated memory is still 242.2MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:20:41,941 INFO L158 Benchmark]: RCFGBuilder took 543.05ms. Allocated memory is still 242.2MB. Free memory was 172.0MB in the beginning and 160.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:20:41,941 INFO L158 Benchmark]: TraceAbstraction took 4766.72ms. Allocated memory is still 242.2MB. Free memory was 159.9MB in the beginning and 178.2MB in the end (delta: -18.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:20:41,943 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.50ms. Allocated memory is still 186.6MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.18ms. Allocated memory is still 242.2MB. Free memory was 186.5MB in the beginning and 175.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.17ms. Allocated memory is still 242.2MB. Free memory was 175.2MB in the beginning and 173.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.65ms. Allocated memory is still 242.2MB. Free memory was 173.8MB in the beginning and 172.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 543.05ms. Allocated memory is still 242.2MB. Free memory was 172.0MB in the beginning and 160.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4766.72ms. Allocated memory is still 242.2MB. Free memory was 159.9MB in the beginning and 178.2MB in the end (delta: -18.3MB). There was no memory consumed. 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: 41]: 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 473 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 369 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 121 mSDtfsCounter, 369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, InterpolantAutomatonStates: 40, 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, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 22 PreInvPairs, 30 NumberOfFragments, 48 HoareAnnotationTreeSize, 22 FormulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 483 SizeOfPredicates, 8 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 33/53 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 RESULT: Ultimate proved your program to be correct! [2023-12-25 06:20:41,991 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...