./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../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-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:10:24,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:10:24,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:10:24,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:10:24,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:10:24,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:10:24,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:10:24,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:10:24,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:10:24,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:10:24,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:10:24,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:10:24,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:10:24,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:10:24,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:10:24,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:10:24,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:10:24,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:10:24,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:10:24,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:10:24,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:10:24,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:10:24,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:10:24,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:10:24,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:10:24,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:10:24,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:10:24,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:10:24,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:10:24,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:10:24,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:10:24,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:10:24,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:10:24,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:10:24,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:10:24,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:10:24,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:10:24,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:10:24,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:10:24,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:10:24,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:10:24,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:10:24,336 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-22 02:10:24,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:10:24,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:10:24,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:10:24,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:10:24,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:10:24,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-22 02:10:25,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:10:26,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:10:26,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-11-22 02:10:26,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119d56fce/f4b76f1c46c34b78b22cc5a91942cfa1/FLAG3e69ab11b [2024-11-22 02:10:26,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119d56fce/f4b76f1c46c34b78b22cc5a91942cfa1 [2024-11-22 02:10:26,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:10:26,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:10:26,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:10:26,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:10:26,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:10:26,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f6e674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26, skipping insertion in model container [2024-11-22 02:10:26,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:10:26,365 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-22 02:10:26,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:10:26,377 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:10:26,389 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-22 02:10:26,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:10:26,402 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:10:26,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26 WrapperNode [2024-11-22 02:10:26,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:10:26,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:10:26,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:10:26,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:10:26,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,425 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-22 02:10:26,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:10:26,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:10:26,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:10:26,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:10:26,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,444 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-22 02:10:26,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:10:26,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:10:26,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:10:26,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:10:26,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (1/1) ... [2024-11-22 02:10:26,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:10:26,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:26,486 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-22 02:10:26,495 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-22 02:10:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:10:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:10:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:10:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:10:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-22 02:10:26,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-22 02:10:26,583 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:10:26,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:10:26,718 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-22 02:10:26,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:10:26,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:10:26,726 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 02:10:26,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:10:26 BoogieIcfgContainer [2024-11-22 02:10:26,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:10:26,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:10:26,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:10:26,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:10:26,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:10:26" (1/3) ... [2024-11-22 02:10:26,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477d776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:10:26, skipping insertion in model container [2024-11-22 02:10:26,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:10:26" (2/3) ... [2024-11-22 02:10:26,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477d776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:10:26, skipping insertion in model container [2024-11-22 02:10:26,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:10:26" (3/3) ... [2024-11-22 02:10:26,733 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2024-11-22 02:10:26,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:10:26,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:10:26,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:10:26,789 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;@f395e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:10:26,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:10:26,792 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-22 02:10:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 02:10:26,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:26,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:26,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:26,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-22 02:10:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494130194] [2024-11-22 02:10:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:27,022 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-22 02:10:27,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:27,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494130194] [2024-11-22 02:10:27,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494130194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:10:27,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:10:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:10:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630762362] [2024-11-22 02:10:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:10:27,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:10:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:10:27,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:10:27,048 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-22 02:10:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:27,085 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-22 02:10:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:10:27,089 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-22 02:10:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:27,094 INFO L225 Difference]: With dead ends: 30 [2024-11-22 02:10:27,094 INFO L226 Difference]: Without dead ends: 18 [2024-11-22 02:10:27,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:10:27,099 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-22 02:10:27,099 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-22 02:10:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-22 02:10:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-22 02:10:27,123 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-22 02:10:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-22 02:10:27,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-22 02:10:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-22 02:10:27,125 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-22 02:10:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-22 02:10:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 02:10:27,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:27,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:10:27,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-22 02:10:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:27,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103296469] [2024-11-22 02:10:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:27,178 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-22 02:10:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103296469] [2024-11-22 02:10:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103296469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:10:27,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:10:27,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:10:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020593253] [2024-11-22 02:10:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:10:27,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:10:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:10:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:10:27,181 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-22 02:10:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:27,194 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-22 02:10:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:10:27,195 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-22 02:10:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:27,196 INFO L225 Difference]: With dead ends: 24 [2024-11-22 02:10:27,196 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 02:10:27,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:10:27,197 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-22 02:10:27,198 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-22 02:10:27,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 02:10:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-22 02:10:27,201 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-22 02:10:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-22 02:10:27,202 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-22 02:10:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:27,202 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-22 02:10:27,203 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-22 02:10:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-22 02:10:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 02:10:27,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:27,204 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-22 02:10:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:10:27,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:27,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-22 02:10:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:27,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928400893] [2024-11-22 02:10:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:27,301 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-22 02:10:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928400893] [2024-11-22 02:10:27,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928400893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:27,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369454335] [2024-11-22 02:10:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:27,309 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-22 02:10:27,318 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-22 02:10:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:27,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 02:10:27,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:27,422 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-22 02:10:27,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:27,618 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-22 02:10:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369454335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:27,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2024-11-22 02:10:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110739146] [2024-11-22 02:10:27,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 02:10:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 02:10:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 02:10:27,624 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 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-22 02:10:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:27,803 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-22 02:10:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 02:10:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 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-22 02:10:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:27,805 INFO L225 Difference]: With dead ends: 35 [2024-11-22 02:10:27,806 INFO L226 Difference]: Without dead ends: 20 [2024-11-22 02:10:27,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-22 02:10:27,809 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:27,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-22 02:10:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-22 02:10:27,815 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-22 02:10:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-22 02:10:27,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-22 02:10:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:27,816 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-22 02:10:27,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 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-22 02:10:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-22 02:10:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 02:10:27,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:27,818 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-22 02:10:27,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 02:10:28,022 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-22 02:10:28,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:28,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-22 02:10:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679432356] [2024-11-22 02:10:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:28,123 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-22 02:10:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679432356] [2024-11-22 02:10:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679432356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376322961] [2024-11-22 02:10:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:10:28,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:28,129 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-22 02:10:28,134 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-22 02:10:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:28,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 02:10:28,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:28,192 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-22 02:10:28,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:28,364 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-22 02:10:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376322961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:28,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2024-11-22 02:10:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160549903] [2024-11-22 02:10:28,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:28,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 02:10:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 02:10:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 02:10:28,366 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 02:10:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:28,436 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-22 02:10:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 02:10:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2024-11-22 02:10:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:28,438 INFO L225 Difference]: With dead ends: 29 [2024-11-22 02:10:28,438 INFO L226 Difference]: Without dead ends: 25 [2024-11-22 02:10:28,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 02:10:28,443 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:28,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-22 02:10:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-22 02:10:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-22 02:10:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-11-22 02:10:28,452 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2024-11-22 02:10:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:28,452 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-22 02:10:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 02:10:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-22 02:10:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 02:10:28,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:28,454 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-22 02:10:28,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 02:10:28,654 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-22 02:10:28,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:28,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-22 02:10:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:28,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540544856] [2024-11-22 02:10:28,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:10:28,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:28,667 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:10:28,667 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 02:10:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540544856] [2024-11-22 02:10:28,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540544856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142107957] [2024-11-22 02:10:28,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:10:28,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:28,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:28,890 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-22 02:10:28,893 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-22 02:10:28,931 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:10:28,931 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:28,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:10:28,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:29,013 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-22 02:10:29,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:29,313 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-22 02:10:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142107957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:29,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2024-11-22 02:10:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932075252] [2024-11-22 02:10:29,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 02:10:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:29,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 02:10:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-22 02:10:29,319 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 02:10:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:29,546 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2024-11-22 02:10:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 02:10:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2024-11-22 02:10:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:29,549 INFO L225 Difference]: With dead ends: 46 [2024-11-22 02:10:29,550 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 02:10:29,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2024-11-22 02:10:29,551 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:29,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 02:10:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2024-11-22 02:10:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-22 02:10:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2024-11-22 02:10:29,568 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2024-11-22 02:10:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:29,568 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2024-11-22 02:10:29,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 02:10:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2024-11-22 02:10:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 02:10:29,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:29,571 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:29,585 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-22 02:10:29,771 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-22 02:10:29,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 710953508, now seen corresponding path program 3 times [2024-11-22 02:10:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238761749] [2024-11-22 02:10:29,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 02:10:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:29,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 02:10:29,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 167 proven. 27 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-22 02:10:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238761749] [2024-11-22 02:10:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238761749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956814886] [2024-11-22 02:10:29,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 02:10:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:29,996 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-22 02:10:30,000 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-22 02:10:30,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 02:10:30,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:30,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:10:30,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-22 02:10:30,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 169 proven. 25 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-22 02:10:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956814886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:30,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2024-11-22 02:10:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101598398] [2024-11-22 02:10:30,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:30,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 02:10:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 02:10:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-22 02:10:30,756 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-22 02:10:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:30,873 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2024-11-22 02:10:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 02:10:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2024-11-22 02:10:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:30,874 INFO L225 Difference]: With dead ends: 62 [2024-11-22 02:10:30,875 INFO L226 Difference]: Without dead ends: 35 [2024-11-22 02:10:30,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-22 02:10:30,876 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:30,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-22 02:10:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-22 02:10:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-22 02:10:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2024-11-22 02:10:30,881 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 90 [2024-11-22 02:10:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:30,881 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-22 02:10:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-22 02:10:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2024-11-22 02:10:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 02:10:30,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:30,882 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:30,889 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-22 02:10:31,086 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-22 02:10:31,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 4 times [2024-11-22 02:10:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917698907] [2024-11-22 02:10:31,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 02:10:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:31,095 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 02:10:31,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-22 02:10:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917698907] [2024-11-22 02:10:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917698907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040760633] [2024-11-22 02:10:31,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 02:10:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:31,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:31,153 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-22 02:10:31,158 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-22 02:10:31,195 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 02:10:31,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:31,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 02:10:31,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-22 02:10:31,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-22 02:10:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040760633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:31,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2024-11-22 02:10:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768261014] [2024-11-22 02:10:31,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 02:10:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 02:10:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-22 02:10:31,625 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 02:10:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:31,706 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2024-11-22 02:10:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 02:10:31,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 65 [2024-11-22 02:10:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:31,708 INFO L225 Difference]: With dead ends: 41 [2024-11-22 02:10:31,708 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 02:10:31,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-22 02:10:31,709 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:31,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 65 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 02:10:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 02:10:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-22 02:10:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2024-11-22 02:10:31,714 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 65 [2024-11-22 02:10:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2024-11-22 02:10:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 02:10:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2024-11-22 02:10:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-22 02:10:31,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:31,716 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:31,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 02:10:31,916 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-22 02:10:31,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:31,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1108497964, now seen corresponding path program 5 times [2024-11-22 02:10:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256429419] [2024-11-22 02:10:31,918 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 02:10:31,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:31,928 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-22 02:10:31,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 135 proven. 258 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-22 02:10:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256429419] [2024-11-22 02:10:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256429419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492802812] [2024-11-22 02:10:32,042 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 02:10:32,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:32,044 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-22 02:10:32,045 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-22 02:10:32,087 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-22 02:10:32,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:32,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 02:10:32,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 422 proven. 118 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-22 02:10:32,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 133 proven. 274 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-22 02:10:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492802812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:32,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 21 [2024-11-22 02:10:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355718776] [2024-11-22 02:10:32,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:32,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 02:10:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:32,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 02:10:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-22 02:10:32,852 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-22 02:10:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:33,026 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2024-11-22 02:10:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 02:10:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) Word has length 120 [2024-11-22 02:10:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:33,028 INFO L225 Difference]: With dead ends: 80 [2024-11-22 02:10:33,028 INFO L226 Difference]: Without dead ends: 46 [2024-11-22 02:10:33,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 02:10:33,029 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:33,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-22 02:10:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-22 02:10:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-22 02:10:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-11-22 02:10:33,037 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 120 [2024-11-22 02:10:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:33,038 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-11-22 02:10:33,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-22 02:10:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-11-22 02:10:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 02:10:33,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:33,039 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:33,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 02:10:33,243 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-22 02:10:33,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1447005449, now seen corresponding path program 6 times [2024-11-22 02:10:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478873679] [2024-11-22 02:10:33,245 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 02:10:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:33,274 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-22 02:10:33,274 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 317 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-22 02:10:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478873679] [2024-11-22 02:10:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478873679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:33,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994441078] [2024-11-22 02:10:33,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 02:10:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:33,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:33,384 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-22 02:10:33,385 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-22 02:10:33,443 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-22 02:10:33,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:10:33,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 02:10:33,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-22 02:10:33,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-11-22 02:10:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994441078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:34,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-22 02:10:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770803151] [2024-11-22 02:10:34,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:34,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 02:10:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 02:10:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-22 02:10:34,175 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-22 02:10:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:34,273 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-11-22 02:10:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 02:10:34,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 133 [2024-11-22 02:10:34,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:34,275 INFO L225 Difference]: With dead ends: 55 [2024-11-22 02:10:34,275 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 02:10:34,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-22 02:10:34,276 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:34,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 65 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 02:10:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-22 02:10:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-22 02:10:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-11-22 02:10:34,281 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 133 [2024-11-22 02:10:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:34,282 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-11-22 02:10:34,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-22 02:10:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-11-22 02:10:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-22 02:10:34,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:34,284 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 28, 17, 17, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:34,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 02:10:34,485 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-22 02:10:34,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1830341289, now seen corresponding path program 7 times [2024-11-22 02:10:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344677448] [2024-11-22 02:10:34,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-22 02:10:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-22 02:10:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:10:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344677448] [2024-11-22 02:10:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344677448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:10:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630587327] [2024-11-22 02:10:34,829 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-22 02:10:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:10:34,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 02:10:34,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 02:10:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:10:34,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 02:10:34,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:10:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-22 02:10:34,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 855 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2024-11-22 02:10:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630587327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:36,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2024-11-22 02:10:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277599557] [2024-11-22 02:10:36,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 02:10:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 02:10:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-22 02:10:36,383 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-22 02:10:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:36,483 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-11-22 02:10:36,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 02:10:36,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 242 [2024-11-22 02:10:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:36,485 INFO L225 Difference]: With dead ends: 60 [2024-11-22 02:10:36,485 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 02:10:36,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 476 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2024-11-22 02:10:36,486 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:36,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 02:10:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-22 02:10:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (34), 13 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-22 02:10:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-22 02:10:36,492 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 242 [2024-11-22 02:10:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:36,493 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-22 02:10:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-22 02:10:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-22 02:10:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-22 02:10:36,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:36,495 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-22 02:10:36,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 02:10:36,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 02:10:36,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:36,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 8 times [2024-11-22 02:10:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648948283] [2024-11-22 02:10:36,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:10:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:36,728 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:10:36,728 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 02:10:36,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 02:10:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:10:36,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 02:10:36,776 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 02:10:36,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:10:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 02:10:36,781 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2024-11-22 02:10:36,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:10:36,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:10:36 BoogieIcfgContainer [2024-11-22 02:10:36,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:10:36,828 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:10:36,828 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:10:36,828 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:10:36,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:10:26" (3/4) ... [2024-11-22 02:10:36,829 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 02:10:36,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:10:36,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:10:36,881 INFO L158 Benchmark]: Toolchain (without parser) took 10793.35ms. Allocated memory was 192.9MB in the beginning and 323.0MB in the end (delta: 130.0MB). Free memory was 122.1MB in the beginning and 182.7MB in the end (delta: -60.6MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,881 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:10:36,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.98ms. Allocated memory is still 192.9MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.74ms. Allocated memory is still 192.9MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:10:36,881 INFO L158 Benchmark]: Boogie Preprocessor took 27.09ms. Allocated memory is still 192.9MB. Free memory was 108.6MB in the beginning and 107.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,882 INFO L158 Benchmark]: RCFGBuilder took 272.18ms. Allocated memory is still 192.9MB. Free memory was 106.9MB in the beginning and 160.9MB in the end (delta: -53.9MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,882 INFO L158 Benchmark]: TraceAbstraction took 10098.88ms. Allocated memory was 192.9MB in the beginning and 323.0MB in the end (delta: 130.0MB). Free memory was 159.7MB in the beginning and 188.0MB in the end (delta: -28.2MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,882 INFO L158 Benchmark]: Witness Printer took 52.68ms. Allocated memory is still 323.0MB. Free memory was 188.0MB in the beginning and 182.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 02:10:36,883 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 192.9MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.98ms. Allocated memory is still 192.9MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.74ms. Allocated memory is still 192.9MB. Free memory was 109.9MB in the beginning and 108.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.09ms. Allocated memory is still 192.9MB. Free memory was 108.6MB in the beginning and 107.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.18ms. Allocated memory is still 192.9MB. Free memory was 106.9MB in the beginning and 160.9MB in the end (delta: -53.9MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10098.88ms. Allocated memory was 192.9MB in the beginning and 323.0MB in the end (delta: 130.0MB). Free memory was 159.7MB in the beginning and 188.0MB in the end (delta: -28.2MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 52.68ms. Allocated memory is still 323.0MB. Free memory was 188.0MB in the beginning and 182.7MB 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: 10.0s, OverallIterations: 11, TraceHistogramMax: 41, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 726 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 769 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 155 mSDtfsCounter, 769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1417 SyntacticMatches, 33 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=10, InterpolantAutomatonStates: 93, 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, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1772 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2197 ConstructedInterpolants, 0 QuantifiedInterpolants, 3826 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1472 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 12354/16929 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-22 02:10:36,903 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