./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:04:35,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:04:35,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:04:36,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:04:36,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:04:36,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:04:36,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:04:36,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:04:36,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:04:36,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:04:36,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:04:36,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:04:36,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:04:36,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:04:36,037 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:04:36,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:04:36,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:04:36,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:04:36,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:04:36,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:04:36,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:04:36,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:04:36,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:04:36,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:04:36,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:04:36,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:04:36,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:04:36,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:04:36,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:04:36,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:04:36,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:04:36,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:04:36,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:36,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:04:36,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:04:36,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:04:36,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:04:36,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:04:36,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:04:36,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:04:36,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:04:36,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:04:36,047 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2024-10-11 03:04:36,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:04:36,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:04:36,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:04:36,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:04:36,330 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:04:36,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-10-11 03:04:37,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:04:37,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:04:37,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-10-11 03:04:37,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/76cbd8ae0/62dd236e33ce4312b8c9894425406c12/FLAG8398fa3c5 [2024-10-11 03:04:37,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/76cbd8ae0/62dd236e33ce4312b8c9894425406c12 [2024-10-11 03:04:37,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:04:37,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:04:37,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:37,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:04:37,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:04:37,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:37" (1/1) ... [2024-10-11 03:04:37,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f24460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:37, skipping insertion in model container [2024-10-11 03:04:37,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:37" (1/1) ... [2024-10-11 03:04:37,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:04:38,165 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-10-11 03:04:38,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:38,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:04:38,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-10-11 03:04:38,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:38,218 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:04:38,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38 WrapperNode [2024-10-11 03:04:38,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:38,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:38,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:04:38,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:04:38,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,250 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-11 03:04:38,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:38,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:04:38,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:04:38,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:04:38,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,279 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]. [2024-10-11 03:04:38,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:04:38,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:04:38,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:04:38,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:04:38,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (1/1) ... [2024-10-11 03:04:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:38,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:04:38,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:04:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:04:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:04:38,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:04:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:04:38,424 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-10-11 03:04:38,424 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-10-11 03:04:38,488 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:04:38,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:04:38,588 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-11 03:04:38,589 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:04:38,612 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:04:38,613 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:04:38,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:38 BoogieIcfgContainer [2024-10-11 03:04:38,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:04:38,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:04:38,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:04:38,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:04:38,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:04:37" (1/3) ... [2024-10-11 03:04:38,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217606be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:38, skipping insertion in model container [2024-10-11 03:04:38,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:38" (2/3) ... [2024-10-11 03:04:38,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217606be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:38, skipping insertion in model container [2024-10-11 03:04:38,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:38" (3/3) ... [2024-10-11 03:04:38,624 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2024-10-11 03:04:38,643 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:04:38,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:04:38,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:04:38,725 INFO L333 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, 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;@bd067f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:04:38,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:04:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:04:38,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:04:38,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:38,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:38,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2024-10-11 03:04:38,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:38,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666066810] [2024-10-11 03:04:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:38,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:39,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666066810] [2024-10-11 03:04:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666066810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711060985] [2024-10-11 03:04:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:39,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:39,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:39,108 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:39,162 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-11 03:04:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 03:04:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:39,176 INFO L225 Difference]: With dead ends: 25 [2024-10-11 03:04:39,177 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 03:04:39,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:39,185 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:39,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:04:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 03:04:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 03:04:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 03:04:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-11 03:04:39,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-10-11 03:04:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:39,225 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-11 03:04:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-11 03:04:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:04:39,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:39,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:04:39,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2024-10-11 03:04:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068660682] [2024-10-11 03:04:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:39,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:39,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068660682] [2024-10-11 03:04:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068660682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:39,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:39,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663387641] [2024-10-11 03:04:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:39,355 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:39,417 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-11 03:04:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:39,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 03:04:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:39,419 INFO L225 Difference]: With dead ends: 23 [2024-10-11 03:04:39,419 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 03:04:39,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:39,421 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:39,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 03:04:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-11 03:04:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 03:04:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-11 03:04:39,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-10-11 03:04:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:39,429 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-11 03:04:39,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-11 03:04:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:04:39,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:39,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:39,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:04:39,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2024-10-11 03:04:39,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96768442] [2024-10-11 03:04:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96768442] [2024-10-11 03:04:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96768442] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:39,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897593634] [2024-10-11 03:04:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:39,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:39,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:04:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:39,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:39,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:04:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897593634] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:40,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-10-11 03:04:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009078891] [2024-10-11 03:04:40,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:04:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:04:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:04:40,066 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:04:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:40,184 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-10-11 03:04:40,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:04:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-10-11 03:04:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:40,186 INFO L225 Difference]: With dead ends: 34 [2024-10-11 03:04:40,186 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 03:04:40,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:04:40,189 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:40,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 03:04:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 03:04:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 03:04:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-11 03:04:40,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2024-10-11 03:04:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:40,204 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-11 03:04:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 03:04:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-11 03:04:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:04:40,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:40,205 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:40,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:04:40,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:40,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:40,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2024-10-11 03:04:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:40,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258682888] [2024-10-11 03:04:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:04:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258682888] [2024-10-11 03:04:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258682888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799924513] [2024-10-11 03:04:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:40,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:40,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:40,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:04:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:40,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:40,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:04:40,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:04:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799924513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:40,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:40,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-10-11 03:04:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21167488] [2024-10-11 03:04:40,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:40,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:04:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:04:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:04:40,897 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:41,004 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-10-11 03:04:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:04:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-10-11 03:04:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:41,006 INFO L225 Difference]: With dead ends: 37 [2024-10-11 03:04:41,007 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 03:04:41,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:04:41,008 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:41,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 03:04:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 03:04:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-11 03:04:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-11 03:04:41,020 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2024-10-11 03:04:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:41,021 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-11 03:04:41,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-11 03:04:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:04:41,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:41,025 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:41,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:41,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:41,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2024-10-11 03:04:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350528353] [2024-10-11 03:04:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:04:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350528353] [2024-10-11 03:04:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350528353] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355312287] [2024-10-11 03:04:41,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:04:41,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:41,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:41,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:41,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:04:41,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:04:41,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:41,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:41,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 03:04:41,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:04:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355312287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:41,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-10-11 03:04:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434802536] [2024-10-11 03:04:41,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:41,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 03:04:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 03:04:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:04:41,988 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 03:04:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:42,165 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-10-11 03:04:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:04:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 36 [2024-10-11 03:04:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:42,167 INFO L225 Difference]: With dead ends: 68 [2024-10-11 03:04:42,167 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 03:04:42,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:04:42,169 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:42,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 03:04:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 03:04:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 03:04:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-10-11 03:04:42,181 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 36 [2024-10-11 03:04:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:42,182 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-10-11 03:04:42,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-11 03:04:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-10-11 03:04:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:04:42,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:42,184 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:42,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:42,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash -867130448, now seen corresponding path program 3 times [2024-10-11 03:04:42,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:42,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832046440] [2024-10-11 03:04:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:42,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-11 03:04:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832046440] [2024-10-11 03:04:42,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832046440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941963596] [2024-10-11 03:04:42,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:04:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:42,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:42,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:04:42,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 03:04:42,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:42,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:42,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-10-11 03:04:43,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-11 03:04:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941963596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:43,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-10-11 03:04:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110628440] [2024-10-11 03:04:43,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 03:04:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 03:04:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-11 03:04:43,474 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:04:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:43,748 INFO L93 Difference]: Finished difference Result 88 states and 132 transitions. [2024-10-11 03:04:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:04:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 92 [2024-10-11 03:04:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:43,750 INFO L225 Difference]: With dead ends: 88 [2024-10-11 03:04:43,751 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 03:04:43,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:04:43,767 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:43,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 100 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 03:04:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-11 03:04:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-11 03:04:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-11 03:04:43,785 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 92 [2024-10-11 03:04:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:43,786 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-11 03:04:43,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:04:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-11 03:04:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 03:04:43,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:43,790 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:43,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:43,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:04:43,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:43,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1193756999, now seen corresponding path program 4 times [2024-10-11 03:04:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:43,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571291622] [2024-10-11 03:04:43,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:43,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-10-11 03:04:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:44,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571291622] [2024-10-11 03:04:44,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571291622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774192014] [2024-10-11 03:04:44,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:04:44,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:44,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:44,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:04:44,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:04:44,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:44,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 03:04:44,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-11 03:04:44,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-11 03:04:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774192014] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:46,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 30 [2024-10-11 03:04:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62765000] [2024-10-11 03:04:46,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:46,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 03:04:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 03:04:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:04:46,310 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-11 03:04:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:46,652 INFO L93 Difference]: Finished difference Result 115 states and 178 transitions. [2024-10-11 03:04:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:04:46,653 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) Word has length 132 [2024-10-11 03:04:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:46,655 INFO L225 Difference]: With dead ends: 115 [2024-10-11 03:04:46,659 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 03:04:46,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 281 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 03:04:46,661 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:46,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 116 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 03:04:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-11 03:04:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 45 states have internal predecessors, (49), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-11 03:04:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-11 03:04:46,673 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2024-10-11 03:04:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:46,673 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-11 03:04:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-11 03:04:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-11 03:04:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:04:46,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:46,677 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:46,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:04:46,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:46,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:46,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2122090202, now seen corresponding path program 5 times [2024-10-11 03:04:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:46,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227220777] [2024-10-11 03:04:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-11 03:04:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227220777] [2024-10-11 03:04:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227220777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367714810] [2024-10-11 03:04:47,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:04:47,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:47,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:47,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:47,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:04:47,669 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-11 03:04:47,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:47,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:47,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2024-10-11 03:04:47,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-10-11 03:04:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367714810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:48,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 20 [2024-10-11 03:04:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524292899] [2024-10-11 03:04:48,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:48,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:04:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:04:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:04:48,415 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-11 03:04:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:48,603 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2024-10-11 03:04:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:04:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) Word has length 173 [2024-10-11 03:04:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:48,614 INFO L225 Difference]: With dead ends: 182 [2024-10-11 03:04:48,614 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 03:04:48,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 384 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:48,616 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:48,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 70 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 03:04:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-10-11 03:04:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 109 states have internal predecessors, (120), 33 states have call successors, (33), 19 states have call predecessors, (33), 18 states have return successors, (86), 37 states have call predecessors, (86), 33 states have call successors, (86) [2024-10-11 03:04:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2024-10-11 03:04:48,643 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2024-10-11 03:04:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:48,643 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2024-10-11 03:04:48,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-11 03:04:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2024-10-11 03:04:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-11 03:04:48,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:48,648 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:48,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:48,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:04:48,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:48,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 6 times [2024-10-11 03:04:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566722180] [2024-10-11 03:04:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 03:04:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1307 proven. 1260 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2024-10-11 03:04:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:50,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566722180] [2024-10-11 03:04:50,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566722180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:50,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757948976] [2024-10-11 03:04:50,242 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:04:50,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:50,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:50,244 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:04:50,426 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2024-10-11 03:04:50,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:50,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 03:04:50,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1174 proven. 810 refuted. 0 times theorem prover too weak. 4055 trivial. 0 not checked. [2024-10-11 03:04:51,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:05:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1350 proven. 678 refuted. 0 times theorem prover too weak. 4011 trivial. 0 not checked. [2024-10-11 03:05:08,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757948976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:05:08,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:05:08,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 27] total 60 [2024-10-11 03:05:08,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519817579] [2024-10-11 03:05:08,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:05:08,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-11 03:05:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:05:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-11 03:05:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3168, Unknown=0, NotChecked=0, Total=3540 [2024-10-11 03:05:08,254 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) [2024-10-11 03:05:09,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:05:09,507 INFO L93 Difference]: Finished difference Result 281 states and 464 transitions. [2024-10-11 03:05:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-11 03:05:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) Word has length 323 [2024-10-11 03:05:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:05:09,510 INFO L225 Difference]: With dead ends: 281 [2024-10-11 03:05:09,510 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 03:05:09,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 644 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1208, Invalid=9094, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 03:05:09,515 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:05:09,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 259 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:05:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 03:05:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2024-10-11 03:05:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 66 states have internal predecessors, (71), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (43), 15 states have call predecessors, (43), 18 states have call successors, (43) [2024-10-11 03:05:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2024-10-11 03:05:09,540 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 323 [2024-10-11 03:05:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:05:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2024-10-11 03:05:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) [2024-10-11 03:05:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-10-11 03:05:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-11 03:05:09,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:05:09,545 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2024-10-11 03:05:09,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:05:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:05:09,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:05:09,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:05:09,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1893730074, now seen corresponding path program 7 times [2024-10-11 03:05:09,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:05:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012426128] [2024-10-11 03:05:09,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:05:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:05:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:05:09,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:05:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:05:09,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:05:09,864 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:05:09,865 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:05:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:05:09,870 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-10-11 03:05:09,943 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:05:09,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:05:09 BoogieIcfgContainer [2024-10-11 03:05:09,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:05:09,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:05:09,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:05:09,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:05:09,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:38" (3/4) ... [2024-10-11 03:05:09,952 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:05:10,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:05:10,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:05:10,045 INFO L158 Benchmark]: Toolchain (without parser) took 32093.37ms. Allocated memory was 134.2MB in the beginning and 587.2MB in the end (delta: 453.0MB). Free memory was 64.3MB in the beginning and 485.6MB in the end (delta: -421.2MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,046 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:05:10,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.31ms. Allocated memory is still 134.2MB. Free memory was 64.0MB in the beginning and 52.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 134.2MB. Free memory was 52.4MB in the beginning and 51.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,046 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 134.2MB. Free memory was 51.1MB in the beginning and 49.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:05:10,047 INFO L158 Benchmark]: RCFGBuilder took 325.33ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 49.6MB in the beginning and 148.8MB in the end (delta: -99.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,047 INFO L158 Benchmark]: TraceAbstraction took 31332.56ms. Allocated memory was 186.6MB in the beginning and 587.2MB in the end (delta: 400.6MB). Free memory was 147.8MB in the beginning and 491.9MB in the end (delta: -344.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,047 INFO L158 Benchmark]: Witness Printer took 94.74ms. Allocated memory is still 587.2MB. Free memory was 490.8MB in the beginning and 485.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:05:10,049 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.31ms. Allocated memory is still 134.2MB. Free memory was 64.0MB in the beginning and 52.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 134.2MB. Free memory was 52.4MB in the beginning and 51.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 134.2MB. Free memory was 51.1MB in the beginning and 49.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.33ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 49.6MB in the beginning and 148.8MB in the end (delta: -99.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 31332.56ms. Allocated memory was 186.6MB in the beginning and 587.2MB in the end (delta: 400.6MB). Free memory was 147.8MB in the beginning and 491.9MB in the end (delta: -344.1MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Witness Printer took 94.74ms. Allocated memory is still 587.2MB. Free memory was 490.8MB in the beginning and 485.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [x=7] [L29] reach_error() VAL [x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 10, TraceHistogramMax: 47, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 834 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2333 IncrementalHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 152 mSDtfsCounter, 2333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2000 GetRequests, 1675 SyntacticMatches, 89 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7350 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=8, InterpolantAutomatonStates: 151, 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, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1836 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 2399 ConstructedInterpolants, 0 QuantifiedInterpolants, 4800 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1751 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 22509/27375 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! [2024-10-11 03:05:10,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE