/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:25:26,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:25:26,273 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:25:26,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:25:26,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:25:26,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:25:26,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:25:26,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:25:26,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:25:26,304 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:25:26,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:25:26,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:25:26,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:25:26,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:25:26,305 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:25:26,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:25:26,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:25:26,306 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:25:26,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:25:26,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:25:26,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:25:26,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:25:26,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:25:26,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:25:26,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:25:26,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:25:26,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:25:26,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:25:26,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:25:26,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:25:26,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:25:26,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:25:26,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:25:26,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:25:26,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:25:26,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:25:26,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:25:26,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:25:26,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:25:26,317 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:25:26,317 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:25:26,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:25:26,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:25:26,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:25:26,555 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:25:26,555 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:25:26,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2023-12-25 06:25:27,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:25:28,054 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:25:28,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c [2023-12-25 06:25:28,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1b275da/1c1402426d734c178c25d8e32f6f3f22/FLAGe04c562ac [2023-12-25 06:25:28,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f1b275da/1c1402426d734c178c25d8e32f6f3f22 [2023-12-25 06:25:28,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:25:28,083 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:25:28,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:25:28,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:25:28,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:25:28,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab21245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28, skipping insertion in model container [2023-12-25 06:25:28,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,105 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:25:28,235 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c[548,561] [2023-12-25 06:25:28,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:25:28,260 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:25:28,275 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-1.c[548,561] [2023-12-25 06:25:28,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:25:28,291 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:25:28,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28 WrapperNode [2023-12-25 06:25:28,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:25:28,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:25:28,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:25:28,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:25:28,302 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:25:28" (1/1) ... [2023-12-25 06:25:28,310 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:25:28" (1/1) ... [2023-12-25 06:25:28,323 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2023-12-25 06:25:28,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:25:28,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:25:28,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:25:28,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:25:28,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,346 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:25:28,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:25:28,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:25:28,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:25:28,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:25:28,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (1/1) ... [2023-12-25 06:25:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:25:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:25:28,388 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:25:28,414 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:25:28,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:25:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:25:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2023-12-25 06:25:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2023-12-25 06:25:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:25:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:25:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure id [2023-12-25 06:25:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2023-12-25 06:25:28,499 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:25:28,504 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:25:28,660 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:25:28,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:25:28,701 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:25:28,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:25:28 BoogieIcfgContainer [2023-12-25 06:25:28,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:25:28,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:25:28,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:25:28,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:25:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:25:28" (1/3) ... [2023-12-25 06:25:28,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c3d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:25:28, skipping insertion in model container [2023-12-25 06:25:28,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:25:28" (2/3) ... [2023-12-25 06:25:28,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539c3d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:25:28, skipping insertion in model container [2023-12-25 06:25:28,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:25:28" (3/3) ... [2023-12-25 06:25:28,715 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2023-12-25 06:25:28,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:25:28,734 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:25:28,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:25:28,799 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;@21fae3a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:25:28,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:25:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:25:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:25:28,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:28,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:28,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:28,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash -406374326, now seen corresponding path program 1 times [2023-12-25 06:25:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:28,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939481017] [2023-12-25 06:25:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:25:28,833 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:25:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:28,836 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:25:28,837 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:25:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:25:28,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:25:28,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:25:28,965 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:25:28,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:25:28,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:25:28,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939481017] [2023-12-25 06:25:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939481017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:25:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:25:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:25:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776631954] [2023-12-25 06:25:28,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:25:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:25:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:25:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:25:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:25:29,002 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:25:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:25:29,072 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-25 06:25:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:25:29,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:25:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:25:29,080 INFO L225 Difference]: With dead ends: 28 [2023-12-25 06:25:29,081 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 06:25:29,083 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:25:29,085 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:25:29,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:25:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 06:25:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 06:25:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 06:25:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-12-25 06:25:29,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2023-12-25 06:25:29,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:25:29,112 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-12-25 06:25:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:25:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-12-25 06:25:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:25:29,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:29,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:29,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 06:25:29,316 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:25:29,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:29,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -911562000, now seen corresponding path program 1 times [2023-12-25 06:25:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:29,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578864636] [2023-12-25 06:25:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:25:29,318 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:25:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:29,319 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:25:29,321 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:25:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:25:29,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:25:29,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:25:29,479 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:25:29,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:25:29,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:25:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578864636] [2023-12-25 06:25:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578864636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:25:29,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:25:29,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 06:25:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629672656] [2023-12-25 06:25:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:25:29,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 06:25:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:25:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 06:25:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:25:29,497 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:25:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:25:29,587 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-12-25 06:25:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:25:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2023-12-25 06:25:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:25:29,589 INFO L225 Difference]: With dead ends: 29 [2023-12-25 06:25:29,589 INFO L226 Difference]: Without dead ends: 25 [2023-12-25 06:25:29,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:25:29,592 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:25:29,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:25:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-25 06:25:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-12-25 06:25:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:25:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-25 06:25:29,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2023-12-25 06:25:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:25:29,604 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-25 06:25:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:25:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-25 06:25:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:25:29,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:29,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:29,621 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:25:29,807 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:25:29,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:29,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -941711854, now seen corresponding path program 1 times [2023-12-25 06:25:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:29,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805757393] [2023-12-25 06:25:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:25:29,810 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:25:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:29,812 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:25:29,821 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:25:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:25:29,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:25:29,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:25:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:25:29,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:25:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:25:30,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:25:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805757393] [2023-12-25 06:25:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805757393] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:25:30,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:25:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:25:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652602464] [2023-12-25 06:25:30,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:25:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:25:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:25:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:25:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:25:30,144 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 06:25:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:25:30,221 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-12-25 06:25:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:25:30,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 21 [2023-12-25 06:25:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:25:30,222 INFO L225 Difference]: With dead ends: 35 [2023-12-25 06:25:30,222 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 06:25:30,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:25:30,223 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:25:30,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:25:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 06:25:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2023-12-25 06:25:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-25 06:25:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-25 06:25:30,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2023-12-25 06:25:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:25:30,228 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-25 06:25:30,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 06:25:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-25 06:25:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 06:25:30,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:30,229 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:30,232 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:25:30,431 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:25:30,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:30,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1503676104, now seen corresponding path program 1 times [2023-12-25 06:25:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879190833] [2023-12-25 06:25:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:25:30,433 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:25:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:30,434 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:25:30,440 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:25:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:25:30,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:25:30,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:25:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 06:25:30,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:25:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:25:30,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:25:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879190833] [2023-12-25 06:25:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879190833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:25:30,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:25:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:25:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108776744] [2023-12-25 06:25:30,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:25:30,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:25:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:25:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:25:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:25:30,945 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:25:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:25:31,132 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2023-12-25 06:25:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:25:31,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 27 [2023-12-25 06:25:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:25:31,135 INFO L225 Difference]: With dead ends: 41 [2023-12-25 06:25:31,135 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:25:31,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:25:31,141 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:25:31,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:25:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:25:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-12-25 06:25:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-25 06:25:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-12-25 06:25:31,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2023-12-25 06:25:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:25:31,152 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-12-25 06:25:31,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:25:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-12-25 06:25:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:25:31,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:31,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:31,171 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:25:31,355 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:25:31,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:31,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1206630438, now seen corresponding path program 2 times [2023-12-25 06:25:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097849943] [2023-12-25 06:25:31,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:25:31,358 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:25:31,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:31,362 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:25:31,366 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:25:31,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:25:31,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:25:31,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:25:31,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:25:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 06:25:31,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:25:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:25:31,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:25:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097849943] [2023-12-25 06:25:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097849943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:25:31,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:25:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:25:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815486384] [2023-12-25 06:25:31,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:25:31,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:25:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:25:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:25:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:25:31,809 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 06:25:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:25:31,934 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-12-25 06:25:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:25:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) Word has length 33 [2023-12-25 06:25:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:25:31,936 INFO L225 Difference]: With dead ends: 47 [2023-12-25 06:25:31,936 INFO L226 Difference]: Without dead ends: 43 [2023-12-25 06:25:31,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:25:31,937 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:25:31,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:25:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-25 06:25:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-12-25 06:25:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-25 06:25:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-12-25 06:25:31,940 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2023-12-25 06:25:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:25:31,941 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-12-25 06:25:31,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 06:25:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-12-25 06:25:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 06:25:31,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:25:31,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:25:31,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 06:25:32,157 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:25:32,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:25:32,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:25:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash -415290496, now seen corresponding path program 2 times [2023-12-25 06:25:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:25:32,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162962135] [2023-12-25 06:25:32,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:25:32,159 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:25:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:25:32,169 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:25:32,212 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:25:32,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:25:32,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 06:25:32,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:25:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:25:32,344 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:25:32,345 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:25:32,346 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:25:32,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 06:25:32,567 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:25:32,571 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2023-12-25 06:25:32,575 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:25:32,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:25:32 BoogieIcfgContainer [2023-12-25 06:25:32,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:25:32,625 INFO L158 Benchmark]: Toolchain (without parser) took 4541.79ms. Allocated memory was 220.2MB in the beginning and 273.7MB in the end (delta: 53.5MB). Free memory was 171.8MB in the beginning and 207.2MB in the end (delta: -35.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-25 06:25:32,625 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 220.2MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:25:32,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.80ms. Allocated memory is still 220.2MB. Free memory was 171.5MB in the beginning and 160.7MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:25:32,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.19ms. Allocated memory is still 220.2MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:25:32,627 INFO L158 Benchmark]: Boogie Preprocessor took 29.66ms. Allocated memory is still 220.2MB. Free memory was 159.2MB in the beginning and 157.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:25:32,627 INFO L158 Benchmark]: RCFGBuilder took 347.23ms. Allocated memory is still 220.2MB. Free memory was 157.5MB in the beginning and 146.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:25:32,627 INFO L158 Benchmark]: TraceAbstraction took 3917.19ms. Allocated memory was 220.2MB in the beginning and 273.7MB in the end (delta: 53.5MB). Free memory was 146.0MB in the beginning and 207.2MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:25:32,639 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.11ms. Allocated memory is still 220.2MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.80ms. Allocated memory is still 220.2MB. Free memory was 171.5MB in the beginning and 160.7MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.19ms. Allocated memory is still 220.2MB. Free memory was 160.7MB in the beginning and 159.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.66ms. Allocated memory is still 220.2MB. Free memory was 159.2MB in the beginning and 157.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 347.23ms. Allocated memory is still 220.2MB. Free memory was 157.5MB in the beginning and 146.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3917.19ms. Allocated memory was 220.2MB in the beginning and 273.7MB in the end (delta: 53.5MB). Free memory was 146.0MB in the beginning and 207.2MB in the end (delta: -61.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L20] int input = 5; VAL [input=5] [L21] CALL, EXPR id(input) VAL [\old(x)=5] [L10] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=4] [L15] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L16] CALL, EXPR id(x-1) VAL [\old(x)=3] [L10] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=2] [L15] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L16] CALL, EXPR id(x-1) VAL [\old(x)=1] [L10] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L11] CALL, EXPR id2(x-1) VAL [\old(x)=0] [L15] COND TRUE x==0 [L15] return 0; VAL [\old(x)=0, \result=0, x=0] [L11] RET, EXPR id2(x-1) VAL [\old(x)=1, x=1] [L11] return id2(x-1) + 1; [L16] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L16] return id(x-1) + 1; [L11] RET, EXPR id2(x-1) VAL [\old(x)=3, x=3] [L11] return id2(x-1) + 1; [L16] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L16] return id(x-1) + 1; [L11] RET, EXPR id2(x-1) VAL [\old(x)=5, x=5] [L11] return id2(x-1) + 1; [L21] RET, EXPR id(input) VAL [input=5] [L21] int result = id(input); [L22] COND TRUE result == 5 VAL [input=5, result=5] [L23] reach_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 490 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 388 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 80 mSDtfsCounter, 388 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 SizeOfPredicates, 15 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 24/68 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:25:32,655 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...