/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/Ackermann02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:05:17,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:05:17,795 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:17,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:05:17,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:05:17,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:05:17,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:05:17,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:05:17,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:05:17,855 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:05:17,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:05:17,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:05:17,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:05:17,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:05:17,858 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:05:17,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:05:17,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:05:17,858 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:05:17,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:05:17,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:05:17,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:05:17,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:05:17,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:05:17,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:05:17,861 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:05:17,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:05:17,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:17,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:05:17,862 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:05:17,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:05:17,864 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:05:17,864 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:18,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:05:18,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:05:18,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:05:18,192 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:05:18,201 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:05:18,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann02.c [2023-12-25 06:05:20,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:05:20,284 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:05:20,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c [2023-12-25 06:05:20,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c13a893/3b839ea64fa34405a8463c0859b23603/FLAGee2bbc9f7 [2023-12-25 06:05:20,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c13a893/3b839ea64fa34405a8463c0859b23603 [2023-12-25 06:05:20,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:05:20,324 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:05:20,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:20,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:05:20,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:05:20,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:20" (1/1) ... [2023-12-25 06:05:20,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0411b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:20, skipping insertion in model container [2023-12-25 06:05:20,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:20" (1/1) ... [2023-12-25 06:05:20,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:05:20,641 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/Ackermann02.c[1157,1170] [2023-12-25 06:05:20,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:20,677 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:05:20,707 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/Ackermann02.c[1157,1170] [2023-12-25 06:05:20,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:20,720 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:05:20,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:20 WrapperNode [2023-12-25 06:05:20,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:20,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:20,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:05:20,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:05:20,727 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:20" (1/1) ... [2023-12-25 06:05:20,749 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:20" (1/1) ... [2023-12-25 06:05:20,782 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2023-12-25 06:05:20,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:20,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:05:20,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:05:20,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:05:20,791 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:20" (1/1) ... [2023-12-25 06:05:20,791 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:20" (1/1) ... [2023-12-25 06:05:20,800 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:20" (1/1) ... [2023-12-25 06:05:20,821 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:20,822 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:20" (1/1) ... [2023-12-25 06:05:20,822 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:20" (1/1) ... [2023-12-25 06:05:20,835 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:20" (1/1) ... [2023-12-25 06:05:20,836 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:20" (1/1) ... [2023-12-25 06:05:20,855 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:20" (1/1) ... [2023-12-25 06:05:20,856 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:20" (1/1) ... [2023-12-25 06:05:20,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:05:20,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:05:20,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:05:20,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:05:20,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:20" (1/1) ... [2023-12-25 06:05:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:20,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:05:20,921 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:20,971 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:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:05:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:05:20,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:05:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:05:20,992 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-12-25 06:05:20,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-12-25 06:05:21,065 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:05:21,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:05:21,293 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:05:21,343 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:05:21,343 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:05:21,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:21 BoogieIcfgContainer [2023-12-25 06:05:21,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:05:21,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:05:21,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:05:21,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:05:21,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:05:20" (1/3) ... [2023-12-25 06:05:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4117b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:21, skipping insertion in model container [2023-12-25 06:05:21,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:20" (2/3) ... [2023-12-25 06:05:21,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4117b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:21, skipping insertion in model container [2023-12-25 06:05:21,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:21" (3/3) ... [2023-12-25 06:05:21,375 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2023-12-25 06:05:21,389 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:05:21,404 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:05:21,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:05:21,493 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;@2ead5818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:05:21,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:05:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:05:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-25 06:05:21,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:21,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:21,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:21,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1592058167, now seen corresponding path program 1 times [2023-12-25 06:05:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270307908] [2023-12-25 06:05:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:21,534 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:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:21,552 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:21,608 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:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:21,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:05:21,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:21,872 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:21,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:05:21,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:21,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270307908] [2023-12-25 06:05:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270307908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:05:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:05:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 06:05:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582564202] [2023-12-25 06:05:21,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:05:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:05:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:05:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:05:21,928 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:22,149 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2023-12-25 06:05:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:05:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2023-12-25 06:05:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:22,156 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:05:22,156 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 06:05:22,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:05:22,177 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:22,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 46 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 06:05:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 06:05:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 06:05:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2023-12-25 06:05:22,227 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2023-12-25 06:05:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:22,229 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2023-12-25 06:05:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2023-12-25 06:05:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 06:05:22,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:22,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:22,239 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:05:22,436 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:22,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:22,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1453353420, now seen corresponding path program 1 times [2023-12-25 06:05:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394343386] [2023-12-25 06:05:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:22,442 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:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:22,446 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:22,495 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:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:22,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:05:22,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:22,642 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:05:22,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:22,900 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:05:22,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394343386] [2023-12-25 06:05:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394343386] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:22,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-25 06:05:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317035662] [2023-12-25 06:05:22,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:22,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:05:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:05:22,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:05:22,920 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:05:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:23,210 INFO L93 Difference]: Finished difference Result 59 states and 104 transitions. [2023-12-25 06:05:23,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:05:23,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-12-25 06:05:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:23,227 INFO L225 Difference]: With dead ends: 59 [2023-12-25 06:05:23,227 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 06:05:23,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:05:23,232 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:23,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 93 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:05:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 06:05:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-25 06:05:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2023-12-25 06:05:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2023-12-25 06:05:23,260 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 18 [2023-12-25 06:05:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:23,261 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2023-12-25 06:05:23,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:05:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2023-12-25 06:05:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 06:05:23,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:23,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:23,269 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:23,467 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:23,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:23,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2120120709, now seen corresponding path program 2 times [2023-12-25 06:05:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394304200] [2023-12-25 06:05:23,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:05:23,468 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:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:23,474 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:23,536 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:23,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:05:23,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:23,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 06:05:23,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:05:23,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:05:23,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394304200] [2023-12-25 06:05:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394304200] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:23,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 06:05:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805339035] [2023-12-25 06:05:23,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:23,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:05:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:05:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:05:23,686 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:23,760 INFO L93 Difference]: Finished difference Result 80 states and 129 transitions. [2023-12-25 06:05:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 06:05:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-12-25 06:05:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:23,764 INFO L225 Difference]: With dead ends: 80 [2023-12-25 06:05:23,765 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 06:05:23,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:05:23,778 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:23,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:05:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 06:05:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2023-12-25 06:05:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (21), 12 states have call predecessors, (21), 9 states have call successors, (21) [2023-12-25 06:05:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2023-12-25 06:05:23,799 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 25 [2023-12-25 06:05:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:23,800 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2023-12-25 06:05:23,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2023-12-25 06:05:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-25 06:05:23,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:23,805 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:23,824 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:24,009 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:24,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:24,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:24,011 INFO L85 PathProgramCache]: Analyzing trace with hash 184462849, now seen corresponding path program 1 times [2023-12-25 06:05:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348166447] [2023-12-25 06:05:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:24,011 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:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:24,012 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:24,061 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:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:05:24,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:05:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:05:24,143 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:05:24,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:05:24,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:05:24,180 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:24,368 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:24,371 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-12-25 06:05:24,374 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:05:24,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:05:24 BoogieIcfgContainer [2023-12-25 06:05:24,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:05:24,414 INFO L158 Benchmark]: Toolchain (without parser) took 4090.06ms. Allocated memory is still 233.8MB. Free memory was 178.5MB in the beginning and 126.1MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,414 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:05:24,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.62ms. Allocated memory is still 233.8MB. Free memory was 178.5MB in the beginning and 167.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.97ms. Allocated memory is still 233.8MB. Free memory was 167.6MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,415 INFO L158 Benchmark]: Boogie Preprocessor took 75.08ms. Allocated memory is still 233.8MB. Free memory was 165.9MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,415 INFO L158 Benchmark]: RCFGBuilder took 484.32ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 152.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,415 INFO L158 Benchmark]: TraceAbstraction took 3059.01ms. Allocated memory is still 233.8MB. Free memory was 151.8MB in the beginning and 126.1MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-25 06:05:24,429 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.14ms. Allocated memory is still 183.5MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 389.62ms. Allocated memory is still 233.8MB. Free memory was 178.5MB in the beginning and 167.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.97ms. Allocated memory is still 233.8MB. Free memory was 167.6MB in the beginning and 165.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.08ms. Allocated memory is still 233.8MB. Free memory was 165.9MB in the beginning and 164.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 484.32ms. Allocated memory is still 233.8MB. Free memory was 164.4MB in the beginning and 152.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3059.01ms. Allocated memory is still 233.8MB. Free memory was 151.8MB in the beginning and 126.1MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 45]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int m = __VERIFIER_nondet_int(); [L29] COND FALSE !(m < 0 || m > 3) [L34] int n = __VERIFIER_nondet_int(); [L35] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L41] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L20] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L20] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L20] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L21] return ackermann(m-1,1); [L23] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L23] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] return ackermann(m-1,ackermann(m,n-1)); [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L21] return ackermann(m-1,1); [L41] RET, EXPR ackermann(m,n) VAL [m=2, n=0] [L41] int result = ackermann(m,n); [L42] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L45] reach_error() VAL [m=2, n=0, result=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 53 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 4 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 31/38 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:24,460 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...