/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/recursified_loop-crafted/recursified_simple_vardep_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:48:03,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:48:03,958 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-16 17:48:03,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:48:03,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:48:03,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:48:03,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:48:03,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:48:03,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:48:03,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:48:03,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:48:03,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:48:03,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:48:03,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:48:03,988 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:48:03,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:48:03,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:48:03,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:48:03,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:48:03,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:48:03,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:48:03,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:48:03,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:48:03,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:48:03,993 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:48:03,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:48:03,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:48:03,993 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:48:03,993 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-16 17:48:04,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:48:04,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:48:04,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:48:04,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:48:04,161 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:48:04,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-12-16 17:48:05,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:48:05,371 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:48:05,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-12-16 17:48:05,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979a4b796/fa510a8c858c49949838c8788b5587f4/FLAG1ef2228ed [2023-12-16 17:48:05,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/979a4b796/fa510a8c858c49949838c8788b5587f4 [2023-12-16 17:48:05,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:48:05,390 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:48:05,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:48:05,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:48:05,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:48:05,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7987f528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05, skipping insertion in model container [2023-12-16 17:48:05,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:48:05,492 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-12-16 17:48:05,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:48:05,513 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:48:05,520 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-12-16 17:48:05,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:48:05,532 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:48:05,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05 WrapperNode [2023-12-16 17:48:05,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:48:05,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:48:05,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:48:05,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:48:05,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,562 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-12-16 17:48:05,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:48:05,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:48:05,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:48:05,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:48:05,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,588 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 4, 5, 5]. 31 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-12-16 17:48:05,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:48:05,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:48:05,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:48:05,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:48:05,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (1/1) ... [2023-12-16 17:48:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:48:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:48:05,622 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-16 17:48:05,629 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-16 17:48:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 17:48:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:48:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2023-12-16 17:48:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 17:48:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 17:48:05,742 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:48:05,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:48:05,938 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:48:05,964 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:48:05,964 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 17:48:05,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:48:05 BoogieIcfgContainer [2023-12-16 17:48:05,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:48:05,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:48:05,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:48:05,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:48:05,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:48:05" (1/3) ... [2023-12-16 17:48:05,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166a86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:48:05, skipping insertion in model container [2023-12-16 17:48:05,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:48:05" (2/3) ... [2023-12-16 17:48:05,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166a86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:48:05, skipping insertion in model container [2023-12-16 17:48:05,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:48:05" (3/3) ... [2023-12-16 17:48:05,980 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2023-12-16 17:48:05,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:48:05,992 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:48:06,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:48:06,033 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;@275d6b6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:48:06,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:48:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 17:48:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 17:48:06,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:06,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:06,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:06,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1319783804, now seen corresponding path program 1 times [2023-12-16 17:48:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93592602] [2023-12-16 17:48:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:06,061 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-16 17:48:06,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:06,063 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-16 17:48:06,096 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-16 17:48:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:06,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 17:48:06,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:06,311 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-16 17:48:06,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:48:06,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93592602] [2023-12-16 17:48:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93592602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:48:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:48:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:48:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650666944] [2023-12-16 17:48:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:48:06,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:48:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:48:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:48:06,335 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:06,452 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-12-16 17:48:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:48:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-16 17:48:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:06,457 INFO L225 Difference]: With dead ends: 34 [2023-12-16 17:48:06,457 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 17:48:06,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:48:06,465 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:06,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:48:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 17:48:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-16 17:48:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-16 17:48:06,485 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2023-12-16 17:48:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:06,485 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-16 17:48:06,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-16 17:48:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 17:48:06,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:06,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:06,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 17:48:06,688 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-16 17:48:06,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:06,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1319843386, now seen corresponding path program 1 times [2023-12-16 17:48:06,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:06,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439924004] [2023-12-16 17:48:06,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:06,691 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-16 17:48:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:06,692 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-16 17:48:06,700 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-16 17:48:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:06,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 17:48:06,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:06,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:06,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:06,889 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-16 17:48:06,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:48:06,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:06,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439924004] [2023-12-16 17:48:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439924004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:48:06,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:48:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 17:48:06,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114521029] [2023-12-16 17:48:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:48:06,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:48:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:06,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:48:06,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:48:06,892 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:07,004 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-12-16 17:48:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:48:07,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-16 17:48:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:07,005 INFO L225 Difference]: With dead ends: 20 [2023-12-16 17:48:07,005 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 17:48:07,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:48:07,006 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:07,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:48:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 17:48:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-12-16 17:48:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-16 17:48:07,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2023-12-16 17:48:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:07,010 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-16 17:48:07,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-16 17:48:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:48:07,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:07,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:07,015 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-16 17:48:07,213 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-16 17:48:07,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:07,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 347924421, now seen corresponding path program 1 times [2023-12-16 17:48:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864885331] [2023-12-16 17:48:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:07,214 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-16 17:48:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:07,215 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-16 17:48:07,217 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-16 17:48:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:07,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 17:48:07,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:07,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:07,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:07,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:48:07,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864885331] [2023-12-16 17:48:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864885331] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:48:07,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2023-12-16 17:48:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602681736] [2023-12-16 17:48:07,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:07,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 17:48:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:07,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 17:48:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-16 17:48:07,572 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:07,790 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-12-16 17:48:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 17:48:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 17:48:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:07,790 INFO L225 Difference]: With dead ends: 29 [2023-12-16 17:48:07,790 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 17:48:07,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:48:07,792 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:07,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:48:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 17:48:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2023-12-16 17:48:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-12-16 17:48:07,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2023-12-16 17:48:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:07,796 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-12-16 17:48:07,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-12-16 17:48:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 17:48:07,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:48:07,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:48:07,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 17:48:07,999 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-16 17:48:07,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:48:07,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:48:07,999 INFO L85 PathProgramCache]: Analyzing trace with hash 347864839, now seen corresponding path program 1 times [2023-12-16 17:48:08,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:48:08,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876455639] [2023-12-16 17:48:08,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:48:08,000 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-16 17:48:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:48:08,001 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-16 17:48:08,010 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-16 17:48:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:48:08,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-16 17:48:08,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:48:08,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:08,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:08,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-16 17:48:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:48:08,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:48:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 17:48:08,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:48:08,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876455639] [2023-12-16 17:48:08,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876455639] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:48:08,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:48:08,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2023-12-16 17:48:08,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140436647] [2023-12-16 17:48:08,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:48:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:48:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:48:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:48:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:48:08,379 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:48:08,671 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-12-16 17:48:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 17:48:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 17:48:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:48:08,672 INFO L225 Difference]: With dead ends: 25 [2023-12-16 17:48:08,672 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 17:48:08,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2023-12-16 17:48:08,673 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:48:08,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:48:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 17:48:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 17:48:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 17:48:08,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-12-16 17:48:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:48:08,674 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 17:48:08,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:48:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 17:48:08,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 17:48:08,676 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:48:08,692 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-16 17:48:08,895 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-16 17:48:08,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 17:48:09,188 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 17:48:09,189 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (= (select (select |#memory_int#3| |ULTIMATE.start_main_~#k~0#1.base|) |ULTIMATE.start_main_~#k~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~0#1.base|) |ULTIMATE.start_main_~#j~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_int#2| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) (_ bv0 32))) [2023-12-16 17:48:09,189 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-16 17:48:09,189 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 17:48:09,189 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_24_0EXIT(lines 37 52) no Hoare annotation was computed. [2023-12-16 17:48:09,189 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 37 52) the Hoare annotation is: (let ((.cse0 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|) |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse3 (select (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|) |func_to_recursive_line_20_to_24_0_#in~k#1.offset|))) (let ((.cse1 (select (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_#in~k#1.base|) |func_to_recursive_line_20_to_24_0_#in~k#1.offset|)) (.cse4 (not (= (bvmul (_ bv3 32) .cse0) .cse3))) (.cse2 (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|) |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) (.cse5 (select (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_#in~i#1.base|) |func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (or (not (= (_ bv0 32) .cse0)) (= .cse1 (_ bv0 32)) (not (= .cse2 (_ bv0 32))) (not (= (_ bv0 32) .cse3))) (or (not (= .cse2 (bvmul (_ bv2 32) .cse0))) .cse4 (and (= .cse1 (bvmul (_ bv3 32) .cse5)) (= (select (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_#in~j#1.base|) |func_to_recursive_line_20_to_24_0_#in~j#1.offset|) (bvmul (_ bv2 32) .cse5)))) (or .cse4 (not (= (_ bv2 32) .cse2)) (not (= (_ bv1 32) .cse0)) (= (_ bv1 32) .cse5))))) [2023-12-16 17:48:09,189 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 28) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 33) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 20 35) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (select (select |old(#memory_int#2)| |func_to_recursive_line_20_to_24_0_#in~i#1.base|) |func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) (.cse5 (select (select |old(#memory_int#3)| |func_to_recursive_line_20_to_24_0_#in~k#1.base|) |func_to_recursive_line_20_to_24_0_#in~k#1.offset|))) (let ((.cse2 (select (select |old(#memory_int#1)| |func_to_recursive_line_20_to_24_0_#in~j#1.base|) |func_to_recursive_line_20_to_24_0_#in~j#1.offset|)) (.cse0 (not (= (bvmul (_ bv3 32) .cse3) .cse5))) (.cse1 (select (select |#memory_int#2| |func_to_recursive_line_20_to_24_0_~i#1.base|) |func_to_recursive_line_20_to_24_0_~i#1.offset|)) (.cse4 (select (select |#memory_int#3| |func_to_recursive_line_20_to_24_0_~k#1.base|) |func_to_recursive_line_20_to_24_0_~k#1.offset|))) (and (or .cse0 (= (_ bv2 32) .cse1) (not (= (_ bv2 32) .cse2)) (not (= (_ bv1 32) .cse3))) (or (not (= (_ bv0 32) .cse3)) (= (_ bv3 32) .cse4) (not (= .cse2 (_ bv0 32))) (not (= (_ bv0 32) .cse5))) (or (not (= .cse2 (bvmul (_ bv2 32) .cse3))) .cse0 (and (= (select (select |#memory_int#1| |func_to_recursive_line_20_to_24_0_~j#1.base|) |func_to_recursive_line_20_to_24_0_~j#1.offset|) (bvmul (_ bv2 32) .cse1)) (= (bvmul .cse1 (_ bv3 32)) .cse4)))))) [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L45-2(line 45) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 51) no Hoare annotation was computed. [2023-12-16 17:48:09,190 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 37 52) no Hoare annotation was computed. [2023-12-16 17:48:09,192 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 17:48:09,193 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:48:09,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:48:09 BoogieIcfgContainer [2023-12-16 17:48:09,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:48:09,204 INFO L158 Benchmark]: Toolchain (without parser) took 3814.32ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 129.9MB in the beginning and 203.6MB in the end (delta: -73.7MB). Peak memory consumption was 109.0MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,204 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:48:09,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.74ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.10ms. Allocated memory is still 192.9MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,205 INFO L158 Benchmark]: Boogie Preprocessor took 34.34ms. Allocated memory is still 192.9MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,205 INFO L158 Benchmark]: RCFGBuilder took 366.95ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 114.7MB in the beginning and 213.5MB in the end (delta: -98.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,205 INFO L158 Benchmark]: TraceAbstraction took 3227.89ms. Allocated memory is still 249.6MB. Free memory was 214.9MB in the beginning and 203.6MB in the end (delta: 11.3MB). Peak memory consumption was 135.8MB. Max. memory is 8.0GB. [2023-12-16 17:48:09,206 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.10ms. Allocated memory is still 192.9MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 140.74ms. Allocated memory is still 192.9MB. Free memory was 129.6MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.10ms. Allocated memory is still 192.9MB. Free memory was 118.6MB in the beginning and 117.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.34ms. Allocated memory is still 192.9MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 366.95ms. Allocated memory was 192.9MB in the beginning and 249.6MB in the end (delta: 56.6MB). Free memory was 114.7MB in the beginning and 213.5MB in the end (delta: -98.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3227.89ms. Allocated memory is still 249.6MB. Free memory was 214.9MB in the beginning and 203.6MB in the end (delta: 11.3MB). Peak memory consumption was 135.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 29 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=2, InterpolantAutomatonStates: 45, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 13 PreInvPairs, 17 NumberOfFragments, 276 HoareAnnotationTreeSize, 13 FormulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FormulaSimplificationsInter, 164 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 721 SizeOfPredicates, 72 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 9/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-16 17:48:09,252 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...