./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_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:09:39,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:09:39,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:09:39,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:09:39,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:09:39,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:09:39,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:09:39,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:09:39,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:09:39,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:09:39,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:09:39,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:09:39,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:09:39,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:09:39,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:09:39,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:09:39,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:09:39,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:09:39,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:09:39,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:09:39,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:09:39,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:09:39,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:09:39,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:09:39,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:09:39,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:09:39,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:09:39,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:09:39,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:09:39,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:09:39,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:09:39,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:09:39,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:09:39,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:09:39,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:09:39,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:09:39,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:09:39,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:09:39,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:09:39,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:09:39,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:09:39,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:09:39,689 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2024-11-19 22:09:39,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:09:39,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:09:39,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:09:39,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:09:39,979 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:09:39,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-11-19 22:09:41,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:09:41,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:09:41,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-11-19 22:09:41,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbc7a6a5/664ba9ee208d4855a67dcab72759ed85/FLAG69f89c29b [2024-11-19 22:09:41,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcbc7a6a5/664ba9ee208d4855a67dcab72759ed85 [2024-11-19 22:09:41,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:09:41,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:09:41,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:09:41,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:09:41,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:09:41,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b911342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41, skipping insertion in model container [2024-11-19 22:09:41,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:09:41,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2024-11-19 22:09:41,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:09:41,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:09:41,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2024-11-19 22:09:41,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:09:41,817 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:09:41,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41 WrapperNode [2024-11-19 22:09:41,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:09:41,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:09:41,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:09:41,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:09:41,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,844 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-19 22:09:41,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:09:41,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:09:41,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:09:41,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:09:41,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:09:41,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:09:41,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:09:41,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:09:41,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:09:41,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (1/1) ... [2024-11-19 22:09:41,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:09:41,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:41,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:09:41,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:09:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:09:41,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:09:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:09:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:09:41,970 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-19 22:09:41,970 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-19 22:09:42,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:09:42,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:09:42,125 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-19 22:09:42,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:09:42,136 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:09:42,136 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:09:42,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:09:42 BoogieIcfgContainer [2024-11-19 22:09:42,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:09:42,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:09:42,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:09:42,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:09:42,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:09:41" (1/3) ... [2024-11-19 22:09:42,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb16a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:09:42, skipping insertion in model container [2024-11-19 22:09:42,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:09:41" (2/3) ... [2024-11-19 22:09:42,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb16a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:09:42, skipping insertion in model container [2024-11-19 22:09:42,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:09:42" (3/3) ... [2024-11-19 22:09:42,149 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2024-11-19 22:09:42,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:09:42,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:09:42,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:09:42,295 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;@46dd5b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:09:42,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:09:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:09:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 22:09:42,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:42,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:42,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:42,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-19 22:09:42,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250054766] [2024-11-19 22:09:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:42,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:09:42,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250054766] [2024-11-19 22:09:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250054766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:09:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:09:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:09:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037663908] [2024-11-19 22:09:42,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:09:42,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:09:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:42,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:09:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:09:42,678 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:09:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:42,714 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-19 22:09:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:09:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-19 22:09:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:42,726 INFO L225 Difference]: With dead ends: 30 [2024-11-19 22:09:42,727 INFO L226 Difference]: Without dead ends: 18 [2024-11-19 22:09:42,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:09:42,733 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:42,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:09:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-19 22:09:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-19 22:09:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 22:09:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-19 22:09:42,766 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-19 22:09:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:42,767 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-19 22:09:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:09:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-19 22:09:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 22:09:42,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:42,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:42,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:09:42,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:42,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-19 22:09:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:42,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570430996] [2024-11-19 22:09:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:09:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570430996] [2024-11-19 22:09:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570430996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:09:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:09:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:09:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738835660] [2024-11-19 22:09:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:09:42,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:09:42,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:09:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:09:42,886 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:09:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:42,910 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-19 22:09:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:09:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 22:09:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:42,913 INFO L225 Difference]: With dead ends: 24 [2024-11-19 22:09:42,913 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 22:09:42,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:09:42,915 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:42,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:09:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 22:09:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-19 22:09:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 22:09:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-19 22:09:42,924 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-19 22:09:42,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:42,925 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-19 22:09:42,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:09:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-19 22:09:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:09:42,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:42,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:42,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:09:42,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:42,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-19 22:09:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992215438] [2024-11-19 22:09:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 22:09:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:09:43,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:43,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992215438] [2024-11-19 22:09:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992215438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:43,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806426453] [2024-11-19 22:09:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:43,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:43,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:43,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:43,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:09:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:09:43,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 22:09:43,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:09:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806426453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:43,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:43,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-11-19 22:09:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993293250] [2024-11-19 22:09:43,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:43,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:09:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:09:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:09:43,576 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:09:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:43,664 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-19 22:09:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:09:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2024-11-19 22:09:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:43,666 INFO L225 Difference]: With dead ends: 35 [2024-11-19 22:09:43,666 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 22:09:43,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:09:43,668 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:43,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:09:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 22:09:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-19 22:09:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 22:09:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-19 22:09:43,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-19 22:09:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:43,675 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-19 22:09:43,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:09:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-19 22:09:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:09:43,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:43,677 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:43,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:09:43,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:43,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:43,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-19 22:09:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:43,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431049318] [2024-11-19 22:09:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:43,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:09:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431049318] [2024-11-19 22:09:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431049318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324127837] [2024-11-19 22:09:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:44,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:44,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:44,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:09:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:09:44,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:09:44,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 22:09:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324127837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:44,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-19 22:09:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468688154] [2024-11-19 22:09:44,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:44,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:09:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:09:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:09:44,360 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:09:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:44,476 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2024-11-19 22:09:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:09:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2024-11-19 22:09:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:44,479 INFO L225 Difference]: With dead ends: 38 [2024-11-19 22:09:44,480 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 22:09:44,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:09:44,482 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:44,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 59 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:09:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 22:09:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 22:09:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-19 22:09:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-19 22:09:44,501 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2024-11-19 22:09:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:44,501 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-19 22:09:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 22:09:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-11-19 22:09:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 22:09:44,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:44,504 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:44,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:09:44,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 22:09:44,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-19 22:09:44,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387482327] [2024-11-19 22:09:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:44,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 22:09:44,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387482327] [2024-11-19 22:09:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387482327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294610271] [2024-11-19 22:09:44,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 22:09:44,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:44,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:44,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:09:44,918 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 22:09:44,919 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:09:44,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:09:44,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 22:09:45,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 22:09:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294610271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:45,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:45,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-11-19 22:09:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328653782] [2024-11-19 22:09:45,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:45,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 22:09:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 22:09:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:09:45,400 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-19 22:09:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:45,576 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2024-11-19 22:09:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 22:09:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2024-11-19 22:09:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:45,580 INFO L225 Difference]: With dead ends: 69 [2024-11-19 22:09:45,581 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 22:09:45,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:09:45,584 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:45,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:09:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 22:09:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 22:09:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 22:09:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-19 22:09:45,596 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2024-11-19 22:09:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:45,596 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-19 22:09:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-19 22:09:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-19 22:09:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:09:45,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:45,601 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:45,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 22:09:45,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:45,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -721858190, now seen corresponding path program 3 times [2024-11-19 22:09:45,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200797168] [2024-11-19 22:09:45,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-19 22:09:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200797168] [2024-11-19 22:09:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200797168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591640052] [2024-11-19 22:09:46,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 22:09:46,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:46,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:46,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:46,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 22:09:46,203 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-19 22:09:46,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:09:46,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 22:09:46,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-19 22:09:46,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-19 22:09:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591640052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:46,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2024-11-19 22:09:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320760328] [2024-11-19 22:09:46,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 22:09:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 22:09:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:09:46,723 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-19 22:09:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:46,978 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2024-11-19 22:09:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:09:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 93 [2024-11-19 22:09:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:46,980 INFO L225 Difference]: With dead ends: 89 [2024-11-19 22:09:46,981 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 22:09:46,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-19 22:09:46,982 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:46,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:09:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 22:09:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-19 22:09:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 22:09:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-19 22:09:47,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 93 [2024-11-19 22:09:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:47,013 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-19 22:09:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-19 22:09:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-19 22:09:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 22:09:47,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:47,021 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:47,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 22:09:47,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:47,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash -292645265, now seen corresponding path program 4 times [2024-11-19 22:09:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:47,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200010278] [2024-11-19 22:09:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:47,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-19 22:09:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200010278] [2024-11-19 22:09:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200010278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405722704] [2024-11-19 22:09:47,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 22:09:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:47,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:47,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:47,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 22:09:47,740 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 22:09:47,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:09:47,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 22:09:47,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-11-19 22:09:47,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-11-19 22:09:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405722704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:48,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 20 [2024-11-19 22:09:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690924324] [2024-11-19 22:09:48,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 22:09:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 22:09:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:09:48,692 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-19 22:09:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:48,868 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2024-11-19 22:09:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:09:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) Word has length 106 [2024-11-19 22:09:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:48,874 INFO L225 Difference]: With dead ends: 122 [2024-11-19 22:09:48,874 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 22:09:48,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2024-11-19 22:09:48,878 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:48,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 79 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:09:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 22:09:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2024-11-19 22:09:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 71 states have internal predecessors, (83), 22 states have call successors, (22), 11 states have call predecessors, (22), 13 states have return successors, (49), 26 states have call predecessors, (49), 22 states have call successors, (49) [2024-11-19 22:09:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-19 22:09:48,908 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 106 [2024-11-19 22:09:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:48,909 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-19 22:09:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.0) internal successors, (54), 20 states have internal predecessors, (54), 17 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (24), 10 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-19 22:09:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-19 22:09:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-19 22:09:48,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:48,912 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:48,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 22:09:49,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:49,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:49,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash -943421620, now seen corresponding path program 5 times [2024-11-19 22:09:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:49,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320563698] [2024-11-19 22:09:49,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:09:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 393 proven. 617 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2024-11-19 22:09:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320563698] [2024-11-19 22:09:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320563698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837766711] [2024-11-19 22:09:49,992 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 22:09:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:49,995 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:49,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 22:09:50,095 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-19 22:09:50,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:09:50,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:09:50,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 489 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2024-11-19 22:09:50,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 624 proven. 522 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-19 22:09:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837766711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:52,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:52,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 21] total 33 [2024-11-19 22:09:52,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910873207] [2024-11-19 22:09:52,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:52,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 22:09:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:52,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 22:09:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 22:09:52,049 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-19 22:09:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:52,469 INFO L93 Difference]: Finished difference Result 199 states and 339 transitions. [2024-11-19 22:09:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 22:09:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) Word has length 201 [2024-11-19 22:09:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:52,471 INFO L225 Difference]: With dead ends: 199 [2024-11-19 22:09:52,472 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 22:09:52,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 437 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=641, Invalid=1909, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 22:09:52,475 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:52,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 202 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:09:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 22:09:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2024-11-19 22:09:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 58 states have internal predecessors, (62), 15 states have call successors, (15), 12 states have call predecessors, (15), 8 states have return successors, (36), 13 states have call predecessors, (36), 15 states have call successors, (36) [2024-11-19 22:09:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2024-11-19 22:09:52,486 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 201 [2024-11-19 22:09:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2024-11-19 22:09:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.84375) internal successors, (91), 33 states have internal predecessors, (91), 25 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (42), 20 states have call predecessors, (42), 25 states have call successors, (42) [2024-11-19 22:09:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2024-11-19 22:09:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-19 22:09:52,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:52,492 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:52,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 22:09:52,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:52,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1843553927, now seen corresponding path program 6 times [2024-11-19 22:09:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745265845] [2024-11-19 22:09:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:09:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:09:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:09:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2024-11-19 22:09:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745265845] [2024-11-19 22:09:54,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745265845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:54,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619554836] [2024-11-19 22:09:54,247 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 22:09:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:54,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 22:09:54,389 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2024-11-19 22:09:54,390 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:09:54,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 22:09:54,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2024-11-19 22:09:54,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:09:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 360 proven. 1160 refuted. 0 times theorem prover too weak. 5600 trivial. 0 not checked. [2024-11-19 22:09:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619554836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:09:55,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:09:55,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 15] total 33 [2024-11-19 22:09:55,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063244575] [2024-11-19 22:09:55,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:09:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 22:09:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:09:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 22:09:56,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 22:09:56,000 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-19 22:09:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:09:56,424 INFO L93 Difference]: Finished difference Result 186 states and 295 transitions. [2024-11-19 22:09:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 22:09:56,425 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) Word has length 351 [2024-11-19 22:09:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:09:56,429 INFO L225 Difference]: With dead ends: 186 [2024-11-19 22:09:56,431 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 22:09:56,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 789 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=623, Invalid=1927, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 22:09:56,435 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 115 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:09:56,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:09:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 22:09:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2024-11-19 22:09:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 70 states have internal predecessors, (75), 19 states have call successors, (19), 15 states have call predecessors, (19), 9 states have return successors, (42), 15 states have call predecessors, (42), 19 states have call successors, (42) [2024-11-19 22:09:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 136 transitions. [2024-11-19 22:09:56,448 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 136 transitions. Word has length 351 [2024-11-19 22:09:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:09:56,449 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 136 transitions. [2024-11-19 22:09:56,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 33 states have internal predecessors, (81), 23 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-19 22:09:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2024-11-19 22:09:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-11-19 22:09:56,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:09:56,460 INFO L215 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:09:56,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 22:09:56,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:56,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:09:56,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:09:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 7 times [2024-11-19 22:09:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:09:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124854005] [2024-11-19 22:09:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:09:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:09:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:09:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:09:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:09:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:09:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:09:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:09:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:09:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:09:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:09:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:09:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:09:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2024-11-19 22:09:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:09:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124854005] [2024-11-19 22:09:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124854005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:09:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851524424] [2024-11-19 22:09:58,640 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 22:09:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:09:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:09:58,643 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:09:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 22:09:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:09:58,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 22:09:58,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:09:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2024-11-19 22:09:58,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:10:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 3019 refuted. 0 times theorem prover too weak. 15683 trivial. 0 not checked. [2024-11-19 22:10:01,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851524424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:10:01,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:10:01,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 12, 19] total 39 [2024-11-19 22:10:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958262166] [2024-11-19 22:10:01,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:10:01,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 22:10:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:10:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 22:10:01,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 22:10:01,966 INFO L87 Difference]: Start difference. First operand 101 states and 136 transitions. Second operand has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) [2024-11-19 22:10:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:10:02,457 INFO L93 Difference]: Finished difference Result 228 states and 374 transitions. [2024-11-19 22:10:02,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-19 22:10:02,458 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) Word has length 569 [2024-11-19 22:10:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:10:02,460 INFO L225 Difference]: With dead ends: 228 [2024-11-19 22:10:02,460 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 22:10:02,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1352 GetRequests, 1285 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=871, Invalid=2789, Unknown=0, NotChecked=0, Total=3660 [2024-11-19 22:10:02,463 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 219 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:10:02,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 179 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:10:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 22:10:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2024-11-19 22:10:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 82 states have internal predecessors, (87), 23 states have call successors, (23), 18 states have call predecessors, (23), 10 states have return successors, (54), 17 states have call predecessors, (54), 23 states have call successors, (54) [2024-11-19 22:10:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-19 22:10:02,489 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 569 [2024-11-19 22:10:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:10:02,491 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-19 22:10:02,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 39 states have internal predecessors, (94), 30 states have call successors, (33), 1 states have call predecessors, (33), 15 states have return successors, (50), 26 states have call predecessors, (50), 30 states have call successors, (50) [2024-11-19 22:10:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-19 22:10:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2024-11-19 22:10:02,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:10:02,499 INFO L215 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:10:02,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 22:10:02,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 22:10:02,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:10:02,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:10:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash -586878367, now seen corresponding path program 8 times [2024-11-19 22:10:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:10:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741376199] [2024-11-19 22:10:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:10:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:10:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:03,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:10:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:10:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-19 22:10:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:05,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:10:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3273 proven. 6787 refuted. 0 times theorem prover too weak. 40850 trivial. 0 not checked. [2024-11-19 22:10:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:10:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741376199] [2024-11-19 22:10:06,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741376199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:10:06,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316699641] [2024-11-19 22:10:06,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 22:10:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:10:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:10:06,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:10:06,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 22:10:06,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 22:10:06,499 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:10:06,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:10:06,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:10:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2024-11-19 22:10:06,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:10:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5722 refuted. 0 times theorem prover too weak. 44464 trivial. 0 not checked. [2024-11-19 22:10:11,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316699641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:10:11,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:10:11,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 13, 21] total 43 [2024-11-19 22:10:11,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036048818] [2024-11-19 22:10:11,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:10:11,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 22:10:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:10:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 22:10:11,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 22:10:11,121 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) [2024-11-19 22:10:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:10:11,791 INFO L93 Difference]: Finished difference Result 266 states and 450 transitions. [2024-11-19 22:10:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 22:10:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) Word has length 923 [2024-11-19 22:10:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:10:11,797 INFO L225 Difference]: With dead ends: 266 [2024-11-19 22:10:11,797 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 22:10:11,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2172 GetRequests, 2095 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1111, Invalid=3581, Unknown=0, NotChecked=0, Total=4692 [2024-11-19 22:10:11,801 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 195 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:10:11,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 279 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:10:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 22:10:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2024-11-19 22:10:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 96 states have (on average 1.03125) internal successors, (99), 94 states have internal predecessors, (99), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (67), 19 states have call predecessors, (67), 27 states have call successors, (67) [2024-11-19 22:10:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2024-11-19 22:10:11,831 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 923 [2024-11-19 22:10:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:10:11,833 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2024-11-19 22:10:11,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4523809523809526) internal successors, (103), 43 states have internal predecessors, (103), 33 states have call successors, (36), 1 states have call predecessors, (36), 17 states have return successors, (56), 30 states have call predecessors, (56), 33 states have call successors, (56) [2024-11-19 22:10:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2024-11-19 22:10:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2024-11-19 22:10:11,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:10:11,847 INFO L215 NwaCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:10:11,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 22:10:12,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:10:12,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:10:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:10:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 9 times [2024-11-19 22:10:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:10:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997384508] [2024-11-19 22:10:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:10:12,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:10:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:10:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:14,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:10:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-19 22:10:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2024-11-19 22:10:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:16,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:16,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-19 22:10:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-19 22:10:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 22:10:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-19 22:10:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 22:10:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 22:10:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:10:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 22:10:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:10:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:10:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2024-11-19 22:10:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:10:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997384508] [2024-11-19 22:10:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997384508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:10:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559816417] [2024-11-19 22:10:17,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 22:10:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:10:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:10:17,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:10:17,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 22:10:17,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 104 check-sat command(s) [2024-11-19 22:10:17,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 22:10:17,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 1872 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 22:10:18,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:10:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5994 proven. 991 refuted. 0 times theorem prover too weak. 127619 trivial. 0 not checked. [2024-11-19 22:10:18,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:10:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5994 proven. 1046 refuted. 0 times theorem prover too weak. 127564 trivial. 0 not checked. [2024-11-19 22:10:22,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559816417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:10:22,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:10:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 10, 15] total 46 [2024-11-19 22:10:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239562965] [2024-11-19 22:10:22,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:10:22,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 22:10:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:10:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 22:10:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1604, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 22:10:22,371 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 24 states have call successors, (33), 1 states have call predecessors, (33), 21 states have return successors, (52), 41 states have call predecessors, (52), 24 states have call successors, (52) [2024-11-19 22:10:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:10:23,185 INFO L93 Difference]: Finished difference Result 343 states and 686 transitions. [2024-11-19 22:10:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-19 22:10:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 24 states have call successors, (33), 1 states have call predecessors, (33), 21 states have return successors, (52), 41 states have call predecessors, (52), 24 states have call successors, (52) Word has length 1495 [2024-11-19 22:10:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:10:23,190 INFO L225 Difference]: With dead ends: 343 [2024-11-19 22:10:23,190 INFO L226 Difference]: Without dead ends: 191 [2024-11-19 22:10:23,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3497 GetRequests, 3411 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1325, Invalid=5155, Unknown=0, NotChecked=0, Total=6480 [2024-11-19 22:10:23,195 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 311 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:10:23,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 295 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:10:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-19 22:10:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2024-11-19 22:10:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 115 states have (on average 1.017391304347826) internal successors, (117), 113 states have internal predecessors, (117), 34 states have call successors, (34), 27 states have call predecessors, (34), 11 states have return successors, (71), 20 states have call predecessors, (71), 34 states have call successors, (71) [2024-11-19 22:10:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2024-11-19 22:10:23,211 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 1495 [2024-11-19 22:10:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:10:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2024-11-19 22:10:23,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 46 states have internal predecessors, (101), 24 states have call successors, (33), 1 states have call predecessors, (33), 21 states have return successors, (52), 41 states have call predecessors, (52), 24 states have call successors, (52) [2024-11-19 22:10:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2024-11-19 22:10:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2024-11-19 22:10:23,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:10:23,223 INFO L215 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:10:23,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 22:10:23,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 22:10:23,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:10:23,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:10:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 10 times [2024-11-19 22:10:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:10:23,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827818362] [2024-11-19 22:10:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:10:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:10:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:10:23,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:10:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:10:23,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:10:23,953 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:10:23,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:10:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:10:23,960 INFO L407 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2024-11-19 22:10:24,143 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:10:24,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:10:24 BoogieIcfgContainer [2024-11-19 22:10:24,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:10:24,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:10:24,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:10:24,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:10:24,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:09:42" (3/4) ... [2024-11-19 22:10:24,148 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:10:24,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:10:24,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:10:24,268 INFO L158 Benchmark]: Toolchain (without parser) took 42671.39ms. Allocated memory was 140.5MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 86.4MB in the beginning and 499.9MB in the end (delta: -413.5MB). Peak memory consumption was 455.5MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,268 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory was 101.7MB in the beginning and 101.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:10:24,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.59ms. Allocated memory is still 140.5MB. Free memory was 86.4MB in the beginning and 74.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.05ms. Allocated memory is still 140.5MB. Free memory was 74.2MB in the beginning and 72.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:10:24,269 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 140.5MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,270 INFO L158 Benchmark]: RCFGBuilder took 261.66ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 61.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,270 INFO L158 Benchmark]: TraceAbstraction took 42007.24ms. Allocated memory was 140.5MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 60.6MB in the beginning and 519.7MB in the end (delta: -459.1MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,270 INFO L158 Benchmark]: Witness Printer took 120.94ms. Allocated memory is still 1.0GB. Free memory was 519.7MB in the beginning and 499.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 22:10:24,272 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.18ms. Allocated memory is still 140.5MB. Free memory was 101.7MB in the beginning and 101.6MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.59ms. Allocated memory is still 140.5MB. Free memory was 86.4MB in the beginning and 74.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.05ms. Allocated memory is still 140.5MB. Free memory was 74.2MB in the beginning and 72.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 140.5MB. Free memory was 72.8MB in the beginning and 71.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.66ms. Allocated memory is still 140.5MB. Free memory was 71.4MB in the beginning and 61.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 42007.24ms. Allocated memory was 140.5MB in the beginning and 1.0GB in the end (delta: 868.2MB). Free memory was 60.6MB in the beginning and 519.7MB in the end (delta: -459.1MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. * Witness Printer took 120.94ms. Allocated memory is still 1.0GB. Free memory was 519.7MB in the beginning and 499.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. 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 = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-2) 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); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) 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); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) 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-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [x=10] [L29] reach_error() VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.7s, OverallIterations: 13, TraceHistogramMax: 219, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1182 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1138 mSDsluCounter, 1661 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1361 mSDsCounter, 1042 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3161 IncrementalHoareTripleChecker+Invalid, 4203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1042 mSolverCounterUnsat, 300 mSDtfsCounter, 3161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9078 GetRequests, 8622 SyntacticMatches, 57 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7667 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=12, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 113 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 8874 NumberOfCodeBlocks, 7941 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 11455 ConstructedInterpolants, 0 QuantifiedInterpolants, 15319 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6565 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 596010/645141 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 22:10:24,317 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