/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/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:05:26,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:05:26,688 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:05:26,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:05:26,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:05:26,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:05:26,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:05:26,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:05:26,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:05:26,730 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:05:26,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:05:26,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:05:26,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:05:26,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:05:26,732 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:05:26,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:05:26,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:05:26,733 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:05:26,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:05:26,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:05:26,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:05:26,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:05:26,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:05:26,735 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:05:26,735 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:05:26,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:05:26,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:05:26,736 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:05:26,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:05:26,736 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:05:26,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:05:26,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:05:26,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:05:26,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:05:26,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:26,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:05:26,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:05:26,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:05:26,739 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:05:26,739 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:05:26,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:05:26,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:05:26,740 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:05:26,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:05:26,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:05:26,741 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:05:26,741 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:05:26,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:05:27,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:05:27,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:05:27,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:05:27,019 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:05:27,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-25 06:05:28,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:05:28,466 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:05:28,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-25 06:05:28,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318657fdd/86afefd6851f44cbb719ad67c641f090/FLAG7b5255ea4 [2023-12-25 06:05:28,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/318657fdd/86afefd6851f44cbb719ad67c641f090 [2023-12-25 06:05:28,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:05:28,495 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:05:28,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:28,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:05:28,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:05:28,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d48e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28, skipping insertion in model container [2023-12-25 06:05:28,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:05:28,680 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/Fibonacci04.c[780,793] [2023-12-25 06:05:28,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:28,703 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:05:28,715 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/Fibonacci04.c[780,793] [2023-12-25 06:05:28,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:28,733 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:05:28,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28 WrapperNode [2023-12-25 06:05:28,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:28,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:28,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:05:28,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:05:28,740 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:05:28" (1/1) ... [2023-12-25 06:05:28,746 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:05:28" (1/1) ... [2023-12-25 06:05:28,761 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2023-12-25 06:05:28,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:28,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:05:28,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:05:28,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:05:28,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,784 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:05:28,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:05:28,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:05:28,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:05:28,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:05:28,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (1/1) ... [2023-12-25 06:05:28,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:28,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:05:28,828 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:05:28,857 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:05:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-25 06:05:28,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-25 06:05:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:05:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:05:28,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:05:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:05:28,954 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:05:28,958 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:05:29,108 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:05:29,148 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:05:29,148 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:05:29,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:29 BoogieIcfgContainer [2023-12-25 06:05:29,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:05:29,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:05:29,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:05:29,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:05:29,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:05:28" (1/3) ... [2023-12-25 06:05:29,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:29, skipping insertion in model container [2023-12-25 06:05:29,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:28" (2/3) ... [2023-12-25 06:05:29,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1a9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:29, skipping insertion in model container [2023-12-25 06:05:29,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:29" (3/3) ... [2023-12-25 06:05:29,157 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-12-25 06:05:29,171 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:05:29,172 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:05:29,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:05:29,218 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;@4f146f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:05:29,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:05:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:05:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:05:29,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:29,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:29,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:29,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1551711717, now seen corresponding path program 1 times [2023-12-25 06:05:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392589032] [2023-12-25 06:05:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:29,256 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:05:29,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:29,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:29,262 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:05:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:29,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:05:29,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:29,453 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:05:29,453 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:05:29,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392589032] [2023-12-25 06:05:29,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392589032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:05:29,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:05:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:05:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940463237] [2023-12-25 06:05:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:05:29,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:05:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:05:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:05:29,498 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:05:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:29,623 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-12-25 06:05:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:05:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:05:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:29,632 INFO L225 Difference]: With dead ends: 25 [2023-12-25 06:05:29,633 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 06:05:29,635 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:05:29,640 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:29,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 06:05:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 06:05:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-25 06:05:29,682 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2023-12-25 06:05:29,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:29,682 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-25 06:05:29,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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:05:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-25 06:05:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:05:29,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:29,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:29,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 06:05:29,887 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:05:29,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:29,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash -133880903, now seen corresponding path program 1 times [2023-12-25 06:05:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116517774] [2023-12-25 06:05:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:29,890 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:05:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:29,891 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:05:29,893 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:05:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:29,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:05:29,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:29,968 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:05:29,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:05:29,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116517774] [2023-12-25 06:05:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116517774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:05:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:05:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:05:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867855868] [2023-12-25 06:05:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:05:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:05:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:05:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:05:29,974 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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:05:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:30,048 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2023-12-25 06:05:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:05:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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:05:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:30,052 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:05:30,052 INFO L226 Difference]: Without dead ends: 18 [2023-12-25 06:05:30,053 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:05:30,056 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:30,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-25 06:05:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-12-25 06:05:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-25 06:05:30,071 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2023-12-25 06:05:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:30,071 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-25 06:05:30,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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:05:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-25 06:05:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:05:30,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:30,073 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:30,083 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-25 06:05:30,276 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:05:30,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:30,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:30,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1313483099, now seen corresponding path program 1 times [2023-12-25 06:05:30,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:30,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118749743] [2023-12-25 06:05:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:30,279 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:05:30,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:30,280 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:05:30,284 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:05:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:30,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 06:05:30,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:05:30,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:05:30,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118749743] [2023-12-25 06:05:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118749743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:30,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2023-12-25 06:05:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998575636] [2023-12-25 06:05:30,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:30,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:05:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:05:30,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:05:30,837 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 06:05:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:31,064 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2023-12-25 06:05:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:05:31,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 21 [2023-12-25 06:05:31,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:31,071 INFO L225 Difference]: With dead ends: 46 [2023-12-25 06:05:31,071 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 06:05:31,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:05:31,078 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:31,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 47 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:05:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 06:05:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-12-25 06:05:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 06:05:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2023-12-25 06:05:31,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 21 [2023-12-25 06:05:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:31,088 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2023-12-25 06:05:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 06:05:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2023-12-25 06:05:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 06:05:31,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:31,091 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:31,096 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-25 06:05:31,291 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:05:31,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:31,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1427602233, now seen corresponding path program 1 times [2023-12-25 06:05:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973520078] [2023-12-25 06:05:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:31,297 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:05:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:31,300 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:05:31,301 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:05:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:31,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:05:31,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 103 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-25 06:05:31,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 29 proven. 60 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-25 06:05:31,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973520078] [2023-12-25 06:05:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973520078] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:31,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2023-12-25 06:05:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469736486] [2023-12-25 06:05:31,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:05:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:05:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:05:31,726 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 06:05:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:31,887 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2023-12-25 06:05:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:05:31,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 62 [2023-12-25 06:05:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:31,889 INFO L225 Difference]: With dead ends: 61 [2023-12-25 06:05:31,889 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 06:05:31,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:05:31,891 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:31,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 42 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 06:05:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2023-12-25 06:05:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (18), 8 states have call predecessors, (18), 6 states have call successors, (18) [2023-12-25 06:05:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2023-12-25 06:05:31,904 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 62 [2023-12-25 06:05:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:31,904 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2023-12-25 06:05:31,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-25 06:05:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2023-12-25 06:05:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 06:05:31,907 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:31,907 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:31,915 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:05:32,113 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:05:32,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:32,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1487826907, now seen corresponding path program 1 times [2023-12-25 06:05:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228269092] [2023-12-25 06:05:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:32,115 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:05:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:32,116 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:05:32,118 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:05:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:32,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 06:05:32,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 215 proven. 10 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-25 06:05:32,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 57 proven. 117 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2023-12-25 06:05:32,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228269092] [2023-12-25 06:05:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228269092] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:32,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:32,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 13 [2023-12-25 06:05:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20749676] [2023-12-25 06:05:32,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:05:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:05:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:05:32,869 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2023-12-25 06:05:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:33,163 INFO L93 Difference]: Finished difference Result 77 states and 135 transitions. [2023-12-25 06:05:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:05:33,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 84 [2023-12-25 06:05:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:33,166 INFO L225 Difference]: With dead ends: 77 [2023-12-25 06:05:33,166 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 06:05:33,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:05:33,168 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:33,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:05:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 06:05:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-25 06:05:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (30), 12 states have call predecessors, (30), 8 states have call successors, (30) [2023-12-25 06:05:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2023-12-25 06:05:33,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 84 [2023-12-25 06:05:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:33,187 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2023-12-25 06:05:33,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 8 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2023-12-25 06:05:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2023-12-25 06:05:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 06:05:33,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:33,190 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:33,196 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:05:33,393 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:05:33,394 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:33,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -448294885, now seen corresponding path program 2 times [2023-12-25 06:05:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068447577] [2023-12-25 06:05:33,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:05:33,396 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:05:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:33,397 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:05:33,398 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:05:33,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:05:33,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:33,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:05:33,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 22 proven. 118 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-12-25 06:05:33,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 22 proven. 133 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-25 06:05:33,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068447577] [2023-12-25 06:05:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068447577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:33,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2023-12-25 06:05:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851868396] [2023-12-25 06:05:33,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:33,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:05:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:05:33,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:05:33,919 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:05:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:34,128 INFO L93 Difference]: Finished difference Result 106 states and 211 transitions. [2023-12-25 06:05:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:05:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 73 [2023-12-25 06:05:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:34,134 INFO L225 Difference]: With dead ends: 106 [2023-12-25 06:05:34,134 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 06:05:34,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:05:34,142 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:34,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 06:05:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2023-12-25 06:05:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 11 states have call successors, (11), 5 states have call predecessors, (11), 11 states have return successors, (45), 17 states have call predecessors, (45), 11 states have call successors, (45) [2023-12-25 06:05:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 94 transitions. [2023-12-25 06:05:34,168 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 94 transitions. Word has length 73 [2023-12-25 06:05:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:34,170 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 94 transitions. [2023-12-25 06:05:34,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:05:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 94 transitions. [2023-12-25 06:05:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-25 06:05:34,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:34,177 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 15, 13, 13, 13, 13, 13, 13, 12, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:34,187 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:34,380 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:05:34,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:34,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 704271687, now seen corresponding path program 3 times [2023-12-25 06:05:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332188724] [2023-12-25 06:05:34,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:05:34,382 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:05:34,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:34,385 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-25 06:05:34,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 (8)] Waiting until timeout for monitored process [2023-12-25 06:05:34,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:05:34,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:34,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 06:05:34,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 513 proven. 5 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2023-12-25 06:05:34,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 409 proven. 15 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2023-12-25 06:05:35,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332188724] [2023-12-25 06:05:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332188724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:35,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2023-12-25 06:05:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793850303] [2023-12-25 06:05:35,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:35,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:05:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:05:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:05:35,163 INFO L87 Difference]: Start difference. First operand 59 states and 94 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-12-25 06:05:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:35,285 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2023-12-25 06:05:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:05:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 167 [2023-12-25 06:05:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:35,286 INFO L225 Difference]: With dead ends: 101 [2023-12-25 06:05:35,286 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 06:05:35,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:05:35,288 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:35,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 06:05:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-25 06:05:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-25 06:05:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-12-25 06:05:35,294 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 167 [2023-12-25 06:05:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:35,295 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-12-25 06:05:35,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-12-25 06:05:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2023-12-25 06:05:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 06:05:35,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:35,296 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:35,302 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-25 06:05:35,498 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-25 06:05:35,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:35,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash 629728387, now seen corresponding path program 4 times [2023-12-25 06:05:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253127135] [2023-12-25 06:05:35,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:05:35,500 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:05:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:35,501 INFO L229 MonitoredProcess]: Starting monitored process 9 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:05:35,503 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 (9)] Waiting until timeout for monitored process [2023-12-25 06:05:35,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:05:35,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 06:05:35,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:05:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:05:35,658 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:05:35,659 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:05:35,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:05:35,673 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:35,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:05:35,864 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-12-25 06:05:35,867 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:05:35,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:05:35 BoogieIcfgContainer [2023-12-25 06:05:35,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:05:35,896 INFO L158 Benchmark]: Toolchain (without parser) took 7401.02ms. Allocated memory is still 277.9MB. Free memory was 223.1MB in the beginning and 91.9MB in the end (delta: 131.2MB). Peak memory consumption was 132.0MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,896 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 210.8MB. Free memory was 159.8MB in the beginning and 159.7MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:05:35,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.22ms. Allocated memory is still 277.9MB. Free memory was 222.9MB in the beginning and 211.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.88ms. Allocated memory is still 277.9MB. Free memory was 211.9MB in the beginning and 210.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,897 INFO L158 Benchmark]: Boogie Preprocessor took 31.83ms. Allocated memory is still 277.9MB. Free memory was 210.6MB in the beginning and 208.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,897 INFO L158 Benchmark]: RCFGBuilder took 353.48ms. Allocated memory is still 277.9MB. Free memory was 208.8MB in the beginning and 198.0MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,897 INFO L158 Benchmark]: TraceAbstraction took 6744.99ms. Allocated memory is still 277.9MB. Free memory was 197.3MB in the beginning and 91.9MB in the end (delta: 105.3MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2023-12-25 06:05:35,899 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 210.8MB. Free memory was 159.8MB in the beginning and 159.7MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.22ms. Allocated memory is still 277.9MB. Free memory was 222.9MB in the beginning and 211.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.88ms. Allocated memory is still 277.9MB. Free memory was 211.9MB in the beginning and 210.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.83ms. Allocated memory is still 277.9MB. Free memory was 210.6MB in the beginning and 208.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 353.48ms. Allocated memory is still 277.9MB. Free memory was 208.8MB in the beginning and 198.0MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6744.99ms. Allocated memory is still 277.9MB. Free memory was 197.3MB in the beginning and 91.9MB in the end (delta: 105.3MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 605 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 87 mSDtfsCounter, 605 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 847 GetRequests, 765 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 524 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 17 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 4796/5264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-25 06:05:35,917 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...