./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 fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-wip.dd.update-z3-fca748b-m [2024-11-19 22:11:47,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:11:47,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:11:47,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:11:47,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:11:47,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:11:47,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:11:47,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:11:47,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:11:47,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:11:47,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:11:47,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:11:47,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:11:47,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:11:47,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:11:47,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:11:47,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:11:47,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:11:47,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:11:47,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:11:47,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:11:47,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:11:47,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:11:47,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:11:47,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:11:47,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:11:47,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:11:47,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:11:47,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:11:47,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:11:47,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:11:47,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:11:47,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:11:47,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:11:47,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:11:47,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:11:47,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:11:47,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:11:47,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:11:47,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:11:47,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:11:47,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:11:47,839 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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-11-19 22:11:48,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:11:48,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:11:48,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:11:48,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:11:48,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:11:48,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-19 22:11:49,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:11:49,654 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:11:49,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-19 22:11:49,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce627115b/23ca6964165c48258ce4d00fc63db025/FLAG4a8941722 [2024-11-19 22:11:50,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce627115b/23ca6964165c48258ce4d00fc63db025 [2024-11-19 22:11:50,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:11:50,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:11:50,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:11:50,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:11:50,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:11:50,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392de267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50, skipping insertion in model container [2024-11-19 22:11:50,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:11:50,248 WARN L250 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-11-19 22:11:50,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:11:50,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:11:50,278 WARN L250 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-11-19 22:11:50,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:11:50,291 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:11:50,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50 WrapperNode [2024-11-19 22:11:50,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:11:50,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:11:50,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:11:50,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:11:50,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,320 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-19 22:11:50,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:11:50,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:11:50,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:11:50,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:11:50,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,340 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-11-19 22:11:50,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:11:50,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:11:50,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:11:50,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:11:50,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (1/1) ... [2024-11-19 22:11:50,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:11:50,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:50,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:11:50,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:11:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:11:50,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:11:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:11:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:11:50,435 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-19 22:11:50,435 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-19 22:11:50,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:11:50,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:11:50,627 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 22:11:50,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:11:50,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:11:50,642 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:11:50,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:50 BoogieIcfgContainer [2024-11-19 22:11:50,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:11:50,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:11:50,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:11:50,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:11:50,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:11:50" (1/3) ... [2024-11-19 22:11:50,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9b0580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:50, skipping insertion in model container [2024-11-19 22:11:50,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:11:50" (2/3) ... [2024-11-19 22:11:50,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9b0580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:11:50, skipping insertion in model container [2024-11-19 22:11:50,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:50" (3/3) ... [2024-11-19 22:11:50,652 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2024-11-19 22:11:50,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:11:50,668 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:11:50,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:11:50,747 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;@153334c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:11:50,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:11:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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-11-19 22:11:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 22:11:50,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:50,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:50,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-19 22:11:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190154478] [2024-11-19 22:11:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:11:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190154478] [2024-11-19 22:11:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190154478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:11:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:11:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:11:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697296175] [2024-11-19 22:11:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:11:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:11:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:11:51,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:11:51,140 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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.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-11-19 22:11:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:51,193 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-19 22:11:51,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:11:51,195 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-11-19 22:11:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:51,202 INFO L225 Difference]: With dead ends: 30 [2024-11-19 22:11:51,202 INFO L226 Difference]: Without dead ends: 18 [2024-11-19 22:11:51,204 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-11-19 22:11:51,207 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:51,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:11:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-19 22:11:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-19 22:11:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-11-19 22:11:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-19 22:11:51,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-19 22:11:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-19 22:11:51,237 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-11-19 22:11:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-19 22:11:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 22:11:51,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:51,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:11:51,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-19 22:11:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207850291] [2024-11-19 22:11:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:11:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207850291] [2024-11-19 22:11:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207850291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:11:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:11:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:11:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906780834] [2024-11-19 22:11:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:11:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:11:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:51,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:11:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:11:51,372 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:11:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:51,394 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-19 22:11:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:11:51,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 22:11:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:51,396 INFO L225 Difference]: With dead ends: 24 [2024-11-19 22:11:51,396 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 22:11:51,398 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-11-19 22:11:51,399 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:51,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:11:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 22:11:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-19 22:11:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-11-19 22:11:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-19 22:11:51,412 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-19 22:11:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:51,412 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-19 22:11:51,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:11:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-19 22:11:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:11:51,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:51,416 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:51,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:11:51,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-19 22:11:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:51,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253013602] [2024-11-19 22:11:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:11:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:11:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253013602] [2024-11-19 22:11:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253013602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351138995] [2024-11-19 22:11:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:51,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:51,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:51,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:51,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:11:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:51,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:11:51,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:11:51,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:11:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351138995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:52,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:52,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-11-19 22:11:52,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431722909] [2024-11-19 22:11:52,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:52,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:11:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:52,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:11:52,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:11:52,059 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-11-19 22:11:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:52,145 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-19 22:11:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:11:52,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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 23 [2024-11-19 22:11:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:52,146 INFO L225 Difference]: With dead ends: 35 [2024-11-19 22:11:52,147 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 22:11:52,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 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-11-19 22:11:52,148 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:52,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 22:11:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 22:11:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 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-11-19 22:11:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-19 22:11:52,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-19 22:11:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:52,156 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-19 22:11:52,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-11-19 22:11:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-19 22:11:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:11:52,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:52,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:52,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:11:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:52,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-19 22:11:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334103379] [2024-11-19 22:11:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:52,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:11:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334103379] [2024-11-19 22:11:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334103379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967574707] [2024-11-19 22:11:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:52,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:52,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:52,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:11:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:52,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:11:52,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:11:52,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:11:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967574707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:52,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-19 22:11:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703796838] [2024-11-19 22:11:52,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:52,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:11:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:52,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:11:52,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:11:52,855 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-11-19 22:11:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:52,965 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2024-11-19 22:11:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:11:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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 24 [2024-11-19 22:11:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:52,967 INFO L225 Difference]: With dead ends: 38 [2024-11-19 22:11:52,969 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 22:11:52,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 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-11-19 22:11:52,970 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:52,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 59 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 22:11:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 22:11:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 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-11-19 22:11:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-19 22:11:52,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2024-11-19 22:11:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:52,984 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-19 22:11:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 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-11-19 22:11:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-11-19 22:11:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:11:52,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:52,986 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:52,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:11:53,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 22:11:53,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-19 22:11:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:53,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642914614] [2024-11-19 22:11:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 22:11:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642914614] [2024-11-19 22:11:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642914614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889615035] [2024-11-19 22:11:53,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 22:11:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:53,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:53,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:11:53,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 22:11:53,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:53,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:11:53,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 22:11:53,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 22:11:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889615035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:53,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-11-19 22:11:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010069281] [2024-11-19 22:11:53,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:53,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 22:11:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:53,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 22:11:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:11:53,859 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 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-11-19 22:11:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:54,020 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2024-11-19 22:11:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:11:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 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 37 [2024-11-19 22:11:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:54,023 INFO L225 Difference]: With dead ends: 69 [2024-11-19 22:11:54,025 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 22:11:54,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 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-11-19 22:11:54,027 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:54,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 22:11:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 22:11:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 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-11-19 22:11:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-19 22:11:54,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2024-11-19 22:11:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:54,036 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-19 22:11:54,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 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-11-19 22:11:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-19 22:11:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:11:54,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:54,038 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:54,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 22:11:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:54,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash -721858190, now seen corresponding path program 3 times [2024-11-19 22:11:54,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151545871] [2024-11-19 22:11:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-19 22:11:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151545871] [2024-11-19 22:11:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151545871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722371451] [2024-11-19 22:11:54,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 22:11:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:54,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:54,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 22:11:54,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 22:11:54,785 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:54,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:11:54,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-19 22:11:54,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-19 22:11:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722371451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:55,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-11-19 22:11:55,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922506899] [2024-11-19 22:11:55,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 22:11:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:55,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 22:11:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:11:55,333 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 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-11-19 22:11:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:55,610 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2024-11-19 22:11:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:11:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 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 93 [2024-11-19 22:11:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:55,613 INFO L225 Difference]: With dead ends: 89 [2024-11-19 22:11:55,613 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 22:11:55,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 199 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-11-19 22:11:55,617 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:55,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:11:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 22:11:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-19 22:11:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 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-11-19 22:11:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-19 22:11:55,635 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 93 [2024-11-19 22:11:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:55,636 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-19 22:11:55,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 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-11-19 22:11:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-19 22:11:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 22:11:55,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:55,640 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:55,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 22:11:55,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:55,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:55,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash -292645265, now seen corresponding path program 4 times [2024-11-19 22:11:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:55,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914497504] [2024-11-19 22:11:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:55,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-19 22:11:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914497504] [2024-11-19 22:11:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914497504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213352638] [2024-11-19 22:11:56,261 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 22:11:56,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:56,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:56,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:56,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 22:11:56,320 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 22:11:56,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:56,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 22:11:56,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-19 22:11:56,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:11:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-19 22:11:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213352638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:11:57,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:11:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2024-11-19 22:11:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890712326] [2024-11-19 22:11:57,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:11:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 22:11:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:11:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 22:11:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:11:57,285 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-19 22:11:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:11:57,452 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2024-11-19 22:11:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:11:57,453 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 106 [2024-11-19 22:11:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:11:57,458 INFO L225 Difference]: With dead ends: 122 [2024-11-19 22:11:57,459 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 22:11:57,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:11:57,460 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:11:57,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 79 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:11:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 22:11:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2024-11-19 22:11:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 71 states have internal predecessors, (83), 22 states have call successors, (22), 11 states have call predecessors, (22), 13 states have return successors, (49), 26 states have call predecessors, (49), 22 states have call successors, (49) [2024-11-19 22:11:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-19 22:11:57,482 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 106 [2024-11-19 22:11:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:11:57,482 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-19 22:11:57,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-19 22:11:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-19 22:11:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-19 22:11:57,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:11:57,490 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:11:57,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 22:11:57,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:57,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:11:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:11:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash -943421620, now seen corresponding path program 5 times [2024-11-19 22:11:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:11:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166137543] [2024-11-19 22:11:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:11:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:11:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:11:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:11:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:11:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:11:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:11:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:11:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:11:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:11:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 393 proven. 617 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2024-11-19 22:11:58,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:11:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166137543] [2024-11-19 22:11:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166137543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:11:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821832311] [2024-11-19 22:11:58,675 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 22:11:58,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:11:58,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:11:58,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:11:58,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 22:11:58,769 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-19 22:11:58,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:11:58,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:11:58,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:11:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 489 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-11-19 22:11:58,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:12:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 624 proven. 522 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-19 22:12:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821832311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:12:00,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:12:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 33 [2024-11-19 22:12:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885828192] [2024-11-19 22:12:00,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:12:00,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 22:12:00,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:12:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 22:12:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 22:12:00,618 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-19 22:12:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:12:01,031 INFO L93 Difference]: Finished difference Result 199 states and 339 transitions. [2024-11-19 22:12:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 22:12:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) Word has length 201 [2024-11-19 22:12:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:12:01,034 INFO L225 Difference]: With dead ends: 199 [2024-11-19 22:12:01,034 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 22:12:01,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 437 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=641, Invalid=1909, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 22:12:01,042 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:12:01,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 202 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:12:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 22:12:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2024-11-19 22:12:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2024-11-19 22:12:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2024-11-19 22:12:01,062 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 201 [2024-11-19 22:12:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:12:01,063 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2024-11-19 22:12:01,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-19 22:12:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2024-11-19 22:12:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-19 22:12:01,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:12:01,091 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:01,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 22:12:01,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:12:01,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:12:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:12:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2024-11-19 22:12:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:12:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066136278] [2024-11-19 22:12:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:12:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:12:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:12:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:12:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:12:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:12:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:12:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:12:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:12:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:12:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:12:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2024-11-19 22:12:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:12:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066136278] [2024-11-19 22:12:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066136278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:12:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679377087] [2024-11-19 22:12:02,853 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 22:12:02,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:12:02,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:12:02,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:12:02,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 22:12:03,040 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2024-11-19 22:12:03,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:12:03,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 22:12:03,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:12:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1045 proven. 197 refuted. 0 times theorem prover too weak. 5878 trivial. 0 not checked. [2024-11-19 22:12:03,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:12:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1045 proven. 225 refuted. 0 times theorem prover too weak. 5850 trivial. 0 not checked. [2024-11-19 22:12:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679377087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:12:04,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:12:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9, 13] total 32 [2024-11-19 22:12:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221076160] [2024-11-19 22:12:04,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:12:04,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 22:12:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:12:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 22:12:04,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2024-11-19 22:12:04,419 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 18 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 26 states have call predecessors, (37), 18 states have call successors, (37) [2024-11-19 22:12:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:12:05,003 INFO L93 Difference]: Finished difference Result 214 states and 375 transitions. [2024-11-19 22:12:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 22:12:05,004 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 18 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 26 states have call predecessors, (37), 18 states have call successors, (37) Word has length 351 [2024-11-19 22:12:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:12:05,006 INFO L225 Difference]: With dead ends: 214 [2024-11-19 22:12:05,006 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 22:12:05,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 790 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=649, Invalid=2213, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 22:12:05,011 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 103 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:12:05,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 216 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:12:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 22:12:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2024-11-19 22:12:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 71 states have internal predecessors, (76), 20 states have call successors, (20), 16 states have call predecessors, (20), 8 states have return successors, (38), 14 states have call predecessors, (38), 20 states have call successors, (38) [2024-11-19 22:12:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-19 22:12:05,023 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 351 [2024-11-19 22:12:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:12:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-19 22:12:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 32 states have internal predecessors, (77), 18 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (37), 26 states have call predecessors, (37), 18 states have call successors, (37) [2024-11-19 22:12:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-19 22:12:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-19 22:12:05,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:12:05,028 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:12:05,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 22:12:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:12:05,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:12:05,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:12:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 7 times [2024-11-19 22:12:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:12:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383796931] [2024-11-19 22:12:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:12:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:12:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:12:05,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:12:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:12:05,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:12:05,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:12:05,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:12:05,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:12:05,379 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-19 22:12:05,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:12:05,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:12:05 BoogieIcfgContainer [2024-11-19 22:12:05,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:12:05,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:12:05,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:12:05,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:12:05,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:11:50" (3/4) ... [2024-11-19 22:12:05,468 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:12:05,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:12:05,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:12:05,550 INFO L158 Benchmark]: Toolchain (without parser) took 15503.03ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 99.3MB in the beginning and 306.8MB in the end (delta: -207.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:12:05,550 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:12:05,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.73ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.52ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,551 INFO L158 Benchmark]: Boogie Preprocessor took 25.79ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,551 INFO L158 Benchmark]: RCFGBuilder took 295.34ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 74.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,551 INFO L158 Benchmark]: TraceAbstraction took 14821.55ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 73.6MB in the beginning and 312.0MB in the end (delta: -238.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,552 INFO L158 Benchmark]: Witness Printer took 82.89ms. Allocated memory is still 360.7MB. Free memory was 312.0MB in the beginning and 306.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 22:12:05,554 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.16ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.73ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 87.2MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.52ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.79ms. Allocated memory is still 167.8MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.34ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 74.1MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14821.55ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 73.6MB in the beginning and 312.0MB in the end (delta: -238.4MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Witness Printer took 82.89ms. Allocated memory is still 360.7MB. Free memory was 312.0MB in the beginning and 306.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 936 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1541 IncrementalHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 187 mSDtfsCounter, 1541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2061 GetRequests, 1832 SyntacticMatches, 32 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 138, 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, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1974 NumberOfCodeBlocks, 1877 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4357 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1732 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 26622/31290 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-11-19 22:12:05,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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