./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:46:08,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:46:08,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:46:08,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:46:08,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:46:08,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:46:08,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:46:08,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:46:08,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:46:08,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:46:08,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:46:08,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:46:08,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:46:08,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:46:08,494 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:46:08,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:46:08,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:46:08,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:46:08,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:46:08,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:46:08,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:46:08,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:46:08,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:46:08,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:46:08,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:46:08,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:46:08,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:46:08,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:46:08,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:46:08,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:46:08,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:46:08,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:46:08,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:46:08,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:46:08,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:46:08,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:46:08,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:46:08,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:46:08,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:46:08,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:46:08,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:46:08,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:46:08,507 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-10-12 19:46:08,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:46:08,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:46:08,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:46:08,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:46:08,782 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:46:08,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-10-12 19:46:10,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:46:10,399 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:46:10,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2024-10-12 19:46:10,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fb83f01/a9b943c3583e4a3da2de3a56b1a515dc/FLAG89e70a7d6 [2024-10-12 19:46:10,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0fb83f01/a9b943c3583e4a3da2de3a56b1a515dc [2024-10-12 19:46:10,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:46:10,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:46:10,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:46:10,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:46:10,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:46:10,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672504ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10, skipping insertion in model container [2024-10-12 19:46:10,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:46:10,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-10-12 19:46:10,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:46:10,628 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:46:10,640 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2024-10-12 19:46:10,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:46:10,654 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:46:10,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10 WrapperNode [2024-10-12 19:46:10,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:46:10,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:46:10,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:46:10,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:46:10,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,681 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-12 19:46:10,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:46:10,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:46:10,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:46:10,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:46:10,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,700 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:46:10,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:46:10,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:46:10,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:46:10,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:46:10,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (1/1) ... [2024-10-12 19:46:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:46:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:10,738 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-10-12 19:46:10,743 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-10-12 19:46:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:46:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:46:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:46:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:46:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-10-12 19:46:10,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-10-12 19:46:10,847 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:46:10,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:46:10,946 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-12 19:46:10,947 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:46:10,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:46:10,975 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 19:46:10,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:10 BoogieIcfgContainer [2024-10-12 19:46:10,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:46:10,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:46:10,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:46:10,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:46:10,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:46:10" (1/3) ... [2024-10-12 19:46:10,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a9ca9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:46:10, skipping insertion in model container [2024-10-12 19:46:10,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:46:10" (2/3) ... [2024-10-12 19:46:10,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a9ca9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:46:10, skipping insertion in model container [2024-10-12 19:46:10,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:10" (3/3) ... [2024-10-12 19:46:10,984 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2024-10-12 19:46:10,999 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:46:11,000 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:46:11,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:46:11,063 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;@5c3ea19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:46:11,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:46:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:46:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 19:46:11,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:11,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:11,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:11,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2024-10-12 19:46:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140289891] [2024-10-12 19:46:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:46:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140289891] [2024-10-12 19:46:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140289891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:46:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:46:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:46:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85857653] [2024-10-12 19:46:11,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:46:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:46:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:46:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:46:11,418 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:46:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:11,464 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-12 19:46:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:46:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-12 19:46:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:11,475 INFO L225 Difference]: With dead ends: 25 [2024-10-12 19:46:11,475 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 19:46:11,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:46:11,480 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:11,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:46:11,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 19:46:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 19:46:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:46:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 19:46:11,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-10-12 19:46:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:11,516 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 19:46:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:46:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-12 19:46:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 19:46:11,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:11,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:11,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:46:11,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:11,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2024-10-12 19:46:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819730553] [2024-10-12 19:46:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:46:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819730553] [2024-10-12 19:46:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819730553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:46:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:46:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:46:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350737820] [2024-10-12 19:46:11,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:46:11,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:46:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:11,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:46:11,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:46:11,663 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:46:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:11,684 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-12 19:46:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:46:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-12 19:46:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:11,685 INFO L225 Difference]: With dead ends: 23 [2024-10-12 19:46:11,686 INFO L226 Difference]: Without dead ends: 19 [2024-10-12 19:46:11,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:46:11,687 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:11,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:46:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-12 19:46:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-12 19:46:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 19:46:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-12 19:46:11,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-10-12 19:46:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:11,699 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-12 19:46:11,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:46:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-12 19:46:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 19:46:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:11,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:46:11,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2024-10-12 19:46:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684832459] [2024-10-12 19:46:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:46:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:46:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684832459] [2024-10-12 19:46:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684832459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723446215] [2024-10-12 19:46:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:11,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:11,907 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-10-12 19:46:11,908 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-10-12 19:46:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:11,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:46:11,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:46:12,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 19:46:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723446215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:12,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:12,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-10-12 19:46:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206692296] [2024-10-12 19:46:12,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:12,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:46:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:46:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:46:12,323 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:46:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:12,429 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-10-12 19:46:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:46:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2024-10-12 19:46:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:12,431 INFO L225 Difference]: With dead ends: 34 [2024-10-12 19:46:12,431 INFO L226 Difference]: Without dead ends: 19 [2024-10-12 19:46:12,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:46:12,432 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:12,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:46:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-12 19:46:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 19:46:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:46:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-12 19:46:12,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2024-10-12 19:46:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:12,444 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-12 19:46:12,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 12 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:46:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-12 19:46:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:46:12,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:12,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:12,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:46:12,646 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-10-12 19:46:12,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2024-10-12 19:46:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530641113] [2024-10-12 19:46:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 19:46:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530641113] [2024-10-12 19:46:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530641113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986711481] [2024-10-12 19:46:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:12,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:12,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:12,859 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-10-12 19:46:12,863 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-10-12 19:46:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:12,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:46:12,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 19:46:12,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 19:46:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986711481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:13,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:13,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-10-12 19:46:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981209074] [2024-10-12 19:46:13,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:46:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:46:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:46:13,136 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:46:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:13,248 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-10-12 19:46:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:46:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-10-12 19:46:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:13,251 INFO L225 Difference]: With dead ends: 37 [2024-10-12 19:46:13,253 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 19:46:13,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:46:13,254 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:13,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:46:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 19:46:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-12 19:46:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-10-12 19:46:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-12 19:46:13,270 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2024-10-12 19:46:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-12 19:46:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 11 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:46:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-12 19:46:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 19:46:13,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:13,273 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:13,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:46:13,477 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-10-12 19:46:13,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:13,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2024-10-12 19:46:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657683586] [2024-10-12 19:46:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-12 19:46:13,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657683586] [2024-10-12 19:46:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657683586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770004320] [2024-10-12 19:46:13,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:46:13,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:13,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:13,727 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-10-12 19:46:13,729 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-10-12 19:46:13,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:46:13,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:46:13,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:46:13,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:46:13,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:46:14,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770004320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:14,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:14,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-10-12 19:46:14,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420430178] [2024-10-12 19:46:14,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:14,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 19:46:14,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 19:46:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:46:14,210 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-12 19:46:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:14,396 INFO L93 Difference]: Finished difference Result 68 states and 105 transitions. [2024-10-12 19:46:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:46:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 36 [2024-10-12 19:46:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:14,399 INFO L225 Difference]: With dead ends: 68 [2024-10-12 19:46:14,399 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 19:46:14,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:46:14,400 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:14,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:46:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 19:46:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-12 19:46:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-12 19:46:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-10-12 19:46:14,412 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 36 [2024-10-12 19:46:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:14,412 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-10-12 19:46:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-12 19:46:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-10-12 19:46:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:46:14,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:14,415 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:14,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:46:14,619 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-10-12 19:46:14,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -867130448, now seen corresponding path program 3 times [2024-10-12 19:46:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145832183] [2024-10-12 19:46:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-12 19:46:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145832183] [2024-10-12 19:46:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145832183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52170474] [2024-10-12 19:46:15,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:46:15,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:15,041 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-10-12 19:46:15,045 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-10-12 19:46:15,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 19:46:15,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:46:15,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:46:15,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-10-12 19:46:15,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 19:46:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52170474] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:15,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-10-12 19:46:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037521980] [2024-10-12 19:46:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 19:46:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 19:46:15,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:46:15,644 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-12 19:46:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:15,907 INFO L93 Difference]: Finished difference Result 88 states and 132 transitions. [2024-10-12 19:46:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:46:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 92 [2024-10-12 19:46:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:15,910 INFO L225 Difference]: With dead ends: 88 [2024-10-12 19:46:15,910 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 19:46:15,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-10-12 19:46:15,912 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:15,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 100 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:46:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 19:46:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-12 19:46:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-10-12 19:46:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-12 19:46:15,928 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 92 [2024-10-12 19:46:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:15,929 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-12 19:46:15,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-12 19:46:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-12 19:46:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 19:46:15,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:15,931 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:15,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:46:16,131 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-10-12 19:46:16,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1193756999, now seen corresponding path program 4 times [2024-10-12 19:46:16,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108671136] [2024-10-12 19:46:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:46:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2024-10-12 19:46:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108671136] [2024-10-12 19:46:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108671136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284653553] [2024-10-12 19:46:16,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:46:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:16,750 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-10-12 19:46:16,751 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-10-12 19:46:16,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:46:16,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:46:16,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 19:46:16,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-12 19:46:16,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-10-12 19:46:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284653553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:18,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 19] total 30 [2024-10-12 19:46:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148877945] [2024-10-12 19:46:18,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 19:46:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 19:46:18,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-10-12 19:46:18,348 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-12 19:46:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:18,686 INFO L93 Difference]: Finished difference Result 115 states and 178 transitions. [2024-10-12 19:46:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 19:46:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) Word has length 132 [2024-10-12 19:46:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:18,689 INFO L225 Difference]: With dead ends: 115 [2024-10-12 19:46:18,689 INFO L226 Difference]: Without dead ends: 72 [2024-10-12 19:46:18,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 281 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2024-10-12 19:46:18,691 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:18,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 116 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:46:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-12 19:46:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-12 19:46:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 45 states have internal predecessors, (49), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-12 19:46:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-12 19:46:18,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2024-10-12 19:46:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:18,702 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-12 19:46:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7586206896551726) internal successors, (80), 30 states have internal predecessors, (80), 24 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (36), 15 states have call predecessors, (36), 24 states have call successors, (36) [2024-10-12 19:46:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-12 19:46:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-12 19:46:18,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:18,705 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:18,721 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-10-12 19:46:18,909 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-10-12 19:46:18,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:18,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2122090202, now seen corresponding path program 5 times [2024-10-12 19:46:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718951590] [2024-10-12 19:46:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:46:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:46:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2024-10-12 19:46:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718951590] [2024-10-12 19:46:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718951590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555130216] [2024-10-12 19:46:19,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 19:46:19,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:19,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:19,527 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-10-12 19:46:19,531 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-10-12 19:46:19,637 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-12 19:46:19,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:46:19,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 19:46:19,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2024-10-12 19:46:19,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2024-10-12 19:46:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555130216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:20,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 20 [2024-10-12 19:46:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374923638] [2024-10-12 19:46:20,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:20,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 19:46:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 19:46:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:46:20,400 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-12 19:46:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:20,566 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2024-10-12 19:46:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:46:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) Word has length 173 [2024-10-12 19:46:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:20,572 INFO L225 Difference]: With dead ends: 182 [2024-10-12 19:46:20,574 INFO L226 Difference]: Without dead ends: 178 [2024-10-12 19:46:20,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 384 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:46:20,575 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:20,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 70 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:46:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-12 19:46:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-10-12 19:46:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 109 states have internal predecessors, (120), 33 states have call successors, (33), 19 states have call predecessors, (33), 18 states have return successors, (86), 37 states have call predecessors, (86), 33 states have call successors, (86) [2024-10-12 19:46:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2024-10-12 19:46:20,611 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2024-10-12 19:46:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:20,611 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2024-10-12 19:46:20,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-12 19:46:20,612 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2024-10-12 19:46:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-12 19:46:20,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:20,618 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:20,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 19:46:20,819 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-10-12 19:46:20,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:20,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:20,820 INFO L85 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 6 times [2024-10-12 19:46:20,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:20,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257750042] [2024-10-12 19:46:20,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:46:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:46:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:46:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-12 19:46:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:46:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:46:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:46:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:46:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:46:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:46:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:46:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1307 proven. 1260 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2024-10-12 19:46:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:46:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257750042] [2024-10-12 19:46:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257750042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:46:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331295004] [2024-10-12 19:46:22,196 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-12 19:46:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:46:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:46:22,198 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-10-12 19:46:22,199 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-10-12 19:46:22,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2024-10-12 19:46:22,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:46:22,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-12 19:46:22,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:46:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1174 proven. 810 refuted. 0 times theorem prover too weak. 4055 trivial. 0 not checked. [2024-10-12 19:46:22,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:46:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1350 proven. 678 refuted. 0 times theorem prover too weak. 4011 trivial. 0 not checked. [2024-10-12 19:46:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331295004] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:46:39,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:46:39,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 27] total 60 [2024-10-12 19:46:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198741354] [2024-10-12 19:46:39,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:46:39,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-10-12 19:46:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:46:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-10-12 19:46:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3168, Unknown=0, NotChecked=0, Total=3540 [2024-10-12 19:46:39,613 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) [2024-10-12 19:46:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:46:40,822 INFO L93 Difference]: Finished difference Result 281 states and 464 transitions. [2024-10-12 19:46:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-12 19:46:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) Word has length 323 [2024-10-12 19:46:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:46:40,825 INFO L225 Difference]: With dead ends: 281 [2024-10-12 19:46:40,826 INFO L226 Difference]: Without dead ends: 123 [2024-10-12 19:46:40,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 644 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1208, Invalid=9094, Unknown=0, NotChecked=0, Total=10302 [2024-10-12 19:46:40,831 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:46:40,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 259 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:46:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-12 19:46:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2024-10-12 19:46:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 66 states have internal predecessors, (71), 18 states have call successors, (18), 14 states have call predecessors, (18), 9 states have return successors, (43), 15 states have call predecessors, (43), 18 states have call successors, (43) [2024-10-12 19:46:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2024-10-12 19:46:40,843 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 323 [2024-10-12 19:46:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:46:40,844 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2024-10-12 19:46:40,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 43 states have internal predecessors, (88), 20 states have call successors, (24), 1 states have call predecessors, (24), 21 states have return successors, (50), 45 states have call predecessors, (50), 20 states have call successors, (50) [2024-10-12 19:46:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-10-12 19:46:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-12 19:46:40,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:46:40,848 INFO L215 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2024-10-12 19:46:40,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:46:41,052 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-10-12 19:46:41,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:46:41,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:46:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1893730074, now seen corresponding path program 7 times [2024-10-12 19:46:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:46:41,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748844500] [2024-10-12 19:46:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:46:41,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:46:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:46:41,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:46:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:46:41,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:46:41,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:46:41,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:46:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:46:41,173 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-10-12 19:46:41,256 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:46:41,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:46:41 BoogieIcfgContainer [2024-10-12 19:46:41,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:46:41,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:46:41,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:46:41,263 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:46:41,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:46:10" (3/4) ... [2024-10-12 19:46:41,264 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:46:41,349 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:46:41,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:46:41,351 INFO L158 Benchmark]: Toolchain (without parser) took 30923.09ms. Allocated memory was 146.8MB in the beginning and 520.1MB in the end (delta: 373.3MB). Free memory was 91.9MB in the beginning and 316.1MB in the end (delta: -224.2MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,352 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:46:41,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.40ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 79.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.00ms. Allocated memory is still 146.8MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,352 INFO L158 Benchmark]: Boogie Preprocessor took 24.13ms. Allocated memory is still 146.8MB. Free memory was 78.5MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,353 INFO L158 Benchmark]: RCFGBuilder took 268.05ms. Allocated memory is still 146.8MB. Free memory was 76.8MB in the beginning and 66.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,353 INFO L158 Benchmark]: TraceAbstraction took 30284.84ms. Allocated memory was 146.8MB in the beginning and 520.1MB in the end (delta: 373.3MB). Free memory was 65.9MB in the beginning and 322.4MB in the end (delta: -256.4MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,353 INFO L158 Benchmark]: Witness Printer took 86.39ms. Allocated memory is still 520.1MB. Free memory was 322.4MB in the beginning and 316.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:46:41,355 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.17ms. Allocated memory is still 146.8MB. Free memory is still 106.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.40ms. Allocated memory is still 146.8MB. Free memory was 91.5MB in the beginning and 79.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.00ms. Allocated memory is still 146.8MB. Free memory was 79.8MB in the beginning and 78.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.13ms. Allocated memory is still 146.8MB. Free memory was 78.5MB in the beginning and 76.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 268.05ms. Allocated memory is still 146.8MB. Free memory was 76.8MB in the beginning and 66.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30284.84ms. Allocated memory was 146.8MB in the beginning and 520.1MB in the end (delta: 373.3MB). Free memory was 65.9MB in the beginning and 322.4MB in the end (delta: -256.4MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 86.39ms. Allocated memory is still 520.1MB. Free memory was 322.4MB in the beginning and 316.1MB in the end (delta: 6.3MB). 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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 10, TraceHistogramMax: 47, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 834 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 682 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2317 IncrementalHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 152 mSDtfsCounter, 2317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2000 GetRequests, 1675 SyntacticMatches, 89 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7350 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=8, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1836 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 2399 ConstructedInterpolants, 0 QuantifiedInterpolants, 4800 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1751 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 22509/27375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 19:46:41,390 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